./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety-realloc/array-realloc-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- 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/array-memsafety-realloc/array-realloc-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash a27e6fc2049c9dc12360bd8cd7682ef33f4a19a5a5a6c0e7a780c3703a0494b5 --- Real Ultimate output --- This is Ultimate 0.2.5-wip.dd.update-z3-fca748b-m [2024-11-20 14:29:07,956 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-20 14:29:08,016 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-20 14:29:08,019 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-20 14:29:08,020 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-20 14:29:08,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-20 14:29:08,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-20 14:29:08,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-20 14:29:08,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-20 14:29:08,065 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-20 14:29:08,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-20 14:29:08,065 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-20 14:29:08,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-20 14:29:08,083 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-20 14:29:08,083 INFO L153 SettingsManager]: * Use SBE=true [2024-11-20 14:29:08,083 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-20 14:29:08,084 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-20 14:29:08,086 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-20 14:29:08,086 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-20 14:29:08,087 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-20 14:29:08,087 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-20 14:29:08,088 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-20 14:29:08,088 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-20 14:29:08,088 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-20 14:29:08,089 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-20 14:29:08,089 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-20 14:29:08,089 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-20 14:29:08,089 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-20 14:29:08,089 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-20 14:29:08,089 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-20 14:29:08,089 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-20 14:29:08,089 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-20 14:29:08,090 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-20 14:29:08,090 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:29:08,090 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-20 14:29:08,090 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-20 14:29:08,092 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-20 14:29:08,092 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-20 14:29:08,092 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-20 14:29:08,093 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-20 14:29:08,093 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-20 14:29:08,095 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-20 14:29:08,095 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> a27e6fc2049c9dc12360bd8cd7682ef33f4a19a5a5a6c0e7a780c3703a0494b5 [2024-11-20 14:29:08,306 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-20 14:29:08,324 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-20 14:29:08,327 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-20 14:29:08,327 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-20 14:29:08,328 INFO L274 PluginConnector]: CDTParser initialized [2024-11-20 14:29:08,329 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety-realloc/array-realloc-2.i [2024-11-20 14:29:09,684 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-20 14:29:09,870 INFO L384 CDTParser]: Found 1 translation units. [2024-11-20 14:29:09,871 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-memsafety-realloc/array-realloc-2.i [2024-11-20 14:29:09,883 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd590ff4/e5d7fc8d96cd48bf8e0699fc26be5d94/FLAGb741e2300 [2024-11-20 14:29:09,893 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5bd590ff4/e5d7fc8d96cd48bf8e0699fc26be5d94 [2024-11-20 14:29:09,896 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-20 14:29:09,897 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-20 14:29:09,899 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-20 14:29:09,899 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-20 14:29:09,903 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-20 14:29:09,904 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:29:09" (1/1) ... [2024-11-20 14:29:09,904 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e903b2c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:09, skipping insertion in model container [2024-11-20 14:29:09,904 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 02:29:09" (1/1) ... [2024-11-20 14:29:09,939 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-20 14:29:10,168 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:29:10,171 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:29:10,185 INFO L200 MainTranslator]: Completed pre-run [2024-11-20 14:29:10,223 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-20 14:29:10,251 INFO L204 MainTranslator]: Completed translation [2024-11-20 14:29:10,251 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:10 WrapperNode [2024-11-20 14:29:10,251 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-20 14:29:10,252 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-20 14:29:10,252 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-20 14:29:10,253 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-20 14:29:10,260 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:29:10" (1/1) ... [2024-11-20 14:29:10,272 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:29:10" (1/1) ... [2024-11-20 14:29:10,286 INFO L138 Inliner]: procedures = 119, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 69 [2024-11-20 14:29:10,286 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-20 14:29:10,287 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-20 14:29:10,287 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-20 14:29:10,287 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-20 14:29:10,294 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:10" (1/1) ... [2024-11-20 14:29:10,295 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:10" (1/1) ... [2024-11-20 14:29:10,297 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:10" (1/1) ... [2024-11-20 14:29:10,301 WARN L109 MemorySlicer]: Omit memory slicing because it failed with the following exception: Unsupported: Memory array in LHS [2024-11-20 14:29:10,301 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:10" (1/1) ... [2024-11-20 14:29:10,302 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:10" (1/1) ... [2024-11-20 14:29:10,307 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:10" (1/1) ... [2024-11-20 14:29:10,309 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:10" (1/1) ... [2024-11-20 14:29:10,310 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:10" (1/1) ... [2024-11-20 14:29:10,311 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:10" (1/1) ... [2024-11-20 14:29:10,313 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-20 14:29:10,313 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-20 14:29:10,313 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-20 14:29:10,313 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-20 14:29:10,314 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:10" (1/1) ... [2024-11-20 14:29:10,318 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-20 14:29:10,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:29:10,337 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:29:10,342 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:29:10,401 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2024-11-20 14:29:10,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-20 14:29:10,401 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2024-11-20 14:29:10,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2024-11-20 14:29:10,402 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2024-11-20 14:29:10,402 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-20 14:29:10,402 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2024-11-20 14:29:10,403 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-20 14:29:10,403 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-20 14:29:10,556 INFO L238 CfgBuilder]: Building ICFG [2024-11-20 14:29:10,558 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-20 14:29:10,745 INFO L? ?]: Removed 51 outVars from TransFormulas that were not future-live. [2024-11-20 14:29:10,745 INFO L287 CfgBuilder]: Performing block encoding [2024-11-20 14:29:10,761 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-20 14:29:10,761 INFO L316 CfgBuilder]: Removed 1 assume(true) statements. [2024-11-20 14:29:10,761 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:29:10 BoogieIcfgContainer [2024-11-20 14:29:10,762 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-20 14:29:10,763 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-20 14:29:10,763 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-20 14:29:10,766 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-20 14:29:10,766 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 02:29:09" (1/3) ... [2024-11-20 14:29:10,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4d649b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:29:10, skipping insertion in model container [2024-11-20 14:29:10,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 02:29:10" (2/3) ... [2024-11-20 14:29:10,767 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5a4d649b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 02:29:10, skipping insertion in model container [2024-11-20 14:29:10,767 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:29:10" (3/3) ... [2024-11-20 14:29:10,768 INFO L112 eAbstractionObserver]: Analyzing ICFG array-realloc-2.i [2024-11-20 14:29:10,781 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-20 14:29:10,782 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2024-11-20 14:29:10,813 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-20 14:29:10,818 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;@1b060f54, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-20 14:29:10,819 INFO L334 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2024-11-20 14:29:10,822 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 22 states have (on average 1.9090909090909092) 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:29:10,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-20 14:29:10,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:29:10,833 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-20 14:29:10,834 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-20 14:29:10,837 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:29:10,837 INFO L85 PathProgramCache]: Analyzing trace with hash 925663, now seen corresponding path program 1 times [2024-11-20 14:29:10,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:29:10,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [764978557] [2024-11-20 14:29:10,845 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:10,845 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:29:10,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:10,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:29:10,975 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:29:10,975 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [764978557] [2024-11-20 14:29:10,975 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [764978557] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:29:10,975 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:29:10,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:29:10,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848943633] [2024-11-20 14:29:10,978 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:29:10,981 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:29:10,981 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:29:11,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:29:11,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:29:11,010 INFO L87 Difference]: Start difference. First operand has 37 states, 22 states have (on average 1.9090909090909092) 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) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 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:29:11,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:29:11,055 INFO L93 Difference]: Finished difference Result 38 states and 42 transitions. [2024-11-20 14:29:11,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:29:11,057 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-11-20 14:29:11,058 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:29:11,062 INFO L225 Difference]: With dead ends: 38 [2024-11-20 14:29:11,063 INFO L226 Difference]: Without dead ends: 35 [2024-11-20 14:29:11,064 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:29:11,068 INFO L432 NwaCegarLoop]: 39 mSDtfsCounter, 0 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 59 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:29:11,069 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 59 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:29:11,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2024-11-20 14:29:11,090 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2024-11-20 14:29:11,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 21 states have (on average 1.8095238095238095) internal successors, (38), 34 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:29:11,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-20 14:29:11,093 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 4 [2024-11-20 14:29:11,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:29:11,094 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-20 14:29:11,094 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 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:29:11,094 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-20 14:29:11,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-20 14:29:11,095 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:29:11,095 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-20 14:29:11,095 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-20 14:29:11,095 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-20 14:29:11,096 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:29:11,096 INFO L85 PathProgramCache]: Analyzing trace with hash 925669, now seen corresponding path program 1 times [2024-11-20 14:29:11,096 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:29:11,097 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1220821624] [2024-11-20 14:29:11,097 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:11,097 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:29:11,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:11,278 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:29:11,278 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:29:11,278 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1220821624] [2024-11-20 14:29:11,278 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1220821624] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:29:11,278 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:29:11,279 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:29:11,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [333518452] [2024-11-20 14:29:11,279 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:29:11,280 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:29:11,280 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:29:11,280 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:29:11,280 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:29:11,281 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 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:29:11,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:29:11,329 INFO L93 Difference]: Finished difference Result 52 states and 59 transitions. [2024-11-20 14:29:11,329 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:29:11,329 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-11-20 14:29:11,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:29:11,330 INFO L225 Difference]: With dead ends: 52 [2024-11-20 14:29:11,330 INFO L226 Difference]: Without dead ends: 52 [2024-11-20 14:29:11,330 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:29:11,331 INFO L432 NwaCegarLoop]: 31 mSDtfsCounter, 26 mSDsluCounter, 12 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 43 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:29:11,332 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 43 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:29:11,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2024-11-20 14:29:11,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 46. [2024-11-20 14:29:11,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 45 states have internal predecessors, (59), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:11,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 59 transitions. [2024-11-20 14:29:11,336 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 59 transitions. Word has length 4 [2024-11-20 14:29:11,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:29:11,336 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 59 transitions. [2024-11-20 14:29:11,336 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 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:29:11,336 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 59 transitions. [2024-11-20 14:29:11,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-20 14:29:11,337 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:29:11,337 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-20 14:29:11,337 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-20 14:29:11,337 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-20 14:29:11,338 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:29:11,339 INFO L85 PathProgramCache]: Analyzing trace with hash 925670, now seen corresponding path program 1 times [2024-11-20 14:29:11,339 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:29:11,339 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1304363767] [2024-11-20 14:29:11,339 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:11,339 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:29:11,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:11,443 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:29:11,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:29:11,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1304363767] [2024-11-20 14:29:11,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1304363767] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:29:11,443 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:29:11,444 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-20 14:29:11,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [695559859] [2024-11-20 14:29:11,444 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:29:11,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-20 14:29:11,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:29:11,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-20 14:29:11,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-20 14:29:11,445 INFO L87 Difference]: Start difference. First operand 46 states and 59 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 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:29:11,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:29:11,472 INFO L93 Difference]: Finished difference Result 54 states and 69 transitions. [2024-11-20 14:29:11,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-20 14:29:11,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-11-20 14:29:11,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:29:11,474 INFO L225 Difference]: With dead ends: 54 [2024-11-20 14:29:11,475 INFO L226 Difference]: Without dead ends: 54 [2024-11-20 14:29:11,475 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:29:11,476 INFO L432 NwaCegarLoop]: 28 mSDtfsCounter, 10 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:29:11,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 47 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:29:11,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-20 14:29:11,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 49. [2024-11-20 14:29:11,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.7027027027027026) internal successors, (63), 48 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:29:11,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 63 transitions. [2024-11-20 14:29:11,480 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 63 transitions. Word has length 4 [2024-11-20 14:29:11,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:29:11,480 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 63 transitions. [2024-11-20 14:29:11,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 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:29:11,480 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 63 transitions. [2024-11-20 14:29:11,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-20 14:29:11,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:29:11,481 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-20 14:29:11,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-20 14:29:11,481 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-20 14:29:11,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:29:11,482 INFO L85 PathProgramCache]: Analyzing trace with hash 889567416, now seen corresponding path program 1 times [2024-11-20 14:29:11,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:29:11,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151925952] [2024-11-20 14:29:11,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:11,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:29:11,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:11,513 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:29:11,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:29:11,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151925952] [2024-11-20 14:29:11,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151925952] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:29:11,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:29:11,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:29:11,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939576304] [2024-11-20 14:29:11,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:29:11,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:29:11,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:29:11,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:29:11,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:29:11,517 INFO L87 Difference]: Start difference. First operand 49 states and 63 transitions. Second operand has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:11,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:29:11,557 INFO L93 Difference]: Finished difference Result 61 states and 77 transitions. [2024-11-20 14:29:11,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:29:11,557 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2024-11-20 14:29:11,557 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:29:11,558 INFO L225 Difference]: With dead ends: 61 [2024-11-20 14:29:11,558 INFO L226 Difference]: Without dead ends: 61 [2024-11-20 14:29:11,558 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:29:11,559 INFO L432 NwaCegarLoop]: 35 mSDtfsCounter, 16 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:29:11,559 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 92 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:29:11,560 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2024-11-20 14:29:11,562 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 49. [2024-11-20 14:29:11,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 37 states have (on average 1.6756756756756757) internal successors, (62), 48 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:11,562 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 62 transitions. [2024-11-20 14:29:11,563 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 62 transitions. Word has length 6 [2024-11-20 14:29:11,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:29:11,563 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 62 transitions. [2024-11-20 14:29:11,563 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 1.5) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:11,563 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 62 transitions. [2024-11-20 14:29:11,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-20 14:29:11,563 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:29:11,563 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:29:11,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-20 14:29:11,564 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-20 14:29:11,564 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:29:11,564 INFO L85 PathProgramCache]: Analyzing trace with hash 1806786797, now seen corresponding path program 1 times [2024-11-20 14:29:11,564 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:29:11,564 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200956917] [2024-11-20 14:29:11,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:11,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:29:11,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:11,599 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:29:11,599 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:29:11,599 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200956917] [2024-11-20 14:29:11,599 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200956917] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:29:11,600 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:29:11,600 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:29:11,600 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [642882439] [2024-11-20 14:29:11,600 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:29:11,600 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:29:11,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:29:11,601 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:29:11,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:29:11,601 INFO L87 Difference]: Start difference. First operand 49 states and 62 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:29:11,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:29:11,657 INFO L93 Difference]: Finished difference Result 59 states and 68 transitions. [2024-11-20 14:29:11,657 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:29:11,658 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:29:11,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:29:11,658 INFO L225 Difference]: With dead ends: 59 [2024-11-20 14:29:11,658 INFO L226 Difference]: Without dead ends: 59 [2024-11-20 14:29:11,658 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:29:11,659 INFO L432 NwaCegarLoop]: 30 mSDtfsCounter, 44 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:29:11,659 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [44 Valid, 55 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:29:11,660 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2024-11-20 14:29:11,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 52. [2024-11-20 14:29:11,664 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 41 states have (on average 1.6341463414634145) internal successors, (67), 51 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:11,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 67 transitions. [2024-11-20 14:29:11,665 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 67 transitions. Word has length 7 [2024-11-20 14:29:11,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:29:11,667 INFO L471 AbstractCegarLoop]: Abstraction has 52 states and 67 transitions. [2024-11-20 14:29:11,668 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:29:11,668 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 67 transitions. [2024-11-20 14:29:11,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-20 14:29:11,668 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:29:11,668 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:29:11,668 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-20 14:29:11,669 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-20 14:29:11,669 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:29:11,670 INFO L85 PathProgramCache]: Analyzing trace with hash 1806786798, now seen corresponding path program 1 times [2024-11-20 14:29:11,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:29:11,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [20458347] [2024-11-20 14:29:11,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:11,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:29:11,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:11,801 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:29:11,802 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:29:11,802 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [20458347] [2024-11-20 14:29:11,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [20458347] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:29:11,802 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:29:11,803 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:29:11,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847959512] [2024-11-20 14:29:11,803 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:29:11,803 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-20 14:29:11,804 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:29:11,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-20 14:29:11,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-20 14:29:11,806 INFO L87 Difference]: Start difference. First operand 52 states and 67 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:29:11,850 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:29:11,851 INFO L93 Difference]: Finished difference Result 55 states and 71 transitions. [2024-11-20 14:29:11,852 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:29:11,852 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:29:11,852 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:29:11,853 INFO L225 Difference]: With dead ends: 55 [2024-11-20 14:29:11,853 INFO L226 Difference]: Without dead ends: 55 [2024-11-20 14:29:11,853 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:29:11,854 INFO L432 NwaCegarLoop]: 27 mSDtfsCounter, 40 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:29:11,854 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 64 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:29:11,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-20 14:29:11,859 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2024-11-20 14:29:11,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 42 states have (on average 1.619047619047619) internal successors, (68), 52 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:11,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 68 transitions. [2024-11-20 14:29:11,862 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 68 transitions. Word has length 7 [2024-11-20 14:29:11,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:29:11,862 INFO L471 AbstractCegarLoop]: Abstraction has 53 states and 68 transitions. [2024-11-20 14:29:11,862 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:29:11,862 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 68 transitions. [2024-11-20 14:29:11,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-20 14:29:11,863 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:29:11,863 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:29:11,863 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-20 14:29:11,863 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-20 14:29:11,864 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:29:11,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1454297136, now seen corresponding path program 1 times [2024-11-20 14:29:11,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:29:11,864 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1969231849] [2024-11-20 14:29:11,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:11,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:29:11,877 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:11,918 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:29:11,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:29:11,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1969231849] [2024-11-20 14:29:11,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1969231849] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:29:11,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:29:11,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:29:11,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988858708] [2024-11-20 14:29:11,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:29:11,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:29:11,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:29:11,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:29:11,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:29:11,922 INFO L87 Difference]: Start difference. First operand 53 states and 68 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:11,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:29:11,938 INFO L93 Difference]: Finished difference Result 50 states and 64 transitions. [2024-11-20 14:29:11,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:29:11,938 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-20 14:29:11,938 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:29:11,938 INFO L225 Difference]: With dead ends: 50 [2024-11-20 14:29:11,939 INFO L226 Difference]: Without dead ends: 50 [2024-11-20 14:29:11,939 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:29:11,939 INFO L432 NwaCegarLoop]: 32 mSDtfsCounter, 30 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 57 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:29:11,939 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 57 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:29:11,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2024-11-20 14:29:11,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 50. [2024-11-20 14:29:11,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 50 states, 39 states have (on average 1.641025641025641) internal successors, (64), 49 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:29:11,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 50 states to 50 states and 64 transitions. [2024-11-20 14:29:11,946 INFO L78 Accepts]: Start accepts. Automaton has 50 states and 64 transitions. Word has length 10 [2024-11-20 14:29:11,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:29:11,948 INFO L471 AbstractCegarLoop]: Abstraction has 50 states and 64 transitions. [2024-11-20 14:29:11,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:11,948 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 64 transitions. [2024-11-20 14:29:11,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-20 14:29:11,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:29:11,948 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:29:11,949 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-20 14:29:11,949 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-20 14:29:11,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:29:11,949 INFO L85 PathProgramCache]: Analyzing trace with hash -1602458348, now seen corresponding path program 1 times [2024-11-20 14:29:11,949 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:29:11,949 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859136933] [2024-11-20 14:29:11,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:11,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:29:11,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:12,009 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:29:12,010 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:29:12,010 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859136933] [2024-11-20 14:29:12,010 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859136933] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:29:12,011 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:29:12,011 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-20 14:29:12,011 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864801556] [2024-11-20 14:29:12,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:29:12,011 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:29:12,011 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:29:12,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:29:12,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:29:12,013 INFO L87 Difference]: Start difference. First operand 50 states and 64 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:12,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:29:12,054 INFO L93 Difference]: Finished difference Result 49 states and 61 transitions. [2024-11-20 14:29:12,054 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:29:12,054 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-20 14:29:12,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:29:12,055 INFO L225 Difference]: With dead ends: 49 [2024-11-20 14:29:12,055 INFO L226 Difference]: Without dead ends: 49 [2024-11-20 14:29:12,055 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:29:12,058 INFO L432 NwaCegarLoop]: 26 mSDtfsCounter, 3 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:29:12,059 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 49 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:29:12,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2024-11-20 14:29:12,061 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2024-11-20 14:29:12,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 39 states have (on average 1.564102564102564) internal successors, (61), 48 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:12,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2024-11-20 14:29:12,063 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 12 [2024-11-20 14:29:12,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:29:12,064 INFO L471 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2024-11-20 14:29:12,064 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:12,064 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2024-11-20 14:29:12,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-20 14:29:12,064 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:29:12,064 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:29:12,064 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-20 14:29:12,065 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-20 14:29:12,066 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:29:12,066 INFO L85 PathProgramCache]: Analyzing trace with hash -1602458347, now seen corresponding path program 1 times [2024-11-20 14:29:12,066 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:29:12,067 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [913024337] [2024-11-20 14:29:12,067 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:12,067 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:29:12,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:12,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:29:12,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:29:12,261 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [913024337] [2024-11-20 14:29:12,261 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [913024337] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:29:12,261 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:29:12,261 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 14:29:12,261 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547670338] [2024-11-20 14:29:12,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:29:12,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-20 14:29:12,262 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:29:12,262 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-20 14:29:12,263 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:29:12,263 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:12,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:29:12,370 INFO L93 Difference]: Finished difference Result 81 states and 99 transitions. [2024-11-20 14:29:12,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-20 14:29:12,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-11-20 14:29:12,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:29:12,370 INFO L225 Difference]: With dead ends: 81 [2024-11-20 14:29:12,370 INFO L226 Difference]: Without dead ends: 81 [2024-11-20 14:29:12,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-20 14:29:12,371 INFO L432 NwaCegarLoop]: 22 mSDtfsCounter, 30 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 107 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:29:12,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 107 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:29:12,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-20 14:29:12,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 57. [2024-11-20 14:29:12,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 47 states have (on average 1.5319148936170213) internal successors, (72), 56 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:12,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2024-11-20 14:29:12,378 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 12 [2024-11-20 14:29:12,378 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:29:12,378 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2024-11-20 14:29:12,378 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.0) internal successors, (12), 7 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:12,378 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2024-11-20 14:29:12,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 14:29:12,378 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:29:12,378 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:29:12,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-20 14:29:12,379 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-20 14:29:12,379 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:29:12,379 INFO L85 PathProgramCache]: Analyzing trace with hash 1863398776, now seen corresponding path program 1 times [2024-11-20 14:29:12,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:29:12,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341114251] [2024-11-20 14:29:12,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:12,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:29:12,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:12,610 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:29:12,610 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:29:12,610 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341114251] [2024-11-20 14:29:12,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341114251] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:29:12,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:29:12,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-20 14:29:12,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201270003] [2024-11-20 14:29:12,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:29:12,611 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-20 14:29:12,611 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:29:12,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-20 14:29:12,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-20 14:29:12,611 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. Second operand has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 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:29:12,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:29:12,733 INFO L93 Difference]: Finished difference Result 64 states and 82 transitions. [2024-11-20 14:29:12,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-20 14:29:12,733 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 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:29:12,734 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:29:12,734 INFO L225 Difference]: With dead ends: 64 [2024-11-20 14:29:12,734 INFO L226 Difference]: Without dead ends: 64 [2024-11-20 14:29:12,734 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=115, Unknown=0, NotChecked=0, Total=182 [2024-11-20 14:29:12,735 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 36 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 136 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 145 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 136 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:29:12,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 102 Invalid, 145 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 136 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:29:12,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2024-11-20 14:29:12,739 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 57. [2024-11-20 14:29:12,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 47 states have (on average 1.5319148936170213) internal successors, (72), 56 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:12,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 72 transitions. [2024-11-20 14:29:12,742 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 72 transitions. Word has length 13 [2024-11-20 14:29:12,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:29:12,743 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 72 transitions. [2024-11-20 14:29:12,743 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 1.4444444444444444) internal successors, (13), 10 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:29:12,743 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 72 transitions. [2024-11-20 14:29:12,743 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 14:29:12,743 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:29:12,743 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:29:12,743 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-20 14:29:12,743 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-20 14:29:12,744 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:29:12,744 INFO L85 PathProgramCache]: Analyzing trace with hash 1863398777, now seen corresponding path program 1 times [2024-11-20 14:29:12,744 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:29:12,744 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039846724] [2024-11-20 14:29:12,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:12,744 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:29:12,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:12,849 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:29:12,849 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:29:12,849 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039846724] [2024-11-20 14:29:12,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2039846724] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:29:12,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:29:12,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-20 14:29:12,850 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [172284038] [2024-11-20 14:29:12,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:29:12,850 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:29:12,850 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:29:12,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:29:12,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:29:12,851 INFO L87 Difference]: Start difference. First operand 57 states and 72 transitions. Second operand has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:12,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:29:12,892 INFO L93 Difference]: Finished difference Result 54 states and 65 transitions. [2024-11-20 14:29:12,893 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:29:12,893 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 13 [2024-11-20 14:29:12,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:29:12,893 INFO L225 Difference]: With dead ends: 54 [2024-11-20 14:29:12,893 INFO L226 Difference]: Without dead ends: 54 [2024-11-20 14:29:12,893 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-11-20 14:29:12,894 INFO L432 NwaCegarLoop]: 19 mSDtfsCounter, 24 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 47 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:29:12,894 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 42 Invalid, 47 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:29:12,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-20 14:29:12,896 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-20 14:29:12,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.3829787234042554) internal successors, (65), 53 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:12,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 65 transitions. [2024-11-20 14:29:12,896 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 65 transitions. Word has length 13 [2024-11-20 14:29:12,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:29:12,896 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 65 transitions. [2024-11-20 14:29:12,896 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.6) internal successors, (13), 6 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:12,896 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 65 transitions. [2024-11-20 14:29:12,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-20 14:29:12,897 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:29:12,897 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:29:12,897 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-20 14:29:12,897 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-20 14:29:12,897 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:29:12,897 INFO L85 PathProgramCache]: Analyzing trace with hash 1863406942, now seen corresponding path program 1 times [2024-11-20 14:29:12,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:29:12,898 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435046403] [2024-11-20 14:29:12,898 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:12,898 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:29:12,905 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:12,921 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:29:12,921 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:29:12,921 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435046403] [2024-11-20 14:29:12,922 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435046403] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:29:12,922 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:29:12,922 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-20 14:29:12,922 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [849612788] [2024-11-20 14:29:12,922 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:29:12,922 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-20 14:29:12,922 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:29:12,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-20 14:29:12,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-20 14:29:12,923 INFO L87 Difference]: Start difference. First operand 54 states and 65 transitions. Second operand has 4 states, 4 states have (on average 3.25) 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:29:12,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:29:12,934 INFO L93 Difference]: Finished difference Result 54 states and 60 transitions. [2024-11-20 14:29:12,935 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-20 14:29:12,935 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) 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:29:12,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:29:12,935 INFO L225 Difference]: With dead ends: 54 [2024-11-20 14:29:12,935 INFO L226 Difference]: Without dead ends: 54 [2024-11-20 14:29:12,935 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:29:12,936 INFO L432 NwaCegarLoop]: 24 mSDtfsCounter, 3 mSDsluCounter, 41 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:29:12,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 65 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:29:12,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2024-11-20 14:29:12,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 54. [2024-11-20 14:29:12,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 53 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:29:12,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 60 transitions. [2024-11-20 14:29:12,938 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 60 transitions. Word has length 13 [2024-11-20 14:29:12,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:29:12,938 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 60 transitions. [2024-11-20 14:29:12,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) 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:29:12,938 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 60 transitions. [2024-11-20 14:29:12,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-20 14:29:12,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:29:12,938 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:29:12,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-20 14:29:12,939 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-20 14:29:12,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:29:12,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1842884807, now seen corresponding path program 1 times [2024-11-20 14:29:12,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:29:12,939 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626506166] [2024-11-20 14:29:12,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:12,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:29:12,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:12,975 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:29:12,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:29:12,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626506166] [2024-11-20 14:29:12,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626506166] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:29:12,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1702717437] [2024-11-20 14:29:12,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:12,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:29:12,976 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:29:12,978 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:29:12,981 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:29:13,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:13,048 INFO L255 TraceCheckSpWp]: Trace formula consists of 150 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-20 14:29:13,052 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:29:13,143 INFO L349 Elim1Store]: treesize reduction 37, result has 37.3 percent of original size [2024-11-20 14:29:13,144 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 25 [2024-11-20 14:29:13,239 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:29:13,239 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:29:13,306 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:29:13,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1702717437] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:29:13,306 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:29:13,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 6, 6] total 10 [2024-11-20 14:29:13,307 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150872493] [2024-11-20 14:29:13,307 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:29:13,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-20 14:29:13,307 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:29:13,308 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-20 14:29:13,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2024-11-20 14:29:13,308 INFO L87 Difference]: Start difference. First operand 54 states and 60 transitions. Second operand has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:13,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:29:13,341 INFO L93 Difference]: Finished difference Result 55 states and 60 transitions. [2024-11-20 14:29:13,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-20 14:29:13,341 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2024-11-20 14:29:13,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:29:13,342 INFO L225 Difference]: With dead ends: 55 [2024-11-20 14:29:13,342 INFO L226 Difference]: Without dead ends: 55 [2024-11-20 14:29:13,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=61, Unknown=0, NotChecked=0, Total=110 [2024-11-20 14:29:13,343 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 33 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:29:13,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 38 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:29:13,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2024-11-20 14:29:13,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 38. [2024-11-20 14:29:13,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.28125) internal successors, (41), 37 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:29:13,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 41 transitions. [2024-11-20 14:29:13,345 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 41 transitions. Word has length 18 [2024-11-20 14:29:13,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:29:13,345 INFO L471 AbstractCegarLoop]: Abstraction has 38 states and 41 transitions. [2024-11-20 14:29:13,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.3) internal successors, (33), 11 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:13,345 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 41 transitions. [2024-11-20 14:29:13,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2024-11-20 14:29:13,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:29:13,346 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:29:13,353 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-20 14:29:13,550 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,SelfDestructingSolverStorable12 [2024-11-20 14:29:13,551 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-20 14:29:13,551 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:29:13,552 INFO L85 PathProgramCache]: Analyzing trace with hash -1294854142, now seen corresponding path program 1 times [2024-11-20 14:29:13,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:29:13,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859691011] [2024-11-20 14:29:13,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:13,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:29:13,565 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:13,671 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:29:13,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:29:13,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859691011] [2024-11-20 14:29:13,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1859691011] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:29:13,672 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1234274782] [2024-11-20 14:29:13,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:13,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:29:13,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:29:13,674 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:29:13,675 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:29:13,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:13,739 INFO L255 TraceCheckSpWp]: Trace formula consists of 158 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-20 14:29:13,741 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:29:13,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-20 14:29:13,961 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:29:13,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:29:13,963 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 15 treesize of output 10 [2024-11-20 14:29:13,965 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:29:13,965 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:29:13,975 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 28 treesize of output 24 [2024-11-20 14:29:14,167 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:29:14,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1234274782] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:29:14,167 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:29:14,167 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 10, 10] total 19 [2024-11-20 14:29:14,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670325569] [2024-11-20 14:29:14,167 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:29:14,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-11-20 14:29:14,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:29:14,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-11-20 14:29:14,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=306, Unknown=0, NotChecked=0, Total=380 [2024-11-20 14:29:14,169 INFO L87 Difference]: Start difference. First operand 38 states and 41 transitions. Second operand has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 20 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:29:14,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:29:14,508 INFO L93 Difference]: Finished difference Result 46 states and 49 transitions. [2024-11-20 14:29:14,508 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-20 14:29:14,508 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 20 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2024-11-20 14:29:14,508 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:29:14,508 INFO L225 Difference]: With dead ends: 46 [2024-11-20 14:29:14,508 INFO L226 Difference]: Without dead ends: 46 [2024-11-20 14:29:14,509 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 209 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=218, Invalid=774, Unknown=0, NotChecked=0, Total=992 [2024-11-20 14:29:14,509 INFO L432 NwaCegarLoop]: 12 mSDtfsCounter, 67 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:29:14,509 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 84 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:29:14,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2024-11-20 14:29:14,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 37. [2024-11-20 14:29:14,511 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 32 states have (on average 1.25) internal successors, (40), 36 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:29:14,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2024-11-20 14:29:14,511 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 19 [2024-11-20 14:29:14,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:29:14,511 INFO L471 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2024-11-20 14:29:14,511 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.263157894736842) internal successors, (43), 20 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:29:14,511 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2024-11-20 14:29:14,511 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-20 14:29:14,511 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:29:14,512 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:29:14,518 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:29:14,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-20 14:29:14,716 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-20 14:29:14,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:29:14,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1485772647, now seen corresponding path program 1 times [2024-11-20 14:29:14,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:29:14,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438880842] [2024-11-20 14:29:14,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:14,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:29:14,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:14,949 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:29:14,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:29:14,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438880842] [2024-11-20 14:29:14,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438880842] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:29:14,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2069049255] [2024-11-20 14:29:14,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:14,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:29:14,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:29:14,959 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:29:14,960 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:29:15,020 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:15,021 INFO L255 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-20 14:29:15,022 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:29:15,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 14:29:15,189 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:29:15,191 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:29:15,191 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 17 treesize of output 12 [2024-11-20 14:29:15,195 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:29:15,195 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:29:15,213 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 28 treesize of output 24 [2024-11-20 14:29:15,268 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:29:15,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2069049255] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:29:15,268 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:29:15,268 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 13 [2024-11-20 14:29:15,268 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [989162879] [2024-11-20 14:29:15,268 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:29:15,269 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-20 14:29:15,269 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:29:15,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-20 14:29:15,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=132, Unknown=0, NotChecked=0, Total=182 [2024-11-20 14:29:15,269 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand has 14 states, 13 states have (on average 3.0) internal successors, (39), 14 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:29:15,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:29:15,389 INFO L93 Difference]: Finished difference Result 40 states and 42 transitions. [2024-11-20 14:29:15,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 14:29:15,390 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 14 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) Word has length 20 [2024-11-20 14:29:15,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:29:15,390 INFO L225 Difference]: With dead ends: 40 [2024-11-20 14:29:15,390 INFO L226 Difference]: Without dead ends: 40 [2024-11-20 14:29:15,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2024-11-20 14:29:15,391 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 29 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 135 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 48 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 135 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:29:15,391 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 48 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 135 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:29:15,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2024-11-20 14:29:15,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2024-11-20 14:29:15,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 32 states have (on average 1.21875) internal successors, (39), 35 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:29:15,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-20 14:29:15,392 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 20 [2024-11-20 14:29:15,393 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:29:15,393 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-20 14:29:15,393 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.0) internal successors, (39), 14 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:29:15,393 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-20 14:29:15,393 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-20 14:29:15,393 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:29:15,393 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:29:15,400 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2024-11-20 14:29:15,594 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:29:15,595 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-20 14:29:15,595 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:29:15,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1185688292, now seen corresponding path program 1 times [2024-11-20 14:29:15,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:29:15,595 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [217053023] [2024-11-20 14:29:15,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:15,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:29:15,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:15,765 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:29:15,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:29:15,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [217053023] [2024-11-20 14:29:15,766 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [217053023] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:29:15,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1415556509] [2024-11-20 14:29:15,766 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:15,766 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:29:15,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:29:15,768 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:29:15,772 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:29:15,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:15,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 162 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-20 14:29:15,894 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:29:16,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-20 14:29:16,104 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:29:16,108 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-20 14:29:16,109 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 17 treesize of output 12 [2024-11-20 14:29:16,115 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:29:16,115 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:29:16,137 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 32 treesize of output 28 [2024-11-20 14:29:16,183 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-20 14:29:16,184 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2024-11-20 14:29:16,239 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:29:16,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1415556509] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:29:16,239 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:29:16,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 7, 7] total 12 [2024-11-20 14:29:16,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [564841558] [2024-11-20 14:29:16,239 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:29:16,239 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-20 14:29:16,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:29:16,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-20 14:29:16,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=114, Unknown=0, NotChecked=0, Total=156 [2024-11-20 14:29:16,243 INFO L87 Difference]: Start difference. First operand 36 states and 39 transitions. Second operand has 13 states, 12 states have (on average 3.5) internal successors, (42), 13 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:29:16,362 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:29:16,362 INFO L93 Difference]: Finished difference Result 39 states and 41 transitions. [2024-11-20 14:29:16,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 14:29:16,362 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 13 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) Word has length 21 [2024-11-20 14:29:16,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:29:16,363 INFO L225 Difference]: With dead ends: 39 [2024-11-20 14:29:16,363 INFO L226 Difference]: Without dead ends: 39 [2024-11-20 14:29:16,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-20 14:29:16,364 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 30 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:29:16,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 51 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:29:16,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2024-11-20 14:29:16,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 35. [2024-11-20 14:29:16,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 32 states have (on average 1.1875) internal successors, (38), 34 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:29:16,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 38 transitions. [2024-11-20 14:29:16,365 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 38 transitions. Word has length 21 [2024-11-20 14:29:16,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:29:16,366 INFO L471 AbstractCegarLoop]: Abstraction has 35 states and 38 transitions. [2024-11-20 14:29:16,366 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 3.5) internal successors, (42), 13 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:29:16,366 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 38 transitions. [2024-11-20 14:29:16,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-20 14:29:16,371 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:29:16,371 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:29:16,387 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-20 14:29:16,571 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,SelfDestructingSolverStorable15 [2024-11-20 14:29:16,572 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-20 14:29:16,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:29:16,572 INFO L85 PathProgramCache]: Analyzing trace with hash -2131949465, now seen corresponding path program 1 times [2024-11-20 14:29:16,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:29:16,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643314178] [2024-11-20 14:29:16,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:16,572 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:29:16,609 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:16,833 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:29:16,834 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:29:16,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1643314178] [2024-11-20 14:29:16,834 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1643314178] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:29:16,834 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1099169424] [2024-11-20 14:29:16,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:16,834 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:29:16,834 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:29:16,839 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:29:16,849 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:29:16,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:16,969 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-20 14:29:16,970 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:29:17,001 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 6 treesize of output 5 [2024-11-20 14:29:17,042 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:29:17,042 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:29:17,172 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:29:17,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1099169424] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:29:17,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:29:17,172 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 16 [2024-11-20 14:29:17,172 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1212896284] [2024-11-20 14:29:17,172 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:29:17,172 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-20 14:29:17,172 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:29:17,173 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-20 14:29:17,173 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2024-11-20 14:29:17,173 INFO L87 Difference]: Start difference. First operand 35 states and 38 transitions. Second operand has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:17,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:29:17,472 INFO L93 Difference]: Finished difference Result 134 states and 141 transitions. [2024-11-20 14:29:17,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-20 14:29:17,473 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2024-11-20 14:29:17,473 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:29:17,473 INFO L225 Difference]: With dead ends: 134 [2024-11-20 14:29:17,473 INFO L226 Difference]: Without dead ends: 134 [2024-11-20 14:29:17,474 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=182, Invalid=688, Unknown=0, NotChecked=0, Total=870 [2024-11-20 14:29:17,474 INFO L432 NwaCegarLoop]: 25 mSDtfsCounter, 145 mSDsluCounter, 162 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 223 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-20 14:29:17,475 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 187 Invalid, 223 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-20 14:29:17,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-20 14:29:17,476 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 86. [2024-11-20 14:29:17,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 83 states have (on average 1.2048192771084338) internal successors, (100), 85 states have internal predecessors, (100), 0 states have call successors, (0), 0 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:29:17,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 100 transitions. [2024-11-20 14:29:17,480 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 100 transitions. Word has length 21 [2024-11-20 14:29:17,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:29:17,480 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 100 transitions. [2024-11-20 14:29:17,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.6875) internal successors, (43), 17 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:17,480 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 100 transitions. [2024-11-20 14:29:17,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-20 14:29:17,481 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:29:17,481 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:29:17,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-20 14:29:17,681 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-11-20 14:29:17,681 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-20 14:29:17,682 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:29:17,682 INFO L85 PathProgramCache]: Analyzing trace with hash -1898368516, now seen corresponding path program 1 times [2024-11-20 14:29:17,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:29:17,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110473699] [2024-11-20 14:29:17,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:17,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:29:17,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:17,984 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:29:17,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:29:17,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110473699] [2024-11-20 14:29:17,986 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110473699] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:29:17,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1926838217] [2024-11-20 14:29:17,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:17,986 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:29:17,986 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:29:17,988 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:29:17,988 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-20 14:29:18,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:18,058 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-20 14:29:18,060 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:29:18,236 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-20 14:29:18,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 54 [2024-11-20 14:29:18,397 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-20 14:29:18,397 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 74 [2024-11-20 14:29:18,431 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-20 14:29:18,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 89 [2024-11-20 14:29:18,787 INFO L349 Elim1Store]: treesize reduction 8, result has 68.0 percent of original size [2024-11-20 14:29:18,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 99 treesize of output 87 [2024-11-20 14:29:18,976 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#a~0#1.base_18| Int) (|v_ULTIMATE.start_main_#t~mem8#1.base_12| Int)) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#a~0#1.base_18| 1) |v_ULTIMATE.start_main_#t~mem8#1.base_12|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#a~0#1.base_18|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_#t~mem8#1.base_12| 0) |v_ULTIMATE.start_main_~#a~0#1.base_18| 0)))) is different from true [2024-11-20 14:29:18,977 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:29:18,977 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:29:19,082 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array Int Int))) (= (store (store |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_expandArray_~temp~0#1.base| v_ArrVal_380))) (store .cse0 |c_ULTIMATE.start_expandArray_~pointer#1.base| (store (select .cse0 |c_ULTIMATE.start_expandArray_~pointer#1.base|) |c_ULTIMATE.start_expandArray_~pointer#1.offset| |c_ULTIMATE.start_expandArray_~temp~0#1.base|))) |c_ULTIMATE.start_main_~#a~0#1.base|) |c_ULTIMATE.start_main_~#a~0#1.offset|) 0) |c_ULTIMATE.start_main_~#a~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-11-20 14:29:19,105 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_380 (Array Int Int))) (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_#Ultimate.C_realloc_#res#1.base| v_ArrVal_380))) (store .cse0 |c_ULTIMATE.start_expandArray_~pointer#1.base| (store (select .cse0 |c_ULTIMATE.start_expandArray_~pointer#1.base|) |c_ULTIMATE.start_expandArray_~pointer#1.offset| |c_ULTIMATE.start_#Ultimate.C_realloc_#res#1.base|))) |c_ULTIMATE.start_main_~#a~0#1.base|) |c_ULTIMATE.start_main_~#a~0#1.offset|) 0) |c_ULTIMATE.start_main_~#a~0#1.base| 0))) is different from false [2024-11-20 14:29:19,130 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_378 Int) (v_ArrVal_380 (Array Int Int)) (|v_ULTIMATE.start_#Ultimate.C_realloc_#res#1.base_22| Int)) (let ((.cse0 (store |c_#valid| |c_ULTIMATE.start_#Ultimate.C_realloc_ptr#1.base| 0))) (or (not (= (select .cse0 |v_ULTIMATE.start_#Ultimate.C_realloc_#res#1.base_22|) 0)) (= (store (store (store .cse0 |v_ULTIMATE.start_#Ultimate.C_realloc_#res#1.base_22| v_ArrVal_378) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_#Ultimate.C_realloc_#res#1.base_22| v_ArrVal_380))) (store .cse1 |c_ULTIMATE.start_expandArray_~pointer#1.base| (store (select .cse1 |c_ULTIMATE.start_expandArray_~pointer#1.base|) |c_ULTIMATE.start_expandArray_~pointer#1.offset| |v_ULTIMATE.start_#Ultimate.C_realloc_#res#1.base_22|))) |c_ULTIMATE.start_main_~#a~0#1.base|) |c_ULTIMATE.start_main_~#a~0#1.offset|) 0) |c_ULTIMATE.start_main_~#a~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)))) is different from false [2024-11-20 14:29:19,152 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_378 Int) (v_ArrVal_380 (Array Int Int)) (|v_ULTIMATE.start_#Ultimate.C_realloc_#res#1.base_22| Int)) (let ((.cse0 (store |c_#valid| |c_ULTIMATE.start_expandArray_#t~mem2#1.base| 0))) (or (= |c_ULTIMATE.start_main_old_#valid#1| (store (store (store .cse0 |v_ULTIMATE.start_#Ultimate.C_realloc_#res#1.base_22| v_ArrVal_378) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_#Ultimate.C_realloc_#res#1.base_22| v_ArrVal_380))) (store .cse1 |c_ULTIMATE.start_expandArray_~pointer#1.base| (store (select .cse1 |c_ULTIMATE.start_expandArray_~pointer#1.base|) |c_ULTIMATE.start_expandArray_~pointer#1.offset| |v_ULTIMATE.start_#Ultimate.C_realloc_#res#1.base_22|))) |c_ULTIMATE.start_main_~#a~0#1.base|) |c_ULTIMATE.start_main_~#a~0#1.offset|) 0) |c_ULTIMATE.start_main_~#a~0#1.base| 0)) (not (= (select .cse0 |v_ULTIMATE.start_#Ultimate.C_realloc_#res#1.base_22|) 0))))) is different from false [2024-11-20 14:29:19,254 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_378 Int) (v_ArrVal_380 (Array Int Int)) (|v_ULTIMATE.start_expandArray_~pointer#1.offset_18| Int) (|v_ULTIMATE.start_#Ultimate.C_realloc_#res#1.base_22| Int)) (let ((.cse0 (store |c_#valid| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#a~0#1.base|) |v_ULTIMATE.start_expandArray_~pointer#1.offset_18|) 0))) (or (= (store (store (store .cse0 |v_ULTIMATE.start_#Ultimate.C_realloc_#res#1.base_22| v_ArrVal_378) (select (store (select (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_#Ultimate.C_realloc_#res#1.base_22| v_ArrVal_380) |c_ULTIMATE.start_main_~#a~0#1.base|) |v_ULTIMATE.start_expandArray_~pointer#1.offset_18| |v_ULTIMATE.start_#Ultimate.C_realloc_#res#1.base_22|) |c_ULTIMATE.start_main_~#a~0#1.offset|) 0) |c_ULTIMATE.start_main_~#a~0#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|) (< |c_ULTIMATE.start_main_~#a~0#1.offset| |v_ULTIMATE.start_expandArray_~pointer#1.offset_18|) (< |v_ULTIMATE.start_expandArray_~pointer#1.offset_18| 0) (not (= (select .cse0 |v_ULTIMATE.start_#Ultimate.C_realloc_#res#1.base_22|) 0))))) is different from false [2024-11-20 14:29:19,292 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 118 treesize of output 102 [2024-11-20 14:29:19,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:29:19,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:29:19,302 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 71 [2024-11-20 14:29:19,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-20 14:29:19,388 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:29:19,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1926838217] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:29:19,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:29:19,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 26 [2024-11-20 14:29:19,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [675462639] [2024-11-20 14:29:19,389 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:29:19,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-20 14:29:19,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:29:19,390 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-20 14:29:19,390 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=353, Unknown=6, NotChecked=258, Total=702 [2024-11-20 14:29:19,390 INFO L87 Difference]: Start difference. First operand 86 states and 100 transitions. Second operand has 27 states, 26 states have (on average 2.076923076923077) internal successors, (54), 27 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:19,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:29:19,759 INFO L93 Difference]: Finished difference Result 141 states and 165 transitions. [2024-11-20 14:29:19,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-20 14:29:19,760 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 26 states have (on average 2.076923076923077) internal successors, (54), 27 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-20 14:29:19,760 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:29:19,760 INFO L225 Difference]: With dead ends: 141 [2024-11-20 14:29:19,760 INFO L226 Difference]: Without dead ends: 134 [2024-11-20 14:29:19,761 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 28 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=104, Invalid=466, Unknown=6, NotChecked=294, Total=870 [2024-11-20 14:29:19,761 INFO L432 NwaCegarLoop]: 10 mSDtfsCounter, 9 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 228 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 228 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 209 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-20 14:29:19,761 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 117 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 228 Invalid, 0 Unknown, 209 Unchecked, 0.2s Time] [2024-11-20 14:29:19,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-20 14:29:19,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2024-11-20 14:29:19,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 131 states have (on average 1.1755725190839694) internal successors, (154), 133 states have internal predecessors, (154), 0 states have call successors, (0), 0 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:29:19,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 154 transitions. [2024-11-20 14:29:19,764 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 154 transitions. Word has length 22 [2024-11-20 14:29:19,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:29:19,764 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 154 transitions. [2024-11-20 14:29:19,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 26 states have (on average 2.076923076923077) internal successors, (54), 27 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:19,764 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 154 transitions. [2024-11-20 14:29:19,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-20 14:29:19,765 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:29:19,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:29:19,772 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-20 14:29:19,969 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-20 14:29:19,970 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-20 14:29:19,970 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:29:19,971 INFO L85 PathProgramCache]: Analyzing trace with hash -887251266, now seen corresponding path program 1 times [2024-11-20 14:29:19,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:29:19,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1305920055] [2024-11-20 14:29:19,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:19,971 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:29:19,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:20,059 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:29:20,059 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:29:20,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1305920055] [2024-11-20 14:29:20,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1305920055] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:29:20,059 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:29:20,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-20 14:29:20,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1010642581] [2024-11-20 14:29:20,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:29:20,060 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-20 14:29:20,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:29:20,060 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-20 14:29:20,060 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-20 14:29:20,060 INFO L87 Difference]: Start difference. First operand 134 states and 154 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:20,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:29:20,098 INFO L93 Difference]: Finished difference Result 121 states and 137 transitions. [2024-11-20 14:29:20,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-20 14:29:20,098 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2024-11-20 14:29:20,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:29:20,099 INFO L225 Difference]: With dead ends: 121 [2024-11-20 14:29:20,099 INFO L226 Difference]: Without dead ends: 121 [2024-11-20 14:29:20,099 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:29:20,099 INFO L432 NwaCegarLoop]: 20 mSDtfsCounter, 4 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:29:20,100 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 58 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:29:20,100 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-20 14:29:20,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-20 14:29:20,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 118 states have (on average 1.1610169491525424) internal successors, (137), 120 states have internal predecessors, (137), 0 states have call successors, (0), 0 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:29:20,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 137 transitions. [2024-11-20 14:29:20,102 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 137 transitions. Word has length 22 [2024-11-20 14:29:20,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:29:20,102 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 137 transitions. [2024-11-20 14:29:20,102 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:20,102 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 137 transitions. [2024-11-20 14:29:20,102 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-20 14:29:20,102 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:29:20,103 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:29:20,103 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-20 14:29:20,103 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-20 14:29:20,103 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:29:20,103 INFO L85 PathProgramCache]: Analyzing trace with hash 151632784, now seen corresponding path program 1 times [2024-11-20 14:29:20,103 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:29:20,103 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802106859] [2024-11-20 14:29:20,104 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:20,104 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:29:20,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:20,254 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:29:20,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:29:20,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802106859] [2024-11-20 14:29:20,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802106859] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-20 14:29:20,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-20 14:29:20,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-20 14:29:20,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621154362] [2024-11-20 14:29:20,254 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-20 14:29:20,255 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-20 14:29:20,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:29:20,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-20 14:29:20,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-20 14:29:20,255 INFO L87 Difference]: Start difference. First operand 121 states and 137 transitions. Second operand has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:20,317 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:29:20,317 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2024-11-20 14:29:20,318 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-20 14:29:20,318 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2024-11-20 14:29:20,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:29:20,319 INFO L225 Difference]: With dead ends: 58 [2024-11-20 14:29:20,319 INFO L226 Difference]: Without dead ends: 58 [2024-11-20 14:29:20,319 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2024-11-20 14:29:20,321 INFO L432 NwaCegarLoop]: 11 mSDtfsCounter, 4 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 59 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-20 14:29:20,321 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 59 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-20 14:29:20,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2024-11-20 14:29:20,326 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 58. [2024-11-20 14:29:20,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.0175438596491229) internal successors, (58), 57 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:29:20,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 58 transitions. [2024-11-20 14:29:20,329 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 58 transitions. Word has length 31 [2024-11-20 14:29:20,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:29:20,329 INFO L471 AbstractCegarLoop]: Abstraction has 58 states and 58 transitions. [2024-11-20 14:29:20,329 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.875) internal successors, (31), 8 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:20,329 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 58 transitions. [2024-11-20 14:29:20,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2024-11-20 14:29:20,329 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:29:20,330 INFO L215 NwaCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2024-11-20 14:29:20,330 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2024-11-20 14:29:20,330 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-20 14:29:20,330 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:29:20,330 INFO L85 PathProgramCache]: Analyzing trace with hash -521146393, now seen corresponding path program 2 times [2024-11-20 14:29:20,330 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:29:20,330 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2036654970] [2024-11-20 14:29:20,330 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:20,330 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:29:20,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:20,655 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:29:20,659 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:29:20,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2036654970] [2024-11-20 14:29:20,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2036654970] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:29:20,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [132517295] [2024-11-20 14:29:20,659 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-20 14:29:20,660 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:29:20,660 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:29:20,661 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:29:20,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-20 14:29:20,807 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-20 14:29:20,808 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:29:20,810 INFO L255 TraceCheckSpWp]: Trace formula consists of 491 conjuncts, 25 conjuncts are in the unsatisfiable core [2024-11-20 14:29:20,813 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:29:20,892 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:29:20,947 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:29:20,947 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:29:21,303 INFO L134 CoverageAnalysis]: Checked inductivity of 125 backedges. 0 proven. 125 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:29:21,303 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [132517295] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:29:21,303 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:29:21,303 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 24 [2024-11-20 14:29:21,303 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1223018526] [2024-11-20 14:29:21,304 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:29:21,304 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2024-11-20 14:29:21,304 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:29:21,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2024-11-20 14:29:21,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2024-11-20 14:29:21,308 INFO L87 Difference]: Start difference. First operand 58 states and 58 transitions. Second operand has 25 states, 24 states have (on average 4.791666666666667) internal successors, (115), 25 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:29:22,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:29:22,614 INFO L93 Difference]: Finished difference Result 133 states and 133 transitions. [2024-11-20 14:29:22,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 56 states. [2024-11-20 14:29:22,614 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 24 states have (on average 4.791666666666667) internal successors, (115), 25 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 57 [2024-11-20 14:29:22,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:29:22,615 INFO L225 Difference]: With dead ends: 133 [2024-11-20 14:29:22,615 INFO L226 Difference]: Without dead ends: 133 [2024-11-20 14:29:22,616 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 164 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1164 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=876, Invalid=3414, Unknown=0, NotChecked=0, Total=4290 [2024-11-20 14:29:22,617 INFO L432 NwaCegarLoop]: 18 mSDtfsCounter, 83 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 728 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-20 14:29:22,617 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 171 Invalid, 728 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 720 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-20 14:29:22,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-11-20 14:29:22,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2024-11-20 14:29:22,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 129 states have (on average 1.0077519379844961) internal successors, (130), 129 states have internal predecessors, (130), 0 states have call successors, (0), 0 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:29:22,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 130 transitions. [2024-11-20 14:29:22,618 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 130 transitions. Word has length 57 [2024-11-20 14:29:22,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:29:22,618 INFO L471 AbstractCegarLoop]: Abstraction has 130 states and 130 transitions. [2024-11-20 14:29:22,619 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 24 states have (on average 4.791666666666667) internal successors, (115), 25 states have internal predecessors, (115), 0 states have call successors, (0), 0 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:29:22,619 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 130 transitions. [2024-11-20 14:29:22,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 130 [2024-11-20 14:29:22,620 INFO L207 NwaCegarLoop]: Found error trace [2024-11-20 14:29:22,620 INFO L215 NwaCegarLoop]: trace histogram [14, 14, 14, 14, 14, 14, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2024-11-20 14:29:22,627 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-20 14:29:22,820 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:29:22,821 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 11 more)] === [2024-11-20 14:29:22,821 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-20 14:29:22,821 INFO L85 PathProgramCache]: Analyzing trace with hash -1659076889, now seen corresponding path program 3 times [2024-11-20 14:29:22,822 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-20 14:29:22,822 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [631692369] [2024-11-20 14:29:22,822 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-20 14:29:22,822 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-20 14:29:23,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-20 14:29:23,955 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 0 proven. 793 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-20 14:29:23,955 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-20 14:29:23,955 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [631692369] [2024-11-20 14:29:23,955 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [631692369] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-20 14:29:23,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1401134941] [2024-11-20 14:29:23,956 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-20 14:29:23,956 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-20 14:29:23,956 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-20 14:29:23,958 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-20 14:29:23,962 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-20 14:29:24,108 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2024-11-20 14:29:24,109 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-20 14:29:24,110 INFO L255 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 18 conjuncts are in the unsatisfiable core [2024-11-20 14:29:24,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-20 14:29:24,550 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:29:24,613 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 73 proven. 78 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2024-11-20 14:29:24,613 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-20 14:29:25,133 INFO L134 CoverageAnalysis]: Checked inductivity of 793 backedges. 0 proven. 151 refuted. 0 times theorem prover too weak. 642 trivial. 0 not checked. [2024-11-20 14:29:25,134 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1401134941] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-20 14:29:25,134 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-20 14:29:25,134 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 9, 9] total 35 [2024-11-20 14:29:25,134 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2094812060] [2024-11-20 14:29:25,134 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-20 14:29:25,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-20 14:29:25,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-20 14:29:25,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-20 14:29:25,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1120, Unknown=0, NotChecked=0, Total=1260 [2024-11-20 14:29:25,136 INFO L87 Difference]: Start difference. First operand 130 states and 130 transitions. Second operand has 36 states, 35 states have (on average 5.114285714285714) internal successors, (179), 36 states have internal predecessors, (179), 0 states have call successors, (0), 0 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:29:27,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-20 14:29:27,134 INFO L93 Difference]: Finished difference Result 141 states and 141 transitions. [2024-11-20 14:29:27,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2024-11-20 14:29:27,135 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 5.114285714285714) internal successors, (179), 36 states have internal predecessors, (179), 0 states have call successors, (0), 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 129 [2024-11-20 14:29:27,139 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-20 14:29:27,139 INFO L225 Difference]: With dead ends: 141 [2024-11-20 14:29:27,139 INFO L226 Difference]: Without dead ends: 0 [2024-11-20 14:29:27,142 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 337 GetRequests, 242 SyntacticMatches, 0 SemanticMatches, 95 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1942 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=964, Invalid=8348, Unknown=0, NotChecked=0, Total=9312 [2024-11-20 14:29:27,142 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 137 mSDsluCounter, 510 mSDsCounter, 0 mSdLazyCounter, 2176 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 543 SdHoareTripleChecker+Invalid, 2195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 2176 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-20 14:29:27,146 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 543 Invalid, 2195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 2176 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-20 14:29:27,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2024-11-20 14:29:27,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2024-11-20 14:29:27,147 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-20 14:29:27,147 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2024-11-20 14:29:27,147 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 129 [2024-11-20 14:29:27,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-20 14:29:27,147 INFO L471 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2024-11-20 14:29:27,147 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 5.114285714285714) internal successors, (179), 36 states have internal predecessors, (179), 0 states have call successors, (0), 0 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:29:27,147 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2024-11-20 14:29:27,147 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2024-11-20 14:29:27,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 14 remaining) [2024-11-20 14:29:27,149 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 14 remaining) [2024-11-20 14:29:27,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 14 remaining) [2024-11-20 14:29:27,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 14 remaining) [2024-11-20 14:29:27,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 14 remaining) [2024-11-20 14:29:27,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 14 remaining) [2024-11-20 14:29:27,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 14 remaining) [2024-11-20 14:29:27,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 14 remaining) [2024-11-20 14:29:27,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 14 remaining) [2024-11-20 14:29:27,150 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 14 remaining) [2024-11-20 14:29:27,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE (3 of 14 remaining) [2024-11-20 14:29:27,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr11ASSERT_VIOLATIONMEMORY_FREE (2 of 14 remaining) [2024-11-20 14:29:27,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr12ASSERT_VIOLATIONMEMORY_FREE (1 of 14 remaining) [2024-11-20 14:29:27,154 INFO L782 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr13ASSERT_VIOLATIONMEMORY_LEAK (0 of 14 remaining) [2024-11-20 14:29:27,161 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-20 14:29:27,355 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2024-11-20 14:29:27,358 INFO L407 BasicCegarLoop]: Path program histogram: [3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-20 14:29:27,365 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-20 14:29:27,371 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.11 02:29:27 BoogieIcfgContainer [2024-11-20 14:29:27,373 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-20 14:29:27,374 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-20 14:29:27,374 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-20 14:29:27,374 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-20 14:29:27,375 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 02:29:10" (3/4) ... [2024-11-20 14:29:27,376 INFO L142 WitnessPrinter]: Generating witness for correct program [2024-11-20 14:29:27,383 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 14 nodes and edges [2024-11-20 14:29:27,383 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2024-11-20 14:29:27,383 INFO L925 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2024-11-20 14:29:27,452 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2024-11-20 14:29:27,452 INFO L149 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.yml [2024-11-20 14:29:27,452 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-20 14:29:27,453 INFO L158 Benchmark]: Toolchain (without parser) took 17555.74ms. Allocated memory was 239.1MB in the beginning and 453.0MB in the end (delta: 213.9MB). Free memory was 209.5MB in the beginning and 352.8MB in the end (delta: -143.3MB). Peak memory consumption was 69.8MB. Max. memory is 16.1GB. [2024-11-20 14:29:27,453 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 136.3MB. Free memory was 101.2MB in the beginning and 101.1MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-20 14:29:27,453 INFO L158 Benchmark]: CACSL2BoogieTranslator took 353.13ms. Allocated memory is still 239.1MB. Free memory was 209.3MB in the beginning and 193.9MB in the end (delta: 15.4MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2024-11-20 14:29:27,453 INFO L158 Benchmark]: Boogie Procedure Inliner took 34.33ms. Allocated memory is still 239.1MB. Free memory was 193.9MB in the beginning and 191.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 14:29:27,454 INFO L158 Benchmark]: Boogie Preprocessor took 25.84ms. Allocated memory is still 239.1MB. Free memory was 191.8MB in the beginning and 189.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-20 14:29:27,454 INFO L158 Benchmark]: RCFGBuilder took 448.39ms. Allocated memory is still 239.1MB. Free memory was 189.7MB in the beginning and 172.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2024-11-20 14:29:27,454 INFO L158 Benchmark]: TraceAbstraction took 16610.41ms. Allocated memory was 239.1MB in the beginning and 453.0MB in the end (delta: 213.9MB). Free memory was 172.9MB in the beginning and 357.5MB in the end (delta: -184.6MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. [2024-11-20 14:29:27,454 INFO L158 Benchmark]: Witness Printer took 78.49ms. Allocated memory is still 453.0MB. Free memory was 357.5MB in the beginning and 352.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-20 14:29:27,455 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 136.3MB. Free memory was 101.2MB in the beginning and 101.1MB in the end (delta: 139.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 353.13ms. Allocated memory is still 239.1MB. Free memory was 209.3MB in the beginning and 193.9MB in the end (delta: 15.4MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 34.33ms. Allocated memory is still 239.1MB. Free memory was 193.9MB in the beginning and 191.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 25.84ms. Allocated memory is still 239.1MB. Free memory was 191.8MB in the beginning and 189.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 448.39ms. Allocated memory is still 239.1MB. Free memory was 189.7MB in the beginning and 172.9MB in the end (delta: 16.8MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 16610.41ms. Allocated memory was 239.1MB in the beginning and 453.0MB in the end (delta: 213.9MB). Free memory was 172.9MB in the beginning and 357.5MB in the end (delta: -184.6MB). Peak memory consumption was 29.8MB. Max. memory is 16.1GB. * Witness Printer took 78.49ms. Allocated memory is still 453.0MB. Free memory was 357.5MB in the beginning and 352.8MB in the end (delta: 4.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: -1]: pointer dereference always succeeds For all program executions holds that pointer dereference always succeeds at this location - PositiveResult [Line: 581]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 581]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 581]: free always succeeds For all program executions holds that free always succeeds at this location - PositiveResult [Line: 570]: all allocated memory was freed For all program executions holds that all allocated memory was freed at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 14 error locations. Started 1 CEGAR loops. OverallTime: 16.6s, OverallIterations: 22, TraceHistogramMax: 14, PathProgramHistogramMax: 3, EmptinessCheckTime: 0.0s, AutomataDifference: 5.4s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 803 SdHoareTripleChecker+Valid, 2.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 803 mSDsluCounter, 2138 SdHoareTripleChecker+Invalid, 2.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 209 IncrementalHoareTripleChecker+Unchecked, 1622 mSDsCounter, 102 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 4451 IncrementalHoareTripleChecker+Invalid, 4762 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 102 mSolverCounterUnsat, 516 mSDtfsCounter, 4451 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 884 GetRequests, 534 SyntacticMatches, 10 SemanticMatches, 340 ConstructedPredicates, 6 IntricatePredicates, 1 DeprecatedPredicates, 3777 ImplicationChecksByTransitivity, 5.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=134occurred in iteration=18, InterpolantAutomatonStates: 267, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 22 MinimizatonAttempts, 148 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.2s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 7.6s InterpolantComputationTime, 772 NumberOfCodeBlocks, 664 NumberOfCodeBlocksAsserted, 32 NumberOfCheckSat, 1041 ConstructedInterpolants, 37 QuantifiedInterpolants, 8550 SizeOfPredicates, 30 NumberOfNonLiveVariables, 1664 ConjunctsInSsa, 169 ConjunctsInUnsatCore, 38 InterpolantComputations, 14 PerfectInterpolantSequences, 1369/2802 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 14 specifications checked. All of them hold RESULT: Ultimate proved your program to be correct! [2024-11-20 14:29:27,470 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE