./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version fca748b1 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 6bebda7974b4ee09f480826bc3895f6f62b6e4c0586920bb97da4d140e226dad --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 14:32:30,314 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 14:32:30,389 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-20 14:32:30,395 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 14:32:30,395 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 14:32:30,417 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 14:32:30,418 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 14:32:30,418 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 14:32:30,418 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 14:32:30,418 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 14:32:30,419 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 14:32:30,419 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 14:32:30,421 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 14:32:30,424 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 14:32:30,424 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 14:32:30,425 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 14:32:30,425 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 14:32:30,425 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 14:32:30,425 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 14:32:30,425 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 14:32:30,425 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 14:32:30,426 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 14:32:30,427 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 14:32:30,427 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 14:32:30,427 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 14:32:30,427 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 14:32:30,428 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 14:32:30,428 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 14:32:30,428 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 14:32:30,428 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 14:32:30,429 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:32:30,429 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 14:32:30,429 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 14:32:30,430 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 14:32:30,430 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 14:32:30,430 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 14:32:30,430 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 14:32:30,430 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 14:32:30,431 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 14:32:30,431 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 6bebda7974b4ee09f480826bc3895f6f62b6e4c0586920bb97da4d140e226dad [2024-11-20 14:32:30,612 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 14:32:30,631 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 14:32:30,634 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 14:32:30,634 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 14:32:30,635 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 14:32:30,636 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i [2024-11-20 14:32:31,839 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 14:32:32,008 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 14:32:32,008 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/termination-15/cstrcspn_diffterm_alloca.i [2024-11-20 14:32:32,015 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d3f21894/de8c0db3f35746c0ae85f08c2ad55a94/FLAG220b0fca7 [2024-11-20 14:32:32,029 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6d3f21894/de8c0db3f35746c0ae85f08c2ad55a94 [2024-11-20 14:32:32,031 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 14:32:32,032 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 14:32:32,033 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 14:32:32,033 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 14:32:32,037 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 14:32:32,038 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:32:32" (1/1) ... [2024-11-20 14:32:32,039 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5d5cd498 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:32, skipping insertion in model container [2024-11-20 14:32:32,039 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:32:32" (1/1) ... [2024-11-20 14:32:32,068 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:32:32,321 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-20 14:32:32,321 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-20 14:32:32,323 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:32:32,331 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 14:32:32,372 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:32:32,404 INFO L204 MainTranslator]: Completed translation [2024-11-20 14:32:32,404 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:32 WrapperNode [2024-11-20 14:32:32,405 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 14:32:32,405 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 14:32:32,406 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 14:32:32,406 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 14:32:32,411 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:32" (1/1) ... [2024-11-20 14:32:32,420 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:32" (1/1) ... [2024-11-20 14:32:32,451 INFO L138 Inliner]: procedures = 152, calls = 16, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 81 [2024-11-20 14:32:32,451 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 14:32:32,452 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 14:32:32,452 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 14:32:32,452 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 14:32:32,462 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:32" (1/1) ... [2024-11-20 14:32:32,462 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:32" (1/1) ... [2024-11-20 14:32:32,464 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:32" (1/1) ... [2024-11-20 14:32:32,473 INFO L175 MemorySlicer]: Split 7 memory accesses to 2 slices as follows [3, 4]. 57 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0, 0]. The 2 writes are split as follows [1, 1]. [2024-11-20 14:32:32,474 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:32" (1/1) ... [2024-11-20 14:32:32,483 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:32" (1/1) ... [2024-11-20 14:32:32,487 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:32" (1/1) ... [2024-11-20 14:32:32,489 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:32" (1/1) ... [2024-11-20 14:32:32,490 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:32" (1/1) ... [2024-11-20 14:32:32,491 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:32" (1/1) ... [2024-11-20 14:32:32,492 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 14:32:32,497 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 14:32:32,497 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 14:32:32,497 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 14:32:32,497 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:32" (1/1) ... [2024-11-20 14:32:32,503 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:32:32,512 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:32:32,524 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-20 14:32:32,526 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-20 14:32:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-20 14:32:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-20 14:32:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-20 14:32:32,561 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-20 14:32:32,562 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 14:32:32,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 14:32:32,562 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 14:32:32,562 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 14:32:32,621 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 14:32:32,623 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 14:32:32,788 INFO L? ?]: Removed 54 outVars from TransFormulas that were not future-live. [2024-11-20 14:32:32,788 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 14:32:32,797 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 14:32:32,799 INFO L316 CfgBuilder]: Removed 2 assume(true) statements. [2024-11-20 14:32:32,799 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:32:32 BoogieIcfgContainer [2024-11-20 14:32:32,799 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 14:32:32,801 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 14:32:32,801 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 14:32:32,804 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 14:32:32,804 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:32:32" (1/3) ... [2024-11-20 14:32:32,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79304ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:32:32, skipping insertion in model container [2024-11-20 14:32:32,805 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:32:32" (2/3) ... [2024-11-20 14:32:32,805 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79304ac1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:32:32, skipping insertion in model container [2024-11-20 14:32:32,806 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:32:32" (3/3) ... [2024-11-20 14:32:32,807 INFO L112 eAbstractionObserver]: Analyzing ICFG cstrcspn_diffterm_alloca.i [2024-11-20 14:32:32,820 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 14:32:32,820 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 15 error locations. [2024-11-20 14:32:32,850 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:32:32,855 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;@3af8effa, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:32:32,855 INFO L334 AbstractCegarLoop]: Starting to check reachability of 15 error locations. [2024-11-20 14:32:32,858 INFO L276 IsEmpty]: Start isEmpty. Operand has 41 states, 25 states have (on average 1.92) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:32,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 14:32:32,861 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:32,862 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 14:32:32,862 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:32,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:32,866 INFO L85 PathProgramCache]: Analyzing trace with hash 889510731, now seen corresponding path program 1 times [2024-11-20 14:32:32,873 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:32,873 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389453026] [2024-11-20 14:32:32,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:32,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:33,116 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-20 14:32:33,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:33,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389453026] [2024-11-20 14:32:33,117 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389453026] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:33,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:33,118 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:32:33,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2020418732] [2024-11-20 14:32:33,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:33,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:32:33,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:33,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:32:33,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:32:33,141 INFO L87 Difference]: Start difference. First operand has 41 states, 25 states have (on average 1.92) internal successors, (48), 40 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:33,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:33,175 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2024-11-20 14:32:33,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:32:33,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-20 14:32:33,177 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:33,182 INFO L225 Difference]: With dead ends: 40 [2024-11-20 14:32:33,182 INFO L226 Difference]: Without dead ends: 38 [2024-11-20 14:32:33,185 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-20 14:32:33,188 INFO L432 NwaCegarLoop]: 40 mSDtfsCounter, 4 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:33,189 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 63 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:32:33,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-20 14:32:33,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-20 14:32:33,223 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 24 states have (on average 1.7916666666666667) internal successors, (43), 37 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-20 14:32:33,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-11-20 14:32:33,225 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 6 [2024-11-20 14:32:33,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:33,225 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-20 14:32:33,225 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:33,225 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-11-20 14:32:33,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 14:32:33,226 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:33,226 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 14:32:33,226 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 14:32:33,226 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:33,227 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:33,227 INFO L85 PathProgramCache]: Analyzing trace with hash 889510732, now seen corresponding path program 1 times [2024-11-20 14:32:33,227 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:33,227 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [471662892] [2024-11-20 14:32:33,228 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:33,228 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:33,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:33,507 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-20 14:32:33,508 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:33,508 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [471662892] [2024-11-20 14:32:33,508 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [471662892] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:33,508 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:33,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:32:33,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891944489] [2024-11-20 14:32:33,508 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:33,509 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:32:33,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:33,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:32:33,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:32:33,511 INFO L87 Difference]: Start difference. First operand 38 states and 43 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:33,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:33,561 INFO L93 Difference]: Finished difference Result 41 states and 47 transitions. [2024-11-20 14:32:33,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:32:33,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-20 14:32:33,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:33,562 INFO L225 Difference]: With dead ends: 41 [2024-11-20 14:32:33,563 INFO L226 Difference]: Without dead ends: 41 [2024-11-20 14:32:33,563 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-20 14:32:33,564 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 1 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:33,565 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 102 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:32:33,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2024-11-20 14:32:33,569 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 41. [2024-11-20 14:32:33,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 27 states have (on average 1.7407407407407407) internal successors, (47), 40 states have internal predecessors, (47), 0 states have call successors, (0), 0 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-20 14:32:33,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2024-11-20 14:32:33,570 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 6 [2024-11-20 14:32:33,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:33,572 INFO L471 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2024-11-20 14:32:33,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:33,572 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2024-11-20 14:32:33,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 14:32:33,574 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:33,574 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 14:32:33,574 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 14:32:33,575 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:33,575 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:33,576 INFO L85 PathProgramCache]: Analyzing trace with hash 889570314, now seen corresponding path program 1 times [2024-11-20 14:32:33,576 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:33,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1888742178] [2024-11-20 14:32:33,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:33,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:33,732 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-20 14:32:33,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:33,733 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1888742178] [2024-11-20 14:32:33,733 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1888742178] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:33,733 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:33,733 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:32:33,733 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743395700] [2024-11-20 14:32:33,733 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:33,734 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:32:33,734 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:33,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:32:33,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:32:33,734 INFO L87 Difference]: Start difference. First operand 41 states and 47 transitions. Second operand has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:33,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:33,749 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2024-11-20 14:32:33,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:32:33,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-20 14:32:33,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:33,751 INFO L225 Difference]: With dead ends: 40 [2024-11-20 14:32:33,751 INFO L226 Difference]: Without dead ends: 40 [2024-11-20 14:32:33,751 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-20 14:32:33,752 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 1 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 110 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:33,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 110 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:32:33,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-20 14:32:33,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 37. [2024-11-20 14:32:33,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 24 states have (on average 1.75) internal successors, (42), 36 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:33,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 42 transitions. [2024-11-20 14:32:33,760 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 42 transitions. Word has length 6 [2024-11-20 14:32:33,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:33,760 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 42 transitions. [2024-11-20 14:32:33,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.5) internal successors, (6), 5 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:33,762 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 42 transitions. [2024-11-20 14:32:33,763 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-20 14:32:33,763 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:33,763 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:33,763 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 14:32:33,763 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:33,763 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:33,763 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028874, now seen corresponding path program 1 times [2024-11-20 14:32:33,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:33,764 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [232778668] [2024-11-20 14:32:33,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:33,764 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:33,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:33,800 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-20 14:32:33,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:33,800 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [232778668] [2024-11-20 14:32:33,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [232778668] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:33,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:33,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:32:33,802 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [833900094] [2024-11-20 14:32:33,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:33,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:32:33,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:33,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:32:33,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:32:33,803 INFO L87 Difference]: Start difference. First operand 37 states and 42 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-20 14:32:33,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:33,830 INFO L93 Difference]: Finished difference Result 36 states and 41 transitions. [2024-11-20 14:32:33,831 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:32:33,831 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-20 14:32:33,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:33,832 INFO L225 Difference]: With dead ends: 36 [2024-11-20 14:32:33,832 INFO L226 Difference]: Without dead ends: 36 [2024-11-20 14:32:33,832 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-20 14:32:33,833 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:33,833 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 59 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:32:33,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-20 14:32:33,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-20 14:32:33,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 24 states have (on average 1.7083333333333333) internal successors, (41), 35 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-20 14:32:33,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2024-11-20 14:32:33,836 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 7 [2024-11-20 14:32:33,836 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:33,837 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2024-11-20 14:32:33,837 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-20 14:32:33,837 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2024-11-20 14:32:33,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-20 14:32:33,837 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:33,837 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:33,838 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 14:32:33,838 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:33,838 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:33,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1805028875, now seen corresponding path program 1 times [2024-11-20 14:32:33,839 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:33,839 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [628016211] [2024-11-20 14:32:33,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:33,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:33,852 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:33,938 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-20 14:32:33,939 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:33,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [628016211] [2024-11-20 14:32:33,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [628016211] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:33,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:33,939 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:32:33,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [231655494] [2024-11-20 14:32:33,939 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:33,939 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:32:33,939 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:33,940 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:32:33,940 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:32:33,940 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:33,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:33,959 INFO L93 Difference]: Finished difference Result 39 states and 44 transitions. [2024-11-20 14:32:33,959 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:32:33,960 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2024-11-20 14:32:33,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:33,960 INFO L225 Difference]: With dead ends: 39 [2024-11-20 14:32:33,960 INFO L226 Difference]: Without dead ends: 39 [2024-11-20 14:32:33,960 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-20 14:32:33,961 INFO L432 NwaCegarLoop]: 38 mSDtfsCounter, 0 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:33,961 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 73 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:32:33,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-20 14:32:33,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2024-11-20 14:32:33,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 27 states have (on average 1.6296296296296295) internal successors, (44), 38 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-20 14:32:33,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 44 transitions. [2024-11-20 14:32:33,967 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 44 transitions. Word has length 7 [2024-11-20 14:32:33,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:33,968 INFO L471 AbstractCegarLoop]: Abstraction has 39 states and 44 transitions. [2024-11-20 14:32:33,968 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:33,968 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 44 transitions. [2024-11-20 14:32:33,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-20 14:32:33,968 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:33,968 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:33,968 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 14:32:33,969 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:33,969 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:33,970 INFO L85 PathProgramCache]: Analyzing trace with hash 1805088457, now seen corresponding path program 1 times [2024-11-20 14:32:33,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:33,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452608593] [2024-11-20 14:32:33,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:33,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:33,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:34,061 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-20 14:32:34,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:34,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452608593] [2024-11-20 14:32:34,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452608593] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:34,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:34,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:32:34,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664039355] [2024-11-20 14:32:34,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:34,062 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:32:34,062 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:34,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:32:34,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:32:34,063 INFO L87 Difference]: Start difference. First operand 39 states and 44 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-20 14:32:34,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:34,076 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2024-11-20 14:32:34,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:32:34,078 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-20 14:32:34,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:34,078 INFO L225 Difference]: With dead ends: 38 [2024-11-20 14:32:34,078 INFO L226 Difference]: Without dead ends: 38 [2024-11-20 14:32:34,079 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-20 14:32:34,079 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 1 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:34,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 71 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:32:34,080 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-20 14:32:34,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 35. [2024-11-20 14:32:34,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 24 states have (on average 1.6666666666666667) internal successors, (40), 34 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:34,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 40 transitions. [2024-11-20 14:32:34,086 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 40 transitions. Word has length 7 [2024-11-20 14:32:34,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:34,086 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 40 transitions. [2024-11-20 14:32:34,086 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-20 14:32:34,086 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 40 transitions. [2024-11-20 14:32:34,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-20 14:32:34,086 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:34,086 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:34,086 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 14:32:34,086 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:34,087 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:34,087 INFO L85 PathProgramCache]: Analyzing trace with hash -534039922, now seen corresponding path program 1 times [2024-11-20 14:32:34,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:34,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1867156077] [2024-11-20 14:32:34,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:34,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:34,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:34,134 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-20 14:32:34,134 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:34,134 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1867156077] [2024-11-20 14:32:34,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1867156077] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:34,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:34,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:32:34,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [768348832] [2024-11-20 14:32:34,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:34,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:32:34,136 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:34,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:32:34,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:32:34,137 INFO L87 Difference]: Start difference. First operand 35 states and 40 transitions. Second operand has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:34,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:34,175 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2024-11-20 14:32:34,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:32:34,176 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2024-11-20 14:32:34,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:34,176 INFO L225 Difference]: With dead ends: 33 [2024-11-20 14:32:34,176 INFO L226 Difference]: Without dead ends: 33 [2024-11-20 14:32:34,176 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-20 14:32:34,177 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 23 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:34,179 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 46 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:32:34,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-20 14:32:34,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-20 14:32:34,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 24 states have (on average 1.5833333333333333) internal successors, (38), 32 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:34,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2024-11-20 14:32:34,181 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 9 [2024-11-20 14:32:34,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:34,181 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2024-11-20 14:32:34,181 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.0) internal successors, (9), 4 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:34,181 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2024-11-20 14:32:34,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2024-11-20 14:32:34,181 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:34,181 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:34,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 14:32:34,182 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:34,182 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:34,182 INFO L85 PathProgramCache]: Analyzing trace with hash -534039921, now seen corresponding path program 1 times [2024-11-20 14:32:34,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:34,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622374272] [2024-11-20 14:32:34,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:34,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:34,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:34,260 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-20 14:32:34,260 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:34,260 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622374272] [2024-11-20 14:32:34,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622374272] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:34,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:34,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:32:34,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1513212421] [2024-11-20 14:32:34,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:34,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:32:34,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:34,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:32:34,262 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:32:34,262 INFO L87 Difference]: Start difference. First operand 33 states and 38 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-20 14:32:34,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:34,318 INFO L93 Difference]: Finished difference Result 53 states and 62 transitions. [2024-11-20 14:32:34,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:32:34,319 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-20 14:32:34,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:34,320 INFO L225 Difference]: With dead ends: 53 [2024-11-20 14:32:34,320 INFO L226 Difference]: Without dead ends: 53 [2024-11-20 14:32:34,320 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:32:34,321 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 22 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 80 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 82 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 80 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:34,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 101 Invalid, 82 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 80 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:32:34,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2024-11-20 14:32:34,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2024-11-20 14:32:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 27 states have (on average 1.5555555555555556) internal successors, (42), 35 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-20 14:32:34,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2024-11-20 14:32:34,327 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 9 [2024-11-20 14:32:34,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:34,327 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-11-20 14:32:34,327 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-20 14:32:34,327 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2024-11-20 14:32:34,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 14:32:34,328 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:34,328 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:34,328 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 14:32:34,328 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:34,328 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:34,328 INFO L85 PathProgramCache]: Analyzing trace with hash -1693144940, now seen corresponding path program 1 times [2024-11-20 14:32:34,328 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:34,328 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [504755613] [2024-11-20 14:32:34,328 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:34,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:34,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:34,384 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-20 14:32:34,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:34,385 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [504755613] [2024-11-20 14:32:34,385 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [504755613] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:34,385 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:34,385 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:32:34,385 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1726674848] [2024-11-20 14:32:34,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:34,386 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:32:34,386 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:34,386 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:32:34,387 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:32:34,387 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-20 14:32:34,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:34,433 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2024-11-20 14:32:34,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:32:34,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-20 14:32:34,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:34,434 INFO L225 Difference]: With dead ends: 33 [2024-11-20 14:32:34,435 INFO L226 Difference]: Without dead ends: 33 [2024-11-20 14:32:34,435 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-20 14:32:34,435 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 31 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:34,435 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 52 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:32:34,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2024-11-20 14:32:34,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2024-11-20 14:32:34,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 32 states have internal predecessors, (39), 0 states have call successors, (0), 0 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-20 14:32:34,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2024-11-20 14:32:34,438 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 13 [2024-11-20 14:32:34,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:34,439 INFO L471 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2024-11-20 14:32:34,439 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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-20 14:32:34,439 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2024-11-20 14:32:34,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 14:32:34,439 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:34,439 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:34,439 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 14:32:34,440 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:34,440 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:34,440 INFO L85 PathProgramCache]: Analyzing trace with hash -1693144939, now seen corresponding path program 1 times [2024-11-20 14:32:34,440 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:34,440 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1143364938] [2024-11-20 14:32:34,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:34,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:34,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:34,614 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-20 14:32:34,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:34,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1143364938] [2024-11-20 14:32:34,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1143364938] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:34,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:34,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 14:32:34,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1755661142] [2024-11-20 14:32:34,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:34,615 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 14:32:34,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:34,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 14:32:34,615 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:32:34,615 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:34,672 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:34,672 INFO L93 Difference]: Finished difference Result 40 states and 48 transitions. [2024-11-20 14:32:34,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:32:34,672 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-20 14:32:34,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:34,673 INFO L225 Difference]: With dead ends: 40 [2024-11-20 14:32:34,673 INFO L226 Difference]: Without dead ends: 40 [2024-11-20 14:32:34,673 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:32:34,673 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 39 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 67 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 67 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:34,673 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 77 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 67 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:32:34,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-20 14:32:34,675 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 40. [2024-11-20 14:32:34,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 34 states have (on average 1.411764705882353) internal successors, (48), 39 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-20 14:32:34,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 48 transitions. [2024-11-20 14:32:34,675 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 48 transitions. Word has length 13 [2024-11-20 14:32:34,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:34,675 INFO L471 AbstractCegarLoop]: Abstraction has 40 states and 48 transitions. [2024-11-20 14:32:34,676 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.1666666666666665) internal successors, (13), 7 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:34,676 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 48 transitions. [2024-11-20 14:32:34,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 14:32:34,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:34,676 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:34,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 14:32:34,676 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:34,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:34,676 INFO L85 PathProgramCache]: Analyzing trace with hash -1693161859, now seen corresponding path program 1 times [2024-11-20 14:32:34,677 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:34,677 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1808817228] [2024-11-20 14:32:34,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:34,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:34,764 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-20 14:32:34,764 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:34,764 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1808817228] [2024-11-20 14:32:34,764 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1808817228] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:34,764 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:34,764 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:32:34,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956275204] [2024-11-20 14:32:34,764 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:34,764 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:32:34,765 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:34,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:32:34,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:32:34,765 INFO L87 Difference]: Start difference. First operand 40 states and 48 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-20 14:32:34,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:34,780 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2024-11-20 14:32:34,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:32:34,780 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-20 14:32:34,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:34,781 INFO L225 Difference]: With dead ends: 39 [2024-11-20 14:32:34,781 INFO L226 Difference]: Without dead ends: 36 [2024-11-20 14:32:34,781 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-20 14:32:34,781 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 22 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:34,782 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 48 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:32:34,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-20 14:32:34,783 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-20 14:32:34,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.3548387096774193) internal successors, (42), 35 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-20 14:32:34,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2024-11-20 14:32:34,783 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 13 [2024-11-20 14:32:34,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:34,783 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2024-11-20 14:32:34,783 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-20 14:32:34,783 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2024-11-20 14:32:34,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-20 14:32:34,784 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:34,784 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:34,784 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 14:32:34,785 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:34,786 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:34,786 INFO L85 PathProgramCache]: Analyzing trace with hash 950889964, now seen corresponding path program 1 times [2024-11-20 14:32:34,786 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:34,786 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [777340807] [2024-11-20 14:32:34,786 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:34,786 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:34,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:34,809 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-20 14:32:34,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:34,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [777340807] [2024-11-20 14:32:34,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [777340807] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:34,809 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:34,809 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:32:34,809 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853204975] [2024-11-20 14:32:34,809 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:34,809 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:32:34,810 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:34,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:32:34,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:32:34,810 INFO L87 Difference]: Start difference. First operand 36 states and 42 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-20 14:32:34,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:34,818 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2024-11-20 14:32:34,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:32:34,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-20 14:32:34,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:34,819 INFO L225 Difference]: With dead ends: 38 [2024-11-20 14:32:34,819 INFO L226 Difference]: Without dead ends: 38 [2024-11-20 14:32:34,819 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:32:34,819 INFO L432 NwaCegarLoop]: 29 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:34,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 52 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:32:34,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-20 14:32:34,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-20 14:32:34,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.3333333333333333) internal successors, (44), 37 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-20 14:32:34,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 44 transitions. [2024-11-20 14:32:34,823 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 44 transitions. Word has length 17 [2024-11-20 14:32:34,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:34,823 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 44 transitions. [2024-11-20 14:32:34,823 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 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-20 14:32:34,823 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2024-11-20 14:32:34,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-20 14:32:34,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:34,823 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:34,824 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 14:32:34,824 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:34,824 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:34,824 INFO L85 PathProgramCache]: Analyzing trace with hash -1028637879, now seen corresponding path program 1 times [2024-11-20 14:32:34,825 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:34,825 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2129046265] [2024-11-20 14:32:34,825 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:34,825 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:34,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:34,983 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-20 14:32:34,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:34,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2129046265] [2024-11-20 14:32:34,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2129046265] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:34,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:34,984 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-20 14:32:34,984 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573147711] [2024-11-20 14:32:34,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:34,984 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 14:32:34,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:34,985 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 14:32:34,985 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:32:34,985 INFO L87 Difference]: Start difference. First operand 38 states and 44 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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-20 14:32:35,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:35,014 INFO L93 Difference]: Finished difference Result 45 states and 51 transitions. [2024-11-20 14:32:35,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:32:35,014 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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-20 14:32:35,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:35,014 INFO L225 Difference]: With dead ends: 45 [2024-11-20 14:32:35,015 INFO L226 Difference]: Without dead ends: 38 [2024-11-20 14:32:35,015 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:32:35,015 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 2 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:35,015 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 122 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:32:35,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2024-11-20 14:32:35,016 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2024-11-20 14:32:35,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.303030303030303) internal successors, (43), 37 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-20 14:32:35,017 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 43 transitions. [2024-11-20 14:32:35,017 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 43 transitions. Word has length 19 [2024-11-20 14:32:35,017 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:35,017 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 43 transitions. [2024-11-20 14:32:35,017 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 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-20 14:32:35,017 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 43 transitions. [2024-11-20 14:32:35,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-20 14:32:35,017 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:35,018 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-20 14:32:35,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-20 14:32:35,018 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:35,020 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:35,020 INFO L85 PathProgramCache]: Analyzing trace with hash 1677981515, now seen corresponding path program 1 times [2024-11-20 14:32:35,021 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:35,021 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643989779] [2024-11-20 14:32:35,021 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:35,021 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:35,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:35,182 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-20 14:32:35,182 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:35,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643989779] [2024-11-20 14:32:35,183 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643989779] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:32:35,183 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:32:35,183 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 14:32:35,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1646563636] [2024-11-20 14:32:35,183 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:32:35,183 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-20 14:32:35,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:35,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-20 14:32:35,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2024-11-20 14:32:35,184 INFO L87 Difference]: Start difference. First operand 38 states and 43 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-20 14:32:35,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:35,250 INFO L93 Difference]: Finished difference Result 58 states and 63 transitions. [2024-11-20 14:32:35,251 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 14:32:35,251 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-20 14:32:35,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:35,251 INFO L225 Difference]: With dead ends: 58 [2024-11-20 14:32:35,251 INFO L226 Difference]: Without dead ends: 58 [2024-11-20 14:32:35,251 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-20 14:32:35,252 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 18 mSDsluCounter, 126 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:35,252 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 146 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:32:35,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-20 14:32:35,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2024-11-20 14:32:35,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 51 states have (on average 1.2352941176470589) internal successors, (63), 55 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-20 14:32:35,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2024-11-20 14:32:35,254 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 19 [2024-11-20 14:32:35,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:35,255 INFO L471 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2024-11-20 14:32:35,255 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-20 14:32:35,255 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2024-11-20 14:32:35,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-20 14:32:35,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:35,255 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-20 14:32:35,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-20 14:32:35,256 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:35,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:35,256 INFO L85 PathProgramCache]: Analyzing trace with hash 656913161, now seen corresponding path program 1 times [2024-11-20 14:32:35,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:35,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790592576] [2024-11-20 14:32:35,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:35,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:35,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:35,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:35,531 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:35,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790592576] [2024-11-20 14:32:35,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790592576] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:32:35,531 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1796689822] [2024-11-20 14:32:35,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:35,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:32:35,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:32:35,534 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-20 14:32:35,535 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-20 14:32:35,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:35,594 INFO L255 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-11-20 14:32:35,611 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:32:35,683 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-20 14:32:35,844 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:32:35,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 15 [2024-11-20 14:32:35,971 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:35,971 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:32:36,205 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-20 14:32:36,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 12 [2024-11-20 14:32:36,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-20 14:32:36,252 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:36,252 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1796689822] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:32:36,252 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:32:36,252 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 25 [2024-11-20 14:32:36,253 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [844241616] [2024-11-20 14:32:36,253 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:32:36,253 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-20 14:32:36,253 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:36,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-20 14:32:36,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=560, Unknown=0, NotChecked=0, Total=650 [2024-11-20 14:32:36,254 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 26 states, 25 states have (on average 1.92) internal successors, (48), 26 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-20 14:32:36,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:36,684 INFO L93 Difference]: Finished difference Result 63 states and 72 transitions. [2024-11-20 14:32:36,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-20 14:32:36,684 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 1.92) internal successors, (48), 26 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-20 14:32:36,685 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:36,685 INFO L225 Difference]: With dead ends: 63 [2024-11-20 14:32:36,685 INFO L226 Difference]: Without dead ends: 63 [2024-11-20 14:32:36,685 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 196 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=205, Invalid=1055, Unknown=0, NotChecked=0, Total=1260 [2024-11-20 14:32:36,686 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 122 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 122 SdHoareTripleChecker+Valid, 114 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:36,686 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [122 Valid, 114 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:32:36,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2024-11-20 14:32:36,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 53. [2024-11-20 14:32:36,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 50 states have (on average 1.2) internal successors, (60), 52 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-20 14:32:36,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 60 transitions. [2024-11-20 14:32:36,688 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 60 transitions. Word has length 19 [2024-11-20 14:32:36,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:36,688 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 60 transitions. [2024-11-20 14:32:36,691 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 1.92) internal successors, (48), 26 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-20 14:32:36,691 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 60 transitions. [2024-11-20 14:32:36,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-20 14:32:36,691 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:36,691 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-20 14:32:36,700 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-20 14:32:36,892 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,SelfDestructingSolverStorable14 [2024-11-20 14:32:36,892 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:36,893 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:36,893 INFO L85 PathProgramCache]: Analyzing trace with hash 658274998, now seen corresponding path program 1 times [2024-11-20 14:32:36,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:36,893 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [561834260] [2024-11-20 14:32:36,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:36,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:36,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:37,099 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:37,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:37,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [561834260] [2024-11-20 14:32:37,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [561834260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:32:37,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1371692083] [2024-11-20 14:32:37,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:37,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:32:37,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:32:37,102 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:32:37,103 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-20 14:32:37,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:37,163 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-11-20 14:32:37,169 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:32:37,180 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-20 14:32:37,255 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:32:37,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 19 [2024-11-20 14:32:37,348 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:37,348 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:32:37,511 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-20 14:32:37,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-20 14:32:37,523 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-20 14:32:37,530 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:37,531 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1371692083] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:32:37,531 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:32:37,531 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 17 [2024-11-20 14:32:37,532 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286626104] [2024-11-20 14:32:37,532 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:32:37,532 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-20 14:32:37,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:37,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-20 14:32:37,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=249, Unknown=0, NotChecked=0, Total=306 [2024-11-20 14:32:37,533 INFO L87 Difference]: Start difference. First operand 53 states and 60 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-20 14:32:37,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:37,706 INFO L93 Difference]: Finished difference Result 112 states and 126 transitions. [2024-11-20 14:32:37,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-20 14:32:37,706 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 20 [2024-11-20 14:32:37,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:37,707 INFO L225 Difference]: With dead ends: 112 [2024-11-20 14:32:37,707 INFO L226 Difference]: Without dead ends: 112 [2024-11-20 14:32:37,707 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=92, Invalid=370, Unknown=0, NotChecked=0, Total=462 [2024-11-20 14:32:37,708 INFO L432 NwaCegarLoop]: 23 mSDtfsCounter, 61 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:37,708 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 158 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:32:37,708 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2024-11-20 14:32:37,712 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 80. [2024-11-20 14:32:37,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 78 states have (on average 1.1666666666666667) internal successors, (91), 79 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:32:37,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 91 transitions. [2024-11-20 14:32:37,713 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 91 transitions. Word has length 20 [2024-11-20 14:32:37,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:37,713 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 91 transitions. [2024-11-20 14:32:37,713 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-20 14:32:37,713 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 91 transitions. [2024-11-20 14:32:37,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-20 14:32:37,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:37,714 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:37,723 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-20 14:32:37,914 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,SelfDestructingSolverStorable15 [2024-11-20 14:32:37,915 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:37,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:37,915 INFO L85 PathProgramCache]: Analyzing trace with hash -1423532355, now seen corresponding path program 2 times [2024-11-20 14:32:37,915 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:37,915 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [194905469] [2024-11-20 14:32:37,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:37,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:37,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:38,326 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:38,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:38,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [194905469] [2024-11-20 14:32:38,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [194905469] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:32:38,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074862051] [2024-11-20 14:32:38,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 14:32:38,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:32:38,327 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:32:38,329 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-20 14:32:38,331 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-20 14:32:38,385 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 14:32:38,385 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:32:38,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 146 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-20 14:32:38,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:32:38,405 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-20 14:32:38,426 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-20 14:32:39,013 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-11-20 14:32:39,014 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 23 [2024-11-20 14:32:39,104 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:39,104 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:32:39,511 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 29 treesize of output 25 [2024-11-20 14:32:39,515 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-11-20 14:32:39,585 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:39,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074862051] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:32:39,585 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:32:39,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 14, 14] total 34 [2024-11-20 14:32:39,586 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307483089] [2024-11-20 14:32:39,586 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:32:39,586 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-11-20 14:32:39,586 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:39,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-11-20 14:32:39,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1065, Unknown=1, NotChecked=0, Total=1190 [2024-11-20 14:32:39,587 INFO L87 Difference]: Start difference. First operand 80 states and 91 transitions. Second operand has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 35 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-20 14:32:45,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:45,752 INFO L93 Difference]: Finished difference Result 154 states and 181 transitions. [2024-11-20 14:32:45,752 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2024-11-20 14:32:45,752 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 35 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) Word has length 25 [2024-11-20 14:32:45,752 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:45,752 INFO L225 Difference]: With dead ends: 154 [2024-11-20 14:32:45,753 INFO L226 Difference]: Without dead ends: 154 [2024-11-20 14:32:45,753 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 593 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=503, Invalid=3031, Unknown=6, NotChecked=0, Total=3540 [2024-11-20 14:32:45,754 INFO L432 NwaCegarLoop]: 14 mSDtfsCounter, 316 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 10 mSolverCounterUnsat, 11 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 316 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 714 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 11 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 3.6s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:45,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [316 Valid, 225 Invalid, 714 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 693 Invalid, 11 Unknown, 0 Unchecked, 3.6s Time] [2024-11-20 14:32:45,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-20 14:32:45,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 116. [2024-11-20 14:32:45,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 114 states have (on average 1.219298245614035) internal successors, (139), 115 states have internal predecessors, (139), 0 states have call successors, (0), 0 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-20 14:32:45,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 139 transitions. [2024-11-20 14:32:45,760 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 139 transitions. Word has length 25 [2024-11-20 14:32:45,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:45,760 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 139 transitions. [2024-11-20 14:32:45,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.8823529411764706) internal successors, (64), 35 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-20 14:32:45,761 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 139 transitions. [2024-11-20 14:32:45,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-20 14:32:45,761 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:45,761 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:45,771 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-20 14:32:45,962 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:32:45,962 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:45,962 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:45,962 INFO L85 PathProgramCache]: Analyzing trace with hash 351969265, now seen corresponding path program 2 times [2024-11-20 14:32:45,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:45,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [774869288] [2024-11-20 14:32:45,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:45,963 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:45,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:46,298 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:46,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:46,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [774869288] [2024-11-20 14:32:46,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [774869288] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:32:46,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2118573438] [2024-11-20 14:32:46,299 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 14:32:46,299 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:32:46,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:32:46,301 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-20 14:32:46,302 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-20 14:32:46,355 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 14:32:46,355 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:32:46,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-11-20 14:32:46,359 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:32:46,391 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-20 14:32:46,928 INFO L349 Elim1Store]: treesize reduction 4, result has 76.5 percent of original size [2024-11-20 14:32:46,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 23 [2024-11-20 14:32:47,164 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 12 refuted. 1 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:47,165 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:32:47,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2024-11-20 14:32:47,628 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 29 treesize of output 25 [2024-11-20 14:32:47,631 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 23 [2024-11-20 14:32:47,671 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:47,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2118573438] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:32:47,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:32:47,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 16, 16] total 36 [2024-11-20 14:32:47,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [766177779] [2024-11-20 14:32:47,671 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:32:47,672 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2024-11-20 14:32:47,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:32:47,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2024-11-20 14:32:47,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1182, Unknown=1, NotChecked=0, Total=1332 [2024-11-20 14:32:47,673 INFO L87 Difference]: Start difference. First operand 116 states and 139 transitions. Second operand has 37 states, 36 states have (on average 2.361111111111111) internal successors, (85), 37 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-20 14:32:48,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:32:48,657 INFO L93 Difference]: Finished difference Result 169 states and 200 transitions. [2024-11-20 14:32:48,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-20 14:32:48,657 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.361111111111111) internal successors, (85), 37 states have internal predecessors, (85), 0 states have call successors, (0), 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-20 14:32:48,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:32:48,658 INFO L225 Difference]: With dead ends: 169 [2024-11-20 14:32:48,658 INFO L226 Difference]: Without dead ends: 132 [2024-11-20 14:32:48,659 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 90 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 56 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=562, Invalid=2743, Unknown=1, NotChecked=0, Total=3306 [2024-11-20 14:32:48,659 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 157 mSDsluCounter, 260 mSDsCounter, 0 mSdLazyCounter, 634 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 641 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 634 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:32:48,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [157 Valid, 279 Invalid, 641 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 634 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:32:48,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2024-11-20 14:32:48,661 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 48. [2024-11-20 14:32:48,661 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2340425531914894) internal successors, (58), 47 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-20 14:32:48,661 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 58 transitions. [2024-11-20 14:32:48,663 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 58 transitions. Word has length 31 [2024-11-20 14:32:48,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:32:48,663 INFO L471 AbstractCegarLoop]: Abstraction has 48 states and 58 transitions. [2024-11-20 14:32:48,663 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.361111111111111) internal successors, (85), 37 states have internal predecessors, (85), 0 states have call successors, (0), 0 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-20 14:32:48,663 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 58 transitions. [2024-11-20 14:32:48,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-20 14:32:48,665 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:32:48,665 INFO L215 NwaCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:32:48,674 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-20 14:32:48,869 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-20 14:32:48,870 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 12 more)] === [2024-11-20 14:32:48,870 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:32:48,870 INFO L85 PathProgramCache]: Analyzing trace with hash 2030622681, now seen corresponding path program 3 times [2024-11-20 14:32:48,870 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:32:48,870 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943891960] [2024-11-20 14:32:48,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:32:48,870 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:32:48,895 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:32:49,503 INFO L134 CoverageAnalysis]: Checked inductivity of 65 backedges. 0 proven. 65 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:32:49,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:32:49,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943891960] [2024-11-20 14:32:49,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943891960] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:32:49,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [654648769] [2024-11-20 14:32:49,504 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 14:32:49,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:32:49,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:32:49,505 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-20 14:32:49,506 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-20 14:32:49,578 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2024-11-20 14:32:49,579 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:32:49,580 INFO L255 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-20 14:32:49,583 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:32:49,615 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