./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-broom/sll-shared-sll-before.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-broom/sll-shared-sll-before.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 3d5c47b12a731095d5a51b5ad7e19fee7b2131bbe4b3910b3108642fe52c085d --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:56:48,254 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:56:48,330 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-11-09 07:56:48,334 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:56:48,338 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:56:48,373 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:56:48,376 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:56:48,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:56:48,377 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:56:48,377 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:56:48,378 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:56:48,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:56:48,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:56:48,381 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:56:48,382 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:56:48,382 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:56:48,382 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:56:48,383 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:56:48,383 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:56:48,383 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:56:48,384 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:56:48,384 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:56:48,384 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:56:48,385 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:56:48,385 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:56:48,385 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:56:48,386 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:56:48,386 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:56:48,386 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:56:48,387 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:56:48,387 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:56:48,387 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:56:48,388 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:56:48,388 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:56:48,388 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:56:48,389 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:56:48,389 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:56:48,389 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:56:48,390 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:56:48,390 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 3d5c47b12a731095d5a51b5ad7e19fee7b2131bbe4b3910b3108642fe52c085d [2024-11-09 07:56:48,666 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:56:48,693 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:56:48,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:56:48,698 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:56:48,698 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:56:48,699 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-broom/sll-shared-sll-before.i [2024-11-09 07:56:50,096 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:56:50,383 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:56:50,384 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-shared-sll-before.i [2024-11-09 07:56:50,411 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38d3ffd3f/aa8e65ddaf2647b388e7d873c069fff7/FLAGb4bc78914 [2024-11-09 07:56:50,655 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/38d3ffd3f/aa8e65ddaf2647b388e7d873c069fff7 [2024-11-09 07:56:50,657 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:56:50,659 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:56:50,663 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:56:50,663 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:56:50,668 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:56:50,669 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:56:50" (1/1) ... [2024-11-09 07:56:50,670 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@30930a55 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:56:50, skipping insertion in model container [2024-11-09 07:56:50,670 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:56:50" (1/1) ... [2024-11-09 07:56:50,718 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:56:51,045 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:56:51,054 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:56:51,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:56:51,118 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:56:51,118 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:56:51 WrapperNode [2024-11-09 07:56:51,118 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:56:51,119 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:56:51,119 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:56:51,119 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:56:51,126 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:56:51" (1/1) ... [2024-11-09 07:56:51,137 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:56:51" (1/1) ... [2024-11-09 07:56:51,156 INFO L138 Inliner]: procedures = 120, calls = 26, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 87 [2024-11-09 07:56:51,156 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:56:51,157 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:56:51,157 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:56:51,157 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:56:51,169 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:56:51" (1/1) ... [2024-11-09 07:56:51,169 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:56:51" (1/1) ... [2024-11-09 07:56:51,172 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:56:51" (1/1) ... [2024-11-09 07:56:51,194 INFO L175 MemorySlicer]: Split 12 memory accesses to 1 slices as follows [12]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 7 writes are split as follows [7]. [2024-11-09 07:56:51,195 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:56:51" (1/1) ... [2024-11-09 07:56:51,195 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:56:51" (1/1) ... [2024-11-09 07:56:51,203 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:56:51" (1/1) ... [2024-11-09 07:56:51,207 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:56:51" (1/1) ... [2024-11-09 07:56:51,209 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:56:51" (1/1) ... [2024-11-09 07:56:51,210 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:56:51" (1/1) ... [2024-11-09 07:56:51,212 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:56:51,213 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:56:51,214 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:56:51,214 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:56:51,215 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:56:51" (1/1) ... [2024-11-09 07:56:51,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:56:51,236 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:51,252 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:56:51,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:56:51,310 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero_internal [2024-11-09 07:56:51,310 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero_internal [2024-11-09 07:56:51,311 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-11-09 07:56:51,311 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-11-09 07:56:51,311 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:56:51,311 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-09 07:56:51,311 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-09 07:56:51,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-09 07:56:51,311 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:56:51,311 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:56:51,504 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:56:51,512 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:56:51,890 INFO L? ?]: Removed 84 outVars from TransFormulas that were not future-live. [2024-11-09 07:56:51,890 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:56:51,911 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:56:51,911 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-09 07:56:51,912 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:56:51 BoogieIcfgContainer [2024-11-09 07:56:51,912 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:56:51,914 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:56:51,915 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:56:51,918 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:56:51,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:56:50" (1/3) ... [2024-11-09 07:56:51,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3082f1df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:56:51, skipping insertion in model container [2024-11-09 07:56:51,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:56:51" (2/3) ... [2024-11-09 07:56:51,920 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3082f1df and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:56:51, skipping insertion in model container [2024-11-09 07:56:51,920 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:56:51" (3/3) ... [2024-11-09 07:56:51,922 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-shared-sll-before.i [2024-11-09 07:56:51,938 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:56:51,938 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 31 error locations. [2024-11-09 07:56:51,992 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:56:52,001 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;@2b959fb0, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:56:52,001 INFO L334 AbstractCegarLoop]: Starting to check reachability of 31 error locations. [2024-11-09 07:56:52,004 INFO L276 IsEmpty]: Start isEmpty. Operand has 87 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 80 states have internal predecessors, (88), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:56:52,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:56:52,010 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:52,010 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:56:52,011 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zero_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:56:52,019 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:52,019 INFO L85 PathProgramCache]: Analyzing trace with hash 37399427, now seen corresponding path program 1 times [2024-11-09 07:56:52,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:52,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1758662277] [2024-11-09 07:56:52,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:52,030 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:52,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:52,253 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:56:52,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:52,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1758662277] [2024-11-09 07:56:52,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1758662277] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:56:52,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:56:52,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:56:52,257 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1809624718] [2024-11-09 07:56:52,257 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:56:52,262 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:56:52,264 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:52,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:56:52,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:56:52,299 INFO L87 Difference]: Start difference. First operand has 87 states, 49 states have (on average 1.7959183673469388) internal successors, (88), 80 states have internal predecessors, (88), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:56:52,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:52,393 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2024-11-09 07:56:52,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:56:52,396 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 07:56:52,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:52,403 INFO L225 Difference]: With dead ends: 86 [2024-11-09 07:56:52,404 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 07:56:52,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:56:52,410 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 1 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 144 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:52,412 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 144 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:56:52,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 07:56:52,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-11-09 07:56:52,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 48 states have (on average 1.6875) internal successors, (81), 77 states have internal predecessors, (81), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:56:52,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2024-11-09 07:56:52,445 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 5 [2024-11-09 07:56:52,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:52,445 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2024-11-09 07:56:52,446 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:56:52,446 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2024-11-09 07:56:52,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2024-11-09 07:56:52,446 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:52,447 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2024-11-09 07:56:52,447 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:56:52,447 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zero_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:56:52,448 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:52,448 INFO L85 PathProgramCache]: Analyzing trace with hash 37399428, now seen corresponding path program 1 times [2024-11-09 07:56:52,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:52,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [974381848] [2024-11-09 07:56:52,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:52,449 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:52,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:52,553 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:56:52,554 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:52,554 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [974381848] [2024-11-09 07:56:52,554 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [974381848] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:56:52,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:56:52,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:56:52,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1772003995] [2024-11-09 07:56:52,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:56:52,555 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:56:52,556 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:52,557 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:56:52,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:56:52,557 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:56:52,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:52,629 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2024-11-09 07:56:52,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:56:52,630 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 5 [2024-11-09 07:56:52,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:52,631 INFO L225 Difference]: With dead ends: 83 [2024-11-09 07:56:52,631 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 07:56:52,631 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:56:52,632 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 1 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:52,633 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 148 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:56:52,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 07:56:52,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-11-09 07:56:52,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 48 states have (on average 1.6666666666666667) internal successors, (80), 76 states have internal predecessors, (80), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:56:52,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2024-11-09 07:56:52,650 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 5 [2024-11-09 07:56:52,650 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:52,650 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2024-11-09 07:56:52,650 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-09 07:56:52,650 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2024-11-09 07:56:52,651 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:56:52,651 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:52,651 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:52,654 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:56:52,654 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:56:52,655 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:52,658 INFO L85 PathProgramCache]: Analyzing trace with hash -1862562470, now seen corresponding path program 1 times [2024-11-09 07:56:52,658 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:52,659 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507228942] [2024-11-09 07:56:52,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:52,659 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:52,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:52,771 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:52,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:52,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:56:52,794 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:52,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507228942] [2024-11-09 07:56:52,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507228942] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:56:52,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:56:52,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:56:52,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555471066] [2024-11-09 07:56:52,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:56:52,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:56:52,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:52,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:56:52,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:56:52,798 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:56:52,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:52,933 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2024-11-09 07:56:52,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:56:52,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-09 07:56:52,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:52,935 INFO L225 Difference]: With dead ends: 81 [2024-11-09 07:56:52,935 INFO L226 Difference]: Without dead ends: 81 [2024-11-09 07:56:52,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-09 07:56:52,937 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:52,937 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 172 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:56:52,938 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-11-09 07:56:52,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-11-09 07:56:52,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 48 states have (on average 1.625) internal successors, (78), 74 states have internal predecessors, (78), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:56:52,944 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2024-11-09 07:56:52,944 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 16 [2024-11-09 07:56:52,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:52,946 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2024-11-09 07:56:52,946 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:56:52,947 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2024-11-09 07:56:52,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-09 07:56:52,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:52,947 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:52,948 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-09 07:56:52,948 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:56:52,949 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:52,950 INFO L85 PathProgramCache]: Analyzing trace with hash -1862562469, now seen corresponding path program 1 times [2024-11-09 07:56:52,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:52,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [775683985] [2024-11-09 07:56:52,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:52,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:52,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:53,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:53,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:53,106 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:56:53,106 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:53,106 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [775683985] [2024-11-09 07:56:53,107 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [775683985] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:56:53,107 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:56:53,107 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:56:53,107 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [38869057] [2024-11-09 07:56:53,107 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:56:53,108 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:56:53,108 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:53,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:56:53,109 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:56:53,109 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:56:53,189 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:53,189 INFO L93 Difference]: Finished difference Result 79 states and 84 transitions. [2024-11-09 07:56:53,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:56:53,190 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2024-11-09 07:56:53,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:53,191 INFO L225 Difference]: With dead ends: 79 [2024-11-09 07:56:53,191 INFO L226 Difference]: Without dead ends: 79 [2024-11-09 07:56:53,191 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:56:53,193 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 2 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:53,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 179 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:56:53,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2024-11-09 07:56:53,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 79. [2024-11-09 07:56:53,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 48 states have (on average 1.5833333333333333) internal successors, (76), 72 states have internal predecessors, (76), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2024-11-09 07:56:53,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2024-11-09 07:56:53,199 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 16 [2024-11-09 07:56:53,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:53,199 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2024-11-09 07:56:53,199 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 1 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-11-09 07:56:53,200 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2024-11-09 07:56:53,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:56:53,200 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:53,201 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:53,201 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:56:53,201 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:56:53,202 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:53,202 INFO L85 PathProgramCache]: Analyzing trace with hash -434415733, now seen corresponding path program 1 times [2024-11-09 07:56:53,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:53,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [910281277] [2024-11-09 07:56:53,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:53,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:53,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:53,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:53,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:53,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 07:56:53,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:53,570 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:56:53,571 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:53,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [910281277] [2024-11-09 07:56:53,571 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [910281277] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:53,571 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2078082861] [2024-11-09 07:56:53,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:53,571 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:53,571 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:53,574 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:56:53,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:56:53,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:53,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 07:56:53,672 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:53,733 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-09 07:56:53,788 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-09 07:56:53,826 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 07:56:53,827 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 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 07:56:53,839 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 07:56:53,839 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:54,036 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:56:54,037 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2078082861] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:56:54,037 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:56:54,037 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 11 [2024-11-09 07:56:54,037 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1009245513] [2024-11-09 07:56:54,038 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:54,038 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:56:54,038 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:54,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:56:54,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-11-09 07:56:54,039 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:56:54,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:54,327 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2024-11-09 07:56:54,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:56:54,328 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) Word has length 18 [2024-11-09 07:56:54,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:54,329 INFO L225 Difference]: With dead ends: 84 [2024-11-09 07:56:54,329 INFO L226 Difference]: Without dead ends: 84 [2024-11-09 07:56:54,329 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 12 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=40, Invalid=119, Unknown=1, NotChecked=22, Total=182 [2024-11-09 07:56:54,330 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 8 mSDsluCounter, 262 mSDsCounter, 0 mSdLazyCounter, 243 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 243 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:54,330 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 333 Invalid, 340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 243 Invalid, 0 Unknown, 88 Unchecked, 0.2s Time] [2024-11-09 07:56:54,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-11-09 07:56:54,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 82. [2024-11-09 07:56:54,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 51 states have (on average 1.5686274509803921) internal successors, (80), 74 states have internal predecessors, (80), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:56:54,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 90 transitions. [2024-11-09 07:56:54,345 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 90 transitions. Word has length 18 [2024-11-09 07:56:54,345 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:54,345 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 90 transitions. [2024-11-09 07:56:54,345 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 9 states have internal predecessors, (24), 2 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (4), 2 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:56:54,346 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 90 transitions. [2024-11-09 07:56:54,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-11-09 07:56:54,346 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:54,346 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:54,366 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:56:54,552 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:54,553 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:56:54,553 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:54,554 INFO L85 PathProgramCache]: Analyzing trace with hash -434415732, now seen corresponding path program 1 times [2024-11-09 07:56:54,554 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:54,554 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1878342676] [2024-11-09 07:56:54,554 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:54,554 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:54,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:54,731 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:54,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:54,859 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 07:56:54,864 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:54,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:56:54,950 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:54,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1878342676] [2024-11-09 07:56:54,950 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1878342676] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:54,950 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [356974710] [2024-11-09 07:56:54,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:54,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:54,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:54,953 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:56:54,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:56:55,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:55,034 INFO L255 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 07:56:55,038 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:55,053 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-09 07:56:55,257 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-11-09 07:56:55,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:55,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:56:55,306 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:55,306 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 11 treesize of output 11 [2024-11-09 07:56:55,335 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 07:56:55,335 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:55,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [356974710] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:55,443 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:56:55,443 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 18 [2024-11-09 07:56:55,443 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432539132] [2024-11-09 07:56:55,443 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:55,444 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 07:56:55,444 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:55,445 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 07:56:55,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=291, Unknown=1, NotChecked=34, Total=380 [2024-11-09 07:56:55,447 INFO L87 Difference]: Start difference. First operand 82 states and 90 transitions. Second operand has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 13 states have internal predecessors, (26), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:56:55,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:55,791 INFO L93 Difference]: Finished difference Result 85 states and 92 transitions. [2024-11-09 07:56:55,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:56:55,792 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 13 states have internal predecessors, (26), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 18 [2024-11-09 07:56:55,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:55,793 INFO L225 Difference]: With dead ends: 85 [2024-11-09 07:56:55,793 INFO L226 Difference]: Without dead ends: 85 [2024-11-09 07:56:55,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=67, Invalid=356, Unknown=1, NotChecked=38, Total=462 [2024-11-09 07:56:55,795 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 17 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 374 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 509 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 374 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 88 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:55,795 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 509 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 374 Invalid, 0 Unknown, 88 Unchecked, 0.3s Time] [2024-11-09 07:56:55,797 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-11-09 07:56:55,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2024-11-09 07:56:55,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 51 states have (on average 1.5294117647058822) internal successors, (78), 73 states have internal predecessors, (78), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:56:55,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 88 transitions. [2024-11-09 07:56:55,801 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 88 transitions. Word has length 18 [2024-11-09 07:56:55,802 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:55,802 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 88 transitions. [2024-11-09 07:56:55,802 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 13 states have internal predecessors, (26), 3 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:56:55,802 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 88 transitions. [2024-11-09 07:56:55,803 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:56:55,803 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:55,803 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-09 07:56:55,816 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-09 07:56:56,003 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,SelfDestructingSolverStorable5 [2024-11-09 07:56:56,004 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:56:56,005 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:56,005 INFO L85 PathProgramCache]: Analyzing trace with hash -492562465, now seen corresponding path program 1 times [2024-11-09 07:56:56,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:56,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697343508] [2024-11-09 07:56:56,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:56,005 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:56,084 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:56,088 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:56,093 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 07:56:56,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:56,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:56:56,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:56,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697343508] [2024-11-09 07:56:56,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697343508] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:56:56,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:56:56,138 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:56:56,138 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1130206515] [2024-11-09 07:56:56,138 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:56:56,139 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:56:56,139 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:56,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:56:56,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:56:56,140 INFO L87 Difference]: Start difference. First operand 81 states and 88 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:56:56,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:56,275 INFO L93 Difference]: Finished difference Result 83 states and 92 transitions. [2024-11-09 07:56:56,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:56:56,276 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-09 07:56:56,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:56,279 INFO L225 Difference]: With dead ends: 83 [2024-11-09 07:56:56,279 INFO L226 Difference]: Without dead ends: 83 [2024-11-09 07:56:56,280 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:56:56,281 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 11 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 272 SdHoareTripleChecker+Invalid, 190 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:56,281 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 272 Invalid, 190 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:56:56,282 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-11-09 07:56:56,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 78. [2024-11-09 07:56:56,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 51 states have (on average 1.4705882352941178) internal successors, (75), 70 states have internal predecessors, (75), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:56:56,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 85 transitions. [2024-11-09 07:56:56,295 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 85 transitions. Word has length 22 [2024-11-09 07:56:56,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:56,295 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 85 transitions. [2024-11-09 07:56:56,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:56:56,296 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 85 transitions. [2024-11-09 07:56:56,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-09 07:56:56,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:56,296 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-09 07:56:56,296 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:56:56,297 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:56:56,297 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:56,297 INFO L85 PathProgramCache]: Analyzing trace with hash -492562464, now seen corresponding path program 1 times [2024-11-09 07:56:56,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:56,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338048841] [2024-11-09 07:56:56,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:56,298 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:56,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:56,424 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:56,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:56,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 07:56:56,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:56,504 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:56:56,504 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:56,504 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338048841] [2024-11-09 07:56:56,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338048841] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:56:56,505 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:56:56,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:56:56,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285520421] [2024-11-09 07:56:56,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:56:56,505 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-09 07:56:56,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:56,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-09 07:56:56,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:56:56,507 INFO L87 Difference]: Start difference. First operand 78 states and 85 transitions. Second operand has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:56:56,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:56,625 INFO L93 Difference]: Finished difference Result 82 states and 91 transitions. [2024-11-09 07:56:56,625 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-09 07:56:56,626 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 22 [2024-11-09 07:56:56,626 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:56,626 INFO L225 Difference]: With dead ends: 82 [2024-11-09 07:56:56,627 INFO L226 Difference]: Without dead ends: 82 [2024-11-09 07:56:56,627 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:56:56,628 INFO L432 NwaCegarLoop]: 71 mSDtfsCounter, 5 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:56,628 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 309 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:56:56,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-11-09 07:56:56,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 77. [2024-11-09 07:56:56,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.4509803921568627) internal successors, (74), 69 states have internal predecessors, (74), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:56:56,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2024-11-09 07:56:56,637 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 22 [2024-11-09 07:56:56,637 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:56,637 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2024-11-09 07:56:56,637 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.0) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:56:56,638 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2024-11-09 07:56:56,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:56:56,638 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:56,638 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:56,638 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2024-11-09 07:56:56,639 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:56:56,639 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:56,639 INFO L85 PathProgramCache]: Analyzing trace with hash 997710085, now seen corresponding path program 1 times [2024-11-09 07:56:56,639 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:56,639 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1259357928] [2024-11-09 07:56:56,639 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:56,639 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:56,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:56,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:56,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:56,816 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 07:56:56,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:56,900 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:56:56,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:56,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1259357928] [2024-11-09 07:56:56,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1259357928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:56:56,901 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:56:56,901 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-09 07:56:56,901 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352475386] [2024-11-09 07:56:56,901 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:56:56,901 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:56:56,901 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:56,902 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:56:56,902 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=109, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:56:56,902 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:56:57,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:57,212 INFO L93 Difference]: Finished difference Result 78 states and 87 transitions. [2024-11-09 07:56:57,212 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:56:57,212 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-09 07:56:57,212 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:57,213 INFO L225 Difference]: With dead ends: 78 [2024-11-09 07:56:57,213 INFO L226 Difference]: Without dead ends: 78 [2024-11-09 07:56:57,213 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=151, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:56:57,214 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 29 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 397 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 405 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 397 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:57,214 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 321 Invalid, 405 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 397 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:56:57,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-11-09 07:56:57,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-11-09 07:56:57,217 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 53 states have (on average 1.4528301886792452) internal successors, (77), 70 states have internal predecessors, (77), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:56:57,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 87 transitions. [2024-11-09 07:56:57,218 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 87 transitions. Word has length 28 [2024-11-09 07:56:57,219 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:57,219 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 87 transitions. [2024-11-09 07:56:57,219 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.1818181818181817) internal successors, (24), 10 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:56:57,219 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 87 transitions. [2024-11-09 07:56:57,220 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:56:57,220 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:57,220 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:57,220 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:56:57,220 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:56:57,221 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:57,221 INFO L85 PathProgramCache]: Analyzing trace with hash 997710086, now seen corresponding path program 1 times [2024-11-09 07:56:57,221 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:57,221 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273629056] [2024-11-09 07:56:57,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:57,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:57,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:57,452 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:57,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:57,539 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 07:56:57,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:57,620 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:56:57,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:57,621 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273629056] [2024-11-09 07:56:57,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1273629056] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:56:57,621 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:56:57,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-09 07:56:57,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197201586] [2024-11-09 07:56:57,621 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:56:57,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:56:57,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:57,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:56:57,622 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=153, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:56:57,623 INFO L87 Difference]: Start difference. First operand 78 states and 87 transitions. Second operand has 14 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:56:57,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:57,942 INFO L93 Difference]: Finished difference Result 92 states and 105 transitions. [2024-11-09 07:56:57,942 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:56:57,943 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 28 [2024-11-09 07:56:57,943 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:57,943 INFO L225 Difference]: With dead ends: 92 [2024-11-09 07:56:57,943 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 07:56:57,944 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=38, Invalid=202, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:56:57,944 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 7 mSDsluCounter, 316 mSDsCounter, 0 mSdLazyCounter, 396 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 409 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 396 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:57,944 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 374 Invalid, 409 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 396 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:56:57,945 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 07:56:57,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2024-11-09 07:56:57,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 65 states have (on average 1.4) internal successors, (91), 82 states have internal predecessors, (91), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:56:57,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 103 transitions. [2024-11-09 07:56:57,948 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 103 transitions. Word has length 28 [2024-11-09 07:56:57,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:57,948 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 103 transitions. [2024-11-09 07:56:57,948 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 12 states have (on average 2.0) internal successors, (24), 12 states have internal predecessors, (24), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:56:57,949 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 103 transitions. [2024-11-09 07:56:57,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:56:57,949 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:57,949 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:57,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-09 07:56:57,950 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:56:57,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:57,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1052903553, now seen corresponding path program 1 times [2024-11-09 07:56:57,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:57,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [520493892] [2024-11-09 07:56:57,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:57,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:57,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:58,105 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:58,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:58,113 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 07:56:58,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:58,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 07:56:58,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:58,211 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:56:58,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:58,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [520493892] [2024-11-09 07:56:58,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [520493892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:58,212 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2146197036] [2024-11-09 07:56:58,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:58,212 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:58,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:58,214 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:56:58,215 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:56:58,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:58,302 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 19 conjuncts are in the unsatisfiable core [2024-11-09 07:56:58,304 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:58,313 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-09 07:56:58,330 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-09 07:56:58,342 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 17 treesize of output 9 [2024-11-09 07:56:58,368 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) is different from true [2024-11-09 07:56:58,391 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-09 07:56:58,391 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 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-09 07:56:58,403 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-09 07:56:58,403 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:58,542 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:56:58,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2146197036] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:56:58,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:56:58,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 8] total 13 [2024-11-09 07:56:58,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355809332] [2024-11-09 07:56:58,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:58,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:56:58,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:58,544 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:56:58,544 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=126, Unknown=1, NotChecked=22, Total=182 [2024-11-09 07:56:58,544 INFO L87 Difference]: Start difference. First operand 91 states and 103 transitions. Second operand has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 07:56:58,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:56:58,782 INFO L93 Difference]: Finished difference Result 90 states and 102 transitions. [2024-11-09 07:56:58,782 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:56:58,782 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 30 [2024-11-09 07:56:58,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:56:58,783 INFO L225 Difference]: With dead ends: 90 [2024-11-09 07:56:58,783 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 07:56:58,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=52, Invalid=223, Unknown=1, NotChecked=30, Total=306 [2024-11-09 07:56:58,784 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 12 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 349 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 80 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:56:58,784 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 406 Invalid, 349 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 262 Invalid, 0 Unknown, 80 Unchecked, 0.2s Time] [2024-11-09 07:56:58,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 07:56:58,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-09 07:56:58,787 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 65 states have (on average 1.3846153846153846) internal successors, (90), 81 states have internal predecessors, (90), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:56:58,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 102 transitions. [2024-11-09 07:56:58,788 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 102 transitions. Word has length 30 [2024-11-09 07:56:58,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:56:58,788 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 102 transitions. [2024-11-09 07:56:58,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 11 states have internal predecessors, (34), 2 states have call successors, (7), 4 states have call predecessors, (7), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-11-09 07:56:58,788 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 102 transitions. [2024-11-09 07:56:58,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:56:58,789 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:56:58,789 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:56:58,805 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 07:56:58,990 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:58,990 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:56:58,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:56:58,991 INFO L85 PathProgramCache]: Analyzing trace with hash 1052903554, now seen corresponding path program 1 times [2024-11-09 07:56:58,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:56:58,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [98065837] [2024-11-09 07:56:58,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:58,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:56:59,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:59,238 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:56:59,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:59,243 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 07:56:59,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:59,321 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 07:56:59,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:59,390 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 11 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 07:56:59,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:56:59,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [98065837] [2024-11-09 07:56:59,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [98065837] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:59,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1049919232] [2024-11-09 07:56:59,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:56:59,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:56:59,391 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:56:59,393 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:56:59,394 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:56:59,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:56:59,477 INFO L255 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-11-09 07:56:59,480 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:56:59,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:56:59,491 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-09 07:56:59,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:56:59,592 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-09 07:56:59,626 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 26 treesize of output 14 [2024-11-09 07:56:59,725 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-11-09 07:56:59,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:56:59,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:56:59,758 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:56:59,758 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 11 treesize of output 11 [2024-11-09 07:56:59,781 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 13 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-11-09 07:56:59,781 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:56:59,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1049919232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:56:59,883 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:56:59,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 10] total 21 [2024-11-09 07:56:59,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2754555] [2024-11-09 07:56:59,886 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:56:59,886 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-11-09 07:56:59,886 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:56:59,887 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-11-09 07:56:59,887 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=443, Unknown=1, NotChecked=42, Total=552 [2024-11-09 07:56:59,887 INFO L87 Difference]: Start difference. First operand 90 states and 102 transitions. Second operand has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 07:57:00,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:00,360 INFO L93 Difference]: Finished difference Result 91 states and 103 transitions. [2024-11-09 07:57:00,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:57:00,361 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 30 [2024-11-09 07:57:00,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:00,362 INFO L225 Difference]: With dead ends: 91 [2024-11-09 07:57:00,362 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 07:57:00,362 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=95, Invalid=610, Unknown=1, NotChecked=50, Total=756 [2024-11-09 07:57:00,363 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 10 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 485 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 485 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:00,363 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 654 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 485 Invalid, 0 Unknown, 81 Unchecked, 0.3s Time] [2024-11-09 07:57:00,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 07:57:00,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2024-11-09 07:57:00,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.375) internal successors, (88), 79 states have internal predecessors, (88), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:57:00,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 98 transitions. [2024-11-09 07:57:00,367 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 98 transitions. Word has length 30 [2024-11-09 07:57:00,367 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:00,367 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 98 transitions. [2024-11-09 07:57:00,367 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 1.9047619047619047) internal successors, (40), 16 states have internal predecessors, (40), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 07:57:00,367 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 98 transitions. [2024-11-09 07:57:00,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:57:00,368 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:00,368 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:00,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-09 07:57:00,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:00,569 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:57:00,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:00,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1021640053, now seen corresponding path program 1 times [2024-11-09 07:57:00,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:00,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721594286] [2024-11-09 07:57:00,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:00,570 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:00,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:00,655 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:00,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:00,710 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 07:57:00,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:00,719 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:00,720 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:00,720 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721594286] [2024-11-09 07:57:00,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721594286] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:00,720 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:00,720 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:57:00,720 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [71976923] [2024-11-09 07:57:00,720 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:00,720 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:57:00,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:00,721 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:57:00,721 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:57:00,721 INFO L87 Difference]: Start difference. First operand 87 states and 98 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:57:00,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:00,819 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2024-11-09 07:57:00,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:57:00,819 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 30 [2024-11-09 07:57:00,820 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:00,820 INFO L225 Difference]: With dead ends: 92 [2024-11-09 07:57:00,820 INFO L226 Difference]: Without dead ends: 92 [2024-11-09 07:57:00,821 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:57:00,822 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 25 mSDsluCounter, 435 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 498 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:00,822 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 498 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:00,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2024-11-09 07:57:00,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 87. [2024-11-09 07:57:00,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 64 states have (on average 1.34375) internal successors, (86), 79 states have internal predecessors, (86), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:57:00,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 96 transitions. [2024-11-09 07:57:00,825 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 96 transitions. Word has length 30 [2024-11-09 07:57:00,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:00,825 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 96 transitions. [2024-11-09 07:57:00,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:57:00,826 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 96 transitions. [2024-11-09 07:57:00,830 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:57:00,830 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:00,830 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:00,830 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:57:00,830 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:57:00,831 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:00,831 INFO L85 PathProgramCache]: Analyzing trace with hash 1607511573, now seen corresponding path program 1 times [2024-11-09 07:57:00,831 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:00,831 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416161307] [2024-11-09 07:57:00,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:00,831 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:00,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:00,928 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:00,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:00,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 07:57:00,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:00,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:00,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:00,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1416161307] [2024-11-09 07:57:00,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1416161307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:00,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:00,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:57:00,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031926459] [2024-11-09 07:57:00,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:00,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:57:00,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:00,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:57:00,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:57:00,975 INFO L87 Difference]: Start difference. First operand 87 states and 96 transitions. Second operand has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:57:01,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:01,118 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2024-11-09 07:57:01,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:57:01,118 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 31 [2024-11-09 07:57:01,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:01,119 INFO L225 Difference]: With dead ends: 91 [2024-11-09 07:57:01,119 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 07:57:01,119 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:57:01,119 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 21 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 217 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 432 SdHoareTripleChecker+Invalid, 220 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 217 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:01,120 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 432 Invalid, 220 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 217 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:01,120 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 07:57:01,122 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 90. [2024-11-09 07:57:01,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 67 states have (on average 1.3432835820895523) internal successors, (90), 82 states have internal predecessors, (90), 5 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:57:01,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 100 transitions. [2024-11-09 07:57:01,123 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 100 transitions. Word has length 31 [2024-11-09 07:57:01,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:01,123 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 100 transitions. [2024-11-09 07:57:01,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.0) internal successors, (27), 8 states have internal predecessors, (27), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:57:01,123 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 100 transitions. [2024-11-09 07:57:01,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 07:57:01,124 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:01,124 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:01,124 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-09 07:57:01,124 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:57:01,125 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:01,125 INFO L85 PathProgramCache]: Analyzing trace with hash 290017258, now seen corresponding path program 1 times [2024-11-09 07:57:01,125 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:01,125 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814590935] [2024-11-09 07:57:01,125 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:01,125 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:01,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:01,213 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:01,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:01,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 07:57:01,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:01,248 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 07:57:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:01,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:01,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:01,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814590935] [2024-11-09 07:57:01,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814590935] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:01,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [909481289] [2024-11-09 07:57:01,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:01,306 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:01,306 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:01,308 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:57:01,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:57:01,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:01,428 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 07:57:01,430 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:01,452 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2024-11-09 07:57:01,491 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:57:01,492 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 07:57:01,495 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:01,495 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:57:01,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [909481289] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:01,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:57:01,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [8] total 10 [2024-11-09 07:57:01,495 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [92935469] [2024-11-09 07:57:01,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:01,496 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:57:01,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:01,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:57:01,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-11-09 07:57:01,496 INFO L87 Difference]: Start difference. First operand 90 states and 100 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:57:01,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:01,546 INFO L93 Difference]: Finished difference Result 96 states and 109 transitions. [2024-11-09 07:57:01,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:57:01,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2024-11-09 07:57:01,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:01,547 INFO L225 Difference]: With dead ends: 96 [2024-11-09 07:57:01,547 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 07:57:01,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=70, Unknown=1, NotChecked=16, Total=110 [2024-11-09 07:57:01,548 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 9 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:01,548 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 139 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 60 Invalid, 0 Unknown, 95 Unchecked, 0.0s Time] [2024-11-09 07:57:01,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 07:57:01,550 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2024-11-09 07:57:01,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 70 states have (on average 1.3571428571428572) internal successors, (95), 85 states have internal predecessors, (95), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:57:01,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 107 transitions. [2024-11-09 07:57:01,551 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 107 transitions. Word has length 32 [2024-11-09 07:57:01,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:01,551 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 107 transitions. [2024-11-09 07:57:01,552 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 4 states have internal predecessors, (26), 2 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-09 07:57:01,552 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 107 transitions. [2024-11-09 07:57:01,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-09 07:57:01,553 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:01,554 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:01,571 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-09 07:57:01,754 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,SelfDestructingSolverStorable14 [2024-11-09 07:57:01,754 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:57:01,755 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:01,755 INFO L85 PathProgramCache]: Analyzing trace with hash 290017259, now seen corresponding path program 1 times [2024-11-09 07:57:01,755 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:01,755 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2006823414] [2024-11-09 07:57:01,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:01,755 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:01,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:01,907 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:01,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:01,914 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 07:57:01,918 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:02,000 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 07:57:02,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:02,065 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:02,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:02,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2006823414] [2024-11-09 07:57:02,065 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2006823414] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:02,065 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797340745] [2024-11-09 07:57:02,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:02,065 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:02,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:02,067 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:57:02,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 07:57:02,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:02,180 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-11-09 07:57:02,182 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:02,192 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:57:02,335 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-09 07:57:02,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:57:02,374 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:57:02,383 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:57:02,384 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 11 treesize of output 11 [2024-11-09 07:57:02,387 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-09 07:57:02,387 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:02,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797340745] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:02,505 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:57:02,505 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 17 [2024-11-09 07:57:02,505 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56969618] [2024-11-09 07:57:02,505 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:02,506 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 07:57:02,506 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:02,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 07:57:02,507 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=288, Unknown=1, NotChecked=34, Total=380 [2024-11-09 07:57:02,507 INFO L87 Difference]: Start difference. First operand 94 states and 107 transitions. Second operand has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 07:57:02,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:02,780 INFO L93 Difference]: Finished difference Result 103 states and 115 transitions. [2024-11-09 07:57:02,780 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:57:02,780 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 32 [2024-11-09 07:57:02,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:02,781 INFO L225 Difference]: With dead ends: 103 [2024-11-09 07:57:02,781 INFO L226 Difference]: Without dead ends: 103 [2024-11-09 07:57:02,782 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 65 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=69, Invalid=354, Unknown=1, NotChecked=38, Total=462 [2024-11-09 07:57:02,783 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 11 mSDsluCounter, 380 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 383 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:02,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 440 Invalid, 383 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 289 Invalid, 0 Unknown, 85 Unchecked, 0.2s Time] [2024-11-09 07:57:02,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-09 07:57:02,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2024-11-09 07:57:02,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 90 states have internal predecessors, (101), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:57:02,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 113 transitions. [2024-11-09 07:57:02,787 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 113 transitions. Word has length 32 [2024-11-09 07:57:02,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:02,787 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 113 transitions. [2024-11-09 07:57:02,788 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 13 states have internal predecessors, (42), 3 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 07:57:02,788 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 113 transitions. [2024-11-09 07:57:02,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-09 07:57:02,788 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:02,789 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:02,808 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 07:57:02,989 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,SelfDestructingSolverStorable15 [2024-11-09 07:57:02,990 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:57:02,990 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:02,990 INFO L85 PathProgramCache]: Analyzing trace with hash 492043658, now seen corresponding path program 1 times [2024-11-09 07:57:02,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:02,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601514810] [2024-11-09 07:57:02,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:02,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:03,006 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:03,458 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:03,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:03,548 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 07:57:03,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:03,763 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:03,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:03,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601514810] [2024-11-09 07:57:03,763 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601514810] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:03,763 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1191942200] [2024-11-09 07:57:03,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:03,764 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:03,764 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:03,766 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:57:03,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 07:57:03,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:03,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-09 07:57:03,872 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:03,880 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-09 07:57:03,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:57:03,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:57:04,296 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:57:04,297 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 11 treesize of output 11 [2024-11-09 07:57:08,307 WARN L851 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0) (or (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0) (exists ((|v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#0.offset|))) (and (= |c_#memory_$Pointer$#0.offset| (store |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| .cse0 (select |c_#memory_$Pointer$#0.offset| .cse0))) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse0) (= (select (select |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0))))) (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| |c_ULTIMATE.start_main_~shared~0#1.base|))) is different from false [2024-11-09 07:57:08,312 WARN L873 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0) (or (= (select (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0) (exists ((|v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse0 (@diff |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#0.offset|))) (and (= |c_#memory_$Pointer$#0.offset| (store |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| .cse0 (select |c_#memory_$Pointer$#0.offset| .cse0))) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse0) (= (select (select |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0))))) (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| |c_ULTIMATE.start_main_~shared~0#1.base|))) is different from true [2024-11-09 07:57:08,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:57:08,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:57:08,481 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:08,481 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 15 [2024-11-09 07:57:08,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:08,493 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 15 [2024-11-09 07:57:08,609 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:08,610 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:08,737 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_706 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~1#1.base| v_ArrVal_706) |c_ULTIMATE.start_main_~shared~0#1.base|) 0))) (forall ((v_ArrVal_705 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~1#1.base| v_ArrVal_705) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0))) is different from false [2024-11-09 07:57:08,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1191942200] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:08,958 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:57:08,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 33 [2024-11-09 07:57:08,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [716686866] [2024-11-09 07:57:08,958 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:08,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 07:57:08,959 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:08,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 07:57:08,960 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=85, Invalid=1162, Unknown=21, NotChecked=138, Total=1406 [2024-11-09 07:57:08,960 INFO L87 Difference]: Start difference. First operand 99 states and 113 transitions. Second operand has 33 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 27 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:57:09,407 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~shared~0#1.base|)) (.cse2 (= (select .cse0 0) 0))) (and (= (select .cse0 |c_ULTIMATE.start_main_~shared~0#1.offset|) 0) (= (select .cse1 0) 0) (= (select .cse1 |c_ULTIMATE.start_main_~shared~0#1.offset|) 0) (or .cse2 (exists ((|v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#0.offset|))) (and (= |c_#memory_$Pointer$#0.offset| (store |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| .cse3 (select |c_#memory_$Pointer$#0.offset| .cse3))) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse3) (= (select (select |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0))))) .cse2 (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| |c_ULTIMATE.start_main_~shared~0#1.base|))))) is different from false [2024-11-09 07:57:09,410 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_main_~shared~0#1.base|))) (let ((.cse1 (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_main_~shared~0#1.base|)) (.cse2 (= (select .cse0 0) 0))) (and (= (select .cse0 |c_ULTIMATE.start_main_~shared~0#1.offset|) 0) (= (select .cse1 0) 0) (= (select .cse1 |c_ULTIMATE.start_main_~shared~0#1.offset|) 0) (or .cse2 (exists ((|v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| (Array Int (Array Int Int)))) (let ((.cse3 (@diff |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| |c_#memory_$Pointer$#0.offset|))) (and (= |c_#memory_$Pointer$#0.offset| (store |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| .cse3 (select |c_#memory_$Pointer$#0.offset| .cse3))) (= |c_ULTIMATE.start_create_#t~ret9#1.base| .cse3) (= (select (select |v_#memory_$Pointer$#0.offset_BEFORE_CALL_2| |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0))))) .cse2 (not (= |c_ULTIMATE.start_create_#t~ret9#1.base| |c_ULTIMATE.start_main_~shared~0#1.base|))))) is different from true [2024-11-09 07:57:09,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:09,939 INFO L93 Difference]: Finished difference Result 104 states and 120 transitions. [2024-11-09 07:57:09,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 07:57:09,940 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 27 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 34 [2024-11-09 07:57:09,940 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:09,941 INFO L225 Difference]: With dead ends: 104 [2024-11-09 07:57:09,941 INFO L226 Difference]: Without dead ends: 104 [2024-11-09 07:57:09,942 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 122 ImplicationChecksByTransitivity, 5.3s TimeCoverageRelationStatistics Valid=147, Invalid=2002, Unknown=25, NotChecked=276, Total=2450 [2024-11-09 07:57:09,942 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 18 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 997 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 1133 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 997 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 128 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:09,942 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1091 Invalid, 1133 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 997 Invalid, 0 Unknown, 128 Unchecked, 0.6s Time] [2024-11-09 07:57:09,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-09 07:57:09,945 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 102. [2024-11-09 07:57:09,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 78 states have (on average 1.3333333333333333) internal successors, (104), 93 states have internal predecessors, (104), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:57:09,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 116 transitions. [2024-11-09 07:57:09,946 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 116 transitions. Word has length 34 [2024-11-09 07:57:09,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:09,947 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 116 transitions. [2024-11-09 07:57:09,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 31 states have (on average 1.6129032258064515) internal successors, (50), 27 states have internal predecessors, (50), 3 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:57:09,947 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 116 transitions. [2024-11-09 07:57:09,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:57:09,947 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:09,947 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:09,965 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-11-09 07:57:10,151 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:10,152 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:57:10,152 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:10,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1570038634, now seen corresponding path program 1 times [2024-11-09 07:57:10,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:10,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86358570] [2024-11-09 07:57:10,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:10,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:10,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:10,346 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:10,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:10,350 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 07:57:10,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:10,356 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 07:57:10,360 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:10,415 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:10,415 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:10,416 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86358570] [2024-11-09 07:57:10,416 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86358570] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:10,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:10,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:57:10,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863568] [2024-11-09 07:57:10,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:10,416 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:57:10,416 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:10,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:57:10,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:57:10,417 INFO L87 Difference]: Start difference. First operand 102 states and 116 transitions. Second operand has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:57:10,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:10,541 INFO L93 Difference]: Finished difference Result 101 states and 114 transitions. [2024-11-09 07:57:10,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:57:10,541 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-11-09 07:57:10,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:10,542 INFO L225 Difference]: With dead ends: 101 [2024-11-09 07:57:10,542 INFO L226 Difference]: Without dead ends: 101 [2024-11-09 07:57:10,542 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:57:10,543 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 4 mSDsluCounter, 279 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:10,543 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 342 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 159 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:10,565 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-09 07:57:10,568 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-09 07:57:10,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 78 states have (on average 1.3076923076923077) internal successors, (102), 92 states have internal predecessors, (102), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:57:10,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 114 transitions. [2024-11-09 07:57:10,571 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 114 transitions. Word has length 35 [2024-11-09 07:57:10,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:10,571 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 114 transitions. [2024-11-09 07:57:10,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.142857142857143) internal successors, (29), 6 states have internal predecessors, (29), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:57:10,572 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 114 transitions. [2024-11-09 07:57:10,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-11-09 07:57:10,572 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:10,572 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:10,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-11-09 07:57:10,572 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:57:10,573 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:10,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1570038635, now seen corresponding path program 1 times [2024-11-09 07:57:10,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:10,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [421514703] [2024-11-09 07:57:10,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:10,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:10,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:10,658 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:10,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:10,662 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 07:57:10,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:10,667 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 07:57:10,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:10,694 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:57:10,694 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:10,694 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [421514703] [2024-11-09 07:57:10,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [421514703] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:10,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:10,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:57:10,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845861359] [2024-11-09 07:57:10,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:10,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:57:10,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:10,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:57:10,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:57:10,695 INFO L87 Difference]: Start difference. First operand 101 states and 114 transitions. Second operand has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:57:10,810 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:10,810 INFO L93 Difference]: Finished difference Result 100 states and 112 transitions. [2024-11-09 07:57:10,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:57:10,810 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) Word has length 35 [2024-11-09 07:57:10,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:10,811 INFO L225 Difference]: With dead ends: 100 [2024-11-09 07:57:10,811 INFO L226 Difference]: Without dead ends: 100 [2024-11-09 07:57:10,811 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:57:10,812 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 3 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:10,812 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 316 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 179 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:10,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-09 07:57:10,814 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-09 07:57:10,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 78 states have (on average 1.2820512820512822) internal successors, (100), 91 states have internal predecessors, (100), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:57:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 112 transitions. [2024-11-09 07:57:10,815 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 112 transitions. Word has length 35 [2024-11-09 07:57:10,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:10,815 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 112 transitions. [2024-11-09 07:57:10,815 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.0) internal successors, (28), 6 states have internal predecessors, (28), 1 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 2 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:57:10,816 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 112 transitions. [2024-11-09 07:57:10,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:57:10,816 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:10,816 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:10,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 07:57:10,816 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:57:10,817 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:10,817 INFO L85 PathProgramCache]: Analyzing trace with hash 407508154, now seen corresponding path program 1 times [2024-11-09 07:57:10,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:10,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1150192286] [2024-11-09 07:57:10,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:10,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:10,827 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:11,054 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:11,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:11,092 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 07:57:11,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:11,179 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-09 07:57:11,180 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:11,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1150192286] [2024-11-09 07:57:11,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1150192286] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:11,180 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1265044782] [2024-11-09 07:57:11,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:11,180 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:11,180 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:11,182 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:57:11,184 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 07:57:11,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:11,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 41 conjuncts are in the unsatisfiable core [2024-11-09 07:57:11,314 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:11,330 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-09 07:57:11,399 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:57:11,400 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 11 treesize of output 11 [2024-11-09 07:57:11,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:57:11,483 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-09 07:57:11,483 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:11,562 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:11,563 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 17 treesize of output 21 [2024-11-09 07:57:11,767 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-09 07:57:11,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1265044782] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:57:11,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:57:11,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 28 [2024-11-09 07:57:11,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1374522654] [2024-11-09 07:57:11,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:11,768 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-09 07:57:11,768 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:11,768 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-09 07:57:11,769 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=744, Unknown=0, NotChecked=0, Total=812 [2024-11-09 07:57:11,769 INFO L87 Difference]: Start difference. First operand 100 states and 112 transitions. Second operand has 29 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 22 states have internal predecessors, (51), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 07:57:12,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:12,517 INFO L93 Difference]: Finished difference Result 127 states and 146 transitions. [2024-11-09 07:57:12,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 07:57:12,518 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 22 states have internal predecessors, (51), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 36 [2024-11-09 07:57:12,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:12,519 INFO L225 Difference]: With dead ends: 127 [2024-11-09 07:57:12,519 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 07:57:12,520 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 123 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=112, Invalid=1294, Unknown=0, NotChecked=0, Total=1406 [2024-11-09 07:57:12,520 INFO L432 NwaCegarLoop]: 34 mSDtfsCounter, 79 mSDsluCounter, 494 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 528 SdHoareTripleChecker+Invalid, 879 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:12,521 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 528 Invalid, 879 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:57:12,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 07:57:12,525 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 114. [2024-11-09 07:57:12,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 93 states have (on average 1.2903225806451613) internal successors, (120), 105 states have internal predecessors, (120), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:57:12,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 132 transitions. [2024-11-09 07:57:12,526 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 132 transitions. Word has length 36 [2024-11-09 07:57:12,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:12,526 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 132 transitions. [2024-11-09 07:57:12,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 26 states have (on average 1.9615384615384615) internal successors, (51), 22 states have internal predecessors, (51), 3 states have call successors, (5), 4 states have call predecessors, (5), 4 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2024-11-09 07:57:12,529 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 132 transitions. [2024-11-09 07:57:12,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2024-11-09 07:57:12,530 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:12,530 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:12,549 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 07:57:12,734 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:12,735 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:57:12,735 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:12,735 INFO L85 PathProgramCache]: Analyzing trace with hash 407508155, now seen corresponding path program 1 times [2024-11-09 07:57:12,735 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:12,735 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1940103785] [2024-11-09 07:57:12,735 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:12,735 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:12,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:12,878 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:12,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:12,883 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 07:57:12,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:12,940 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:12,940 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:12,940 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1940103785] [2024-11-09 07:57:12,940 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1940103785] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:12,940 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:12,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:57:12,940 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613401555] [2024-11-09 07:57:12,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:12,941 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:57:12,941 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:12,941 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:57:12,941 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:57:12,942 INFO L87 Difference]: Start difference. First operand 114 states and 132 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:57:13,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:13,124 INFO L93 Difference]: Finished difference Result 141 states and 166 transitions. [2024-11-09 07:57:13,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:57:13,125 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 36 [2024-11-09 07:57:13,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:13,126 INFO L225 Difference]: With dead ends: 141 [2024-11-09 07:57:13,126 INFO L226 Difference]: Without dead ends: 141 [2024-11-09 07:57:13,126 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:57:13,127 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 7 mSDsluCounter, 334 mSDsCounter, 0 mSdLazyCounter, 283 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 394 SdHoareTripleChecker+Invalid, 287 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 283 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:13,127 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 394 Invalid, 287 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:57:13,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2024-11-09 07:57:13,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2024-11-09 07:57:13,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 116 states have (on average 1.3275862068965518) internal successors, (154), 128 states have internal predecessors, (154), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:57:13,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 166 transitions. [2024-11-09 07:57:13,134 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 166 transitions. Word has length 36 [2024-11-09 07:57:13,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:13,134 INFO L471 AbstractCegarLoop]: Abstraction has 137 states and 166 transitions. [2024-11-09 07:57:13,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 8 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:57:13,135 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 166 transitions. [2024-11-09 07:57:13,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-09 07:57:13,135 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:13,135 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:13,135 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2024-11-09 07:57:13,135 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:57:13,136 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:13,136 INFO L85 PathProgramCache]: Analyzing trace with hash -252150541, now seen corresponding path program 1 times [2024-11-09 07:57:13,136 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:13,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1345224864] [2024-11-09 07:57:13,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:13,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:13,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:13,237 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:13,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:13,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 07:57:13,245 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:13,269 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:13,269 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:13,269 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1345224864] [2024-11-09 07:57:13,269 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1345224864] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:13,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:13,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-09 07:57:13,269 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387461235] [2024-11-09 07:57:13,269 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:13,270 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:57:13,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:13,270 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:57:13,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:57:13,270 INFO L87 Difference]: Start difference. First operand 137 states and 166 transitions. Second operand has 10 states, 10 states have (on average 3.3) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:57:13,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:13,380 INFO L93 Difference]: Finished difference Result 144 states and 173 transitions. [2024-11-09 07:57:13,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:57:13,380 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2024-11-09 07:57:13,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:13,381 INFO L225 Difference]: With dead ends: 144 [2024-11-09 07:57:13,381 INFO L226 Difference]: Without dead ends: 144 [2024-11-09 07:57:13,382 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:57:13,382 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 22 mSDsluCounter, 409 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 468 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:13,382 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 468 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:13,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-09 07:57:13,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2024-11-09 07:57:13,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 117 states have (on average 1.2991452991452992) internal successors, (152), 129 states have internal predecessors, (152), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:57:13,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 164 transitions. [2024-11-09 07:57:13,386 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 164 transitions. Word has length 37 [2024-11-09 07:57:13,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:13,386 INFO L471 AbstractCegarLoop]: Abstraction has 138 states and 164 transitions. [2024-11-09 07:57:13,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 3.3) internal successors, (33), 8 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:57:13,386 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 164 transitions. [2024-11-09 07:57:13,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2024-11-09 07:57:13,387 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:13,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:13,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2024-11-09 07:57:13,387 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:57:13,387 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:13,387 INFO L85 PathProgramCache]: Analyzing trace with hash -1797049481, now seen corresponding path program 1 times [2024-11-09 07:57:13,387 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:13,387 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1479252339] [2024-11-09 07:57:13,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:13,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:13,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:13,479 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:13,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:13,484 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 07:57:13,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:13,516 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:13,516 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:13,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1479252339] [2024-11-09 07:57:13,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1479252339] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:57:13,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:57:13,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-11-09 07:57:13,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623194305] [2024-11-09 07:57:13,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:57:13,517 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:57:13,517 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:13,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:57:13,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:57:13,517 INFO L87 Difference]: Start difference. First operand 138 states and 164 transitions. Second operand has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:57:13,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:13,649 INFO L93 Difference]: Finished difference Result 143 states and 171 transitions. [2024-11-09 07:57:13,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:57:13,649 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 39 [2024-11-09 07:57:13,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:13,650 INFO L225 Difference]: With dead ends: 143 [2024-11-09 07:57:13,650 INFO L226 Difference]: Without dead ends: 143 [2024-11-09 07:57:13,650 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=73, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:57:13,651 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 18 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:13,651 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 426 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 206 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:13,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-09 07:57:13,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 142. [2024-11-09 07:57:13,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 121 states have (on average 1.3140495867768596) internal successors, (159), 133 states have internal predecessors, (159), 6 states have call successors, (6), 2 states have call predecessors, (6), 2 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-09 07:57:13,654 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 171 transitions. [2024-11-09 07:57:13,655 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 171 transitions. Word has length 39 [2024-11-09 07:57:13,655 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:13,655 INFO L471 AbstractCegarLoop]: Abstraction has 142 states and 171 transitions. [2024-11-09 07:57:13,655 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.888888888888889) internal successors, (35), 8 states have internal predecessors, (35), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:57:13,655 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 171 transitions. [2024-11-09 07:57:13,655 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2024-11-09 07:57:13,655 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:13,655 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:13,656 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2024-11-09 07:57:13,656 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:57:13,656 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:13,656 INFO L85 PathProgramCache]: Analyzing trace with hash -884584836, now seen corresponding path program 1 times [2024-11-09 07:57:13,656 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:13,656 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159781784] [2024-11-09 07:57:13,656 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:13,656 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:13,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:13,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:13,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:13,952 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 07:57:13,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:13,959 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 07:57:13,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:14,044 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:14,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:14,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159781784] [2024-11-09 07:57:14,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159781784] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:14,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653035778] [2024-11-09 07:57:14,044 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:14,044 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:14,045 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:14,046 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:57:14,048 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-09 07:57:14,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:14,176 INFO L255 TraceCheckSpWp]: Trace formula consists of 242 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-09 07:57:14,179 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:14,185 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-09 07:57:14,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:57:14,358 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-11-09 07:57:14,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:57:14,384 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:57:14,392 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:57:14,393 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 11 treesize of output 11 [2024-11-09 07:57:14,532 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-09 07:57:14,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:57:14,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:57:14,564 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:57:14,564 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 11 treesize of output 11 [2024-11-09 07:57:14,587 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-09 07:57:14,588 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:14,711 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653035778] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:14,711 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:57:14,711 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 25 [2024-11-09 07:57:14,712 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [520276126] [2024-11-09 07:57:14,712 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:14,712 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-09 07:57:14,712 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:14,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-09 07:57:14,713 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=634, Unknown=2, NotChecked=102, Total=812 [2024-11-09 07:57:14,713 INFO L87 Difference]: Start difference. First operand 142 states and 171 transitions. Second operand has 26 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 21 states have internal predecessors, (58), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 07:57:15,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:15,166 INFO L93 Difference]: Finished difference Result 164 states and 199 transitions. [2024-11-09 07:57:15,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:57:15,167 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 21 states have internal predecessors, (58), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) Word has length 40 [2024-11-09 07:57:15,167 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:15,168 INFO L225 Difference]: With dead ends: 164 [2024-11-09 07:57:15,168 INFO L226 Difference]: Without dead ends: 164 [2024-11-09 07:57:15,168 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=108, Invalid=954, Unknown=2, NotChecked=126, Total=1190 [2024-11-09 07:57:15,169 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 17 mSDsluCounter, 502 mSDsCounter, 0 mSdLazyCounter, 464 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 679 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 464 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 199 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:15,169 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 554 Invalid, 679 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 464 Invalid, 0 Unknown, 199 Unchecked, 0.3s Time] [2024-11-09 07:57:15,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2024-11-09 07:57:15,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 162. [2024-11-09 07:57:15,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 139 states have (on average 1.2877697841726619) internal successors, (179), 151 states have internal predecessors, (179), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:57:15,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 195 transitions. [2024-11-09 07:57:15,174 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 195 transitions. Word has length 40 [2024-11-09 07:57:15,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:15,174 INFO L471 AbstractCegarLoop]: Abstraction has 162 states and 195 transitions. [2024-11-09 07:57:15,174 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 23 states have (on average 2.5217391304347827) internal successors, (58), 21 states have internal predecessors, (58), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 5 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 07:57:15,174 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 195 transitions. [2024-11-09 07:57:15,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-09 07:57:15,175 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:15,175 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:15,193 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-09 07:57:15,379 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-09 07:57:15,380 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:57:15,380 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:15,380 INFO L85 PathProgramCache]: Analyzing trace with hash 866401823, now seen corresponding path program 1 times [2024-11-09 07:57:15,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:15,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1085845911] [2024-11-09 07:57:15,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:15,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:15,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:15,938 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:15,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:15,942 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 07:57:15,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:16,050 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:16,050 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:16,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1085845911] [2024-11-09 07:57:16,051 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1085845911] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:16,051 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [378503349] [2024-11-09 07:57:16,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:16,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:16,051 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:16,053 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:57:16,054 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-09 07:57:16,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:16,199 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 51 conjuncts are in the unsatisfiable core [2024-11-09 07:57:16,202 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:16,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:57:16,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:57:16,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:57:16,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:57:16,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:57:16,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 07:57:16,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:57:16,343 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-09 07:57:16,478 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:16,478 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 15 [2024-11-09 07:57:16,491 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:16,492 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 15 [2024-11-09 07:57:16,562 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:16,562 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:17,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 13 [2024-11-09 07:57:17,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2024-11-09 07:57:17,355 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:17,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [378503349] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:57:17,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:57:17,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 30 [2024-11-09 07:57:17,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [738557059] [2024-11-09 07:57:17,355 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:17,356 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-09 07:57:17,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:17,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-09 07:57:17,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=798, Unknown=0, NotChecked=0, Total=870 [2024-11-09 07:57:17,357 INFO L87 Difference]: Start difference. First operand 162 states and 195 transitions. Second operand has 30 states, 30 states have (on average 2.3) internal successors, (69), 26 states have internal predecessors, (69), 1 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 07:57:17,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:17,876 INFO L93 Difference]: Finished difference Result 169 states and 198 transitions. [2024-11-09 07:57:17,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:57:17,877 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 30 states have (on average 2.3) internal successors, (69), 26 states have internal predecessors, (69), 1 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 42 [2024-11-09 07:57:17,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:17,878 INFO L225 Difference]: With dead ends: 169 [2024-11-09 07:57:17,878 INFO L226 Difference]: Without dead ends: 169 [2024-11-09 07:57:17,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 71 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 111 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=113, Invalid=1219, Unknown=0, NotChecked=0, Total=1332 [2024-11-09 07:57:17,879 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 24 mSDsluCounter, 898 mSDsCounter, 0 mSdLazyCounter, 556 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 956 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 556 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:17,879 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 956 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 556 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:57:17,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2024-11-09 07:57:17,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 165. [2024-11-09 07:57:17,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 142 states have (on average 1.2816901408450705) internal successors, (182), 154 states have internal predecessors, (182), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:57:17,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 198 transitions. [2024-11-09 07:57:17,883 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 198 transitions. Word has length 42 [2024-11-09 07:57:17,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:17,883 INFO L471 AbstractCegarLoop]: Abstraction has 165 states and 198 transitions. [2024-11-09 07:57:17,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 2.3) internal successors, (69), 26 states have internal predecessors, (69), 1 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-09 07:57:17,884 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 198 transitions. [2024-11-09 07:57:17,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2024-11-09 07:57:17,884 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:17,884 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:17,901 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2024-11-09 07:57:18,088 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-09 07:57:18,089 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:57:18,089 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:18,089 INFO L85 PathProgramCache]: Analyzing trace with hash 1088651310, now seen corresponding path program 1 times [2024-11-09 07:57:18,089 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:18,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067944771] [2024-11-09 07:57:18,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:18,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:18,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:18,455 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:18,547 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 07:57:18,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:18,657 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:18,658 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:18,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067944771] [2024-11-09 07:57:18,658 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1067944771] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:18,658 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1964402488] [2024-11-09 07:57:18,658 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:18,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:18,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:18,661 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:57:18,662 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-09 07:57:18,795 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:18,796 INFO L255 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-09 07:57:18,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:19,490 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:19,490 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:19,827 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1964402488] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:19,827 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:57:19,827 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19] total 33 [2024-11-09 07:57:19,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1287680596] [2024-11-09 07:57:19,827 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:19,828 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-11-09 07:57:19,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:19,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-11-09 07:57:19,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1529, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 07:57:19,829 INFO L87 Difference]: Start difference. First operand 165 states and 198 transitions. Second operand has 34 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 28 states have internal predecessors, (73), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:57:20,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:20,381 INFO L93 Difference]: Finished difference Result 176 states and 209 transitions. [2024-11-09 07:57:20,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2024-11-09 07:57:20,382 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 28 states have internal predecessors, (73), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2024-11-09 07:57:20,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:20,383 INFO L225 Difference]: With dead ends: 176 [2024-11-09 07:57:20,383 INFO L226 Difference]: Without dead ends: 157 [2024-11-09 07:57:20,383 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=111, Invalid=1529, Unknown=0, NotChecked=0, Total=1640 [2024-11-09 07:57:20,383 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 4 mSDsluCounter, 735 mSDsCounter, 0 mSdLazyCounter, 1137 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 780 SdHoareTripleChecker+Invalid, 1143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 1137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:20,383 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 780 Invalid, 1143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 1137 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:57:20,384 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2024-11-09 07:57:20,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 156. [2024-11-09 07:57:20,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 133 states have (on average 1.2932330827067668) internal successors, (172), 145 states have internal predecessors, (172), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 8 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:57:20,387 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 188 transitions. [2024-11-09 07:57:20,387 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 188 transitions. Word has length 43 [2024-11-09 07:57:20,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:20,388 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 188 transitions. [2024-11-09 07:57:20,388 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 31 states have (on average 2.3548387096774195) internal successors, (73), 28 states have internal predecessors, (73), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:57:20,388 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 188 transitions. [2024-11-09 07:57:20,388 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2024-11-09 07:57:20,389 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:20,389 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:20,402 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-11-09 07:57:20,589 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-09 07:57:20,589 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:57:20,590 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:20,590 INFO L85 PathProgramCache]: Analyzing trace with hash 757015256, now seen corresponding path program 1 times [2024-11-09 07:57:20,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:20,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391271803] [2024-11-09 07:57:20,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:20,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:20,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:20,918 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:20,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:20,984 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 07:57:20,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:21,049 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 07:57:21,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:21,117 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:21,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:21,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [391271803] [2024-11-09 07:57:21,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [391271803] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:21,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [187934188] [2024-11-09 07:57:21,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:21,118 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:21,118 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:21,120 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:57:21,133 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-09 07:57:21,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:21,269 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-11-09 07:57:21,271 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:21,276 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-09 07:57:21,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:57:21,551 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:57:21,551 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 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 07:57:21,571 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 07:57:21,572 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 07:57:21,742 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:57:21,742 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 07:57:21,762 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-09 07:57:21,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-09 07:57:21,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 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-09 07:57:21,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2024-11-09 07:57:21,929 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:21,929 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:22,093 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [187934188] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:22,093 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:57:22,093 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 18] total 32 [2024-11-09 07:57:22,093 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825147908] [2024-11-09 07:57:22,094 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:22,094 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 33 states [2024-11-09 07:57:22,094 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:22,094 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 33 interpolants. [2024-11-09 07:57:22,095 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=1147, Unknown=0, NotChecked=0, Total=1260 [2024-11-09 07:57:22,095 INFO L87 Difference]: Start difference. First operand 156 states and 188 transitions. Second operand has 33 states, 30 states have (on average 2.4) internal successors, (72), 27 states have internal predecessors, (72), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 07:57:22,763 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:22,763 INFO L93 Difference]: Finished difference Result 192 states and 228 transitions. [2024-11-09 07:57:22,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 07:57:22,764 INFO L78 Accepts]: Start accepts. Automaton has has 33 states, 30 states have (on average 2.4) internal successors, (72), 27 states have internal predecessors, (72), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 44 [2024-11-09 07:57:22,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:22,765 INFO L225 Difference]: With dead ends: 192 [2024-11-09 07:57:22,765 INFO L226 Difference]: Without dead ends: 192 [2024-11-09 07:57:22,766 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 361 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=206, Invalid=2050, Unknown=0, NotChecked=0, Total=2256 [2024-11-09 07:57:22,766 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 62 mSDsluCounter, 517 mSDsCounter, 0 mSdLazyCounter, 750 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 750 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:22,767 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 562 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 750 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:57:22,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-09 07:57:22,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 188. [2024-11-09 07:57:22,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 188 states, 163 states have (on average 1.2760736196319018) internal successors, (208), 175 states have internal predecessors, (208), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 07:57:22,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 228 transitions. [2024-11-09 07:57:22,771 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 228 transitions. Word has length 44 [2024-11-09 07:57:22,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:22,771 INFO L471 AbstractCegarLoop]: Abstraction has 188 states and 228 transitions. [2024-11-09 07:57:22,771 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 33 states, 30 states have (on average 2.4) internal successors, (72), 27 states have internal predecessors, (72), 5 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 07:57:22,771 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 228 transitions. [2024-11-09 07:57:22,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 07:57:22,772 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:22,772 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:22,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-11-09 07:57:22,972 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-11-09 07:57:22,973 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:57:22,973 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:22,973 INFO L85 PathProgramCache]: Analyzing trace with hash -1244265856, now seen corresponding path program 1 times [2024-11-09 07:57:22,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:22,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [451208358] [2024-11-09 07:57:22,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:22,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:22,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:23,450 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:23,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:23,491 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 07:57:23,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:23,570 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 07:57:23,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:23,765 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:23,765 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:23,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [451208358] [2024-11-09 07:57:23,765 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [451208358] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:23,765 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [270312823] [2024-11-09 07:57:23,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:23,765 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:23,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:23,767 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:57:23,767 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-09 07:57:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:23,908 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-09 07:57:23,910 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:23,914 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-09 07:57:24,106 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 07:57:24,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 07:57:24,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:57:24,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:57:24,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-09 07:57:24,389 INFO L349 Elim1Store]: treesize reduction 52, result has 34.2 percent of original size [2024-11-09 07:57:24,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 28 treesize of output 36 [2024-11-09 07:57:24,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-09 07:57:24,552 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:24,552 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 25 treesize of output 21 [2024-11-09 07:57:24,731 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 12 [2024-11-09 07:57:24,734 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:24,734 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:24,911 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1445 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~1#1.base| v_ArrVal_1445) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) |c_ULTIMATE.start_main_~shared~0#1.base|))) (forall ((v_ArrVal_1445 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~1#1.base| v_ArrVal_1445) |c_ULTIMATE.start_main_~shared~0#1.base|) 0)) 1))) is different from false [2024-11-09 07:57:24,916 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1445 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~ret9#1.base| v_ArrVal_1445) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) |c_ULTIMATE.start_main_~shared~0#1.base|))) (forall ((v_ArrVal_1445 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~ret9#1.base| v_ArrVal_1445) |c_ULTIMATE.start_main_~shared~0#1.base|) 0)) 1))) is different from false [2024-11-09 07:57:25,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [270312823] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:25,020 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:57:25,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 23] total 43 [2024-11-09 07:57:25,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074997844] [2024-11-09 07:57:25,020 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:25,021 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2024-11-09 07:57:25,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:25,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2024-11-09 07:57:25,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=2218, Unknown=2, NotChecked=190, Total=2550 [2024-11-09 07:57:25,022 INFO L87 Difference]: Start difference. First operand 188 states and 228 transitions. Second operand has 44 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 35 states have internal predecessors, (74), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 07:57:26,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:26,023 INFO L93 Difference]: Finished difference Result 198 states and 242 transitions. [2024-11-09 07:57:26,023 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 07:57:26,023 INFO L78 Accepts]: Start accepts. Automaton has has 44 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 35 states have internal predecessors, (74), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 46 [2024-11-09 07:57:26,024 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:26,024 INFO L225 Difference]: With dead ends: 198 [2024-11-09 07:57:26,024 INFO L226 Difference]: Without dead ends: 198 [2024-11-09 07:57:26,026 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 39 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 715 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=244, Invalid=3668, Unknown=2, NotChecked=246, Total=4160 [2024-11-09 07:57:26,026 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 41 mSDsluCounter, 1110 mSDsCounter, 0 mSdLazyCounter, 1453 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 1178 SdHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1453 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:26,026 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [41 Valid, 1178 Invalid, 1474 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1453 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:57:26,027 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 198 states. [2024-11-09 07:57:26,030 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 198 to 192. [2024-11-09 07:57:26,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 167 states have (on average 1.281437125748503) internal successors, (214), 179 states have internal predecessors, (214), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 07:57:26,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 234 transitions. [2024-11-09 07:57:26,032 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 234 transitions. Word has length 46 [2024-11-09 07:57:26,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:26,032 INFO L471 AbstractCegarLoop]: Abstraction has 192 states and 234 transitions. [2024-11-09 07:57:26,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 44 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 35 states have internal predecessors, (74), 5 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 07:57:26,032 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 234 transitions. [2024-11-09 07:57:26,033 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2024-11-09 07:57:26,033 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:26,033 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:26,052 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-09 07:57:26,233 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-09 07:57:26,234 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:57:26,234 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:26,234 INFO L85 PathProgramCache]: Analyzing trace with hash -1244265855, now seen corresponding path program 1 times [2024-11-09 07:57:26,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:26,234 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104646972] [2024-11-09 07:57:26,234 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:26,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:26,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:26,724 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:26,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:26,728 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 07:57:26,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:26,821 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 07:57:26,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:27,073 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:27,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:27,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104646972] [2024-11-09 07:57:27,073 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104646972] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:27,073 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351637635] [2024-11-09 07:57:27,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:27,073 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:27,074 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:27,075 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:57:27,076 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-09 07:57:27,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:27,226 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-09 07:57:27,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:27,319 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:57:27,404 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-09 07:57:27,406 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:57:27,673 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:57:27,673 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 11 treesize of output 11 [2024-11-09 07:57:27,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 07:57:27,688 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2024-11-09 07:57:27,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2024-11-09 07:57:27,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:57:27,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:57:27,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 07:57:27,911 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:27,911 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2024-11-09 07:57:27,923 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:27,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2024-11-09 07:57:28,150 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:28,150 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:28,417 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1547 (Array Int Int))) (<= (+ (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~1#1.base| v_ArrVal_1548) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 8) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~1#1.base| v_ArrVal_1547) |c_ULTIMATE.start_main_~shared~0#1.base|) 0)))) (forall ((v_ArrVal_1548 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_~now~1#1.base| v_ArrVal_1548) |c_ULTIMATE.start_main_~shared~0#1.base|) 0)))) is different from false [2024-11-09 07:57:28,428 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1548 (Array Int Int))) (<= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~ret9#1.base| v_ArrVal_1548) |c_ULTIMATE.start_main_~shared~0#1.base|) 0))) (forall ((v_ArrVal_1548 (Array Int Int)) (v_ArrVal_1547 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~ret9#1.base| v_ArrVal_1548) |c_ULTIMATE.start_main_~shared~0#1.base|) 0)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~ret9#1.base| v_ArrVal_1547) |c_ULTIMATE.start_main_~shared~0#1.base|) 0))))) is different from false [2024-11-09 07:57:28,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351637635] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:28,591 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:57:28,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 42 [2024-11-09 07:57:28,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103218851] [2024-11-09 07:57:28,592 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:28,592 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-09 07:57:28,592 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:28,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-09 07:57:28,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2315, Unknown=2, NotChecked=194, Total=2652 [2024-11-09 07:57:28,594 INFO L87 Difference]: Start difference. First operand 192 states and 234 transitions. Second operand has 43 states, 40 states have (on average 1.95) internal successors, (78), 37 states have internal predecessors, (78), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 07:57:29,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:29,932 INFO L93 Difference]: Finished difference Result 196 states and 239 transitions. [2024-11-09 07:57:29,933 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2024-11-09 07:57:29,933 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 40 states have (on average 1.95) internal successors, (78), 37 states have internal predecessors, (78), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 46 [2024-11-09 07:57:29,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:29,934 INFO L225 Difference]: With dead ends: 196 [2024-11-09 07:57:29,934 INFO L226 Difference]: Without dead ends: 196 [2024-11-09 07:57:29,935 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 63 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 676 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=229, Invalid=3683, Unknown=2, NotChecked=246, Total=4160 [2024-11-09 07:57:29,936 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 24 mSDsluCounter, 1734 mSDsCounter, 0 mSdLazyCounter, 1738 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1807 SdHoareTripleChecker+Invalid, 1747 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1738 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:29,936 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1807 Invalid, 1747 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1738 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2024-11-09 07:57:29,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-09 07:57:29,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2024-11-09 07:57:29,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 169 states have (on average 1.272189349112426) internal successors, (215), 181 states have internal predecessors, (215), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 07:57:29,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 235 transitions. [2024-11-09 07:57:29,941 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 235 transitions. Word has length 46 [2024-11-09 07:57:29,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:29,941 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 235 transitions. [2024-11-09 07:57:29,941 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 40 states have (on average 1.95) internal successors, (78), 37 states have internal predecessors, (78), 5 states have call successors, (6), 2 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 07:57:29,941 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 235 transitions. [2024-11-09 07:57:29,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 07:57:29,942 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:29,942 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:29,959 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-11-09 07:57:30,142 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:30,143 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:57:30,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:30,143 INFO L85 PathProgramCache]: Analyzing trace with hash -407674692, now seen corresponding path program 1 times [2024-11-09 07:57:30,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:30,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1063265087] [2024-11-09 07:57:30,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:30,144 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:30,158 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:30,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:30,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:30,421 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 07:57:30,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:30,451 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 07:57:30,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:30,512 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 07:57:30,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:30,574 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-09 07:57:30,574 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:30,574 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1063265087] [2024-11-09 07:57:30,574 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1063265087] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:30,575 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1729850735] [2024-11-09 07:57:30,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:30,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:30,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:30,577 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:57:30,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-09 07:57:30,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:30,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 07:57:30,749 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:30,797 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:57:30,797 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 11 treesize of output 11 [2024-11-09 07:57:30,817 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:57:30,865 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:57:30,865 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-09 07:57:30,876 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 25 treesize of output 13 [2024-11-09 07:57:30,889 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_~pi~0.base (select |c_#valid| alloc_and_zero_~pi~0.base))))) is different from true [2024-11-09 07:57:30,916 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:57:30,916 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 07:57:30,918 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 5 not checked. [2024-11-09 07:57:30,918 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:30,957 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1729850735] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:30,957 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:57:30,958 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 11] total 22 [2024-11-09 07:57:30,958 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [281013701] [2024-11-09 07:57:30,958 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:30,958 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-09 07:57:30,958 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:30,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-09 07:57:30,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=449, Unknown=1, NotChecked=42, Total=552 [2024-11-09 07:57:30,959 INFO L87 Difference]: Start difference. First operand 194 states and 235 transitions. Second operand has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 18 states have internal predecessors, (62), 2 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 07:57:31,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:31,195 INFO L93 Difference]: Finished difference Result 193 states and 233 transitions. [2024-11-09 07:57:31,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-09 07:57:31,195 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 18 states have internal predecessors, (62), 2 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) Word has length 48 [2024-11-09 07:57:31,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:31,196 INFO L225 Difference]: With dead ends: 193 [2024-11-09 07:57:31,196 INFO L226 Difference]: Without dead ends: 193 [2024-11-09 07:57:31,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=96, Invalid=663, Unknown=1, NotChecked=52, Total=812 [2024-11-09 07:57:31,197 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 11 mSDsluCounter, 559 mSDsCounter, 0 mSdLazyCounter, 420 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 490 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 420 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 66 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:31,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 613 Invalid, 490 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 420 Invalid, 0 Unknown, 66 Unchecked, 0.2s Time] [2024-11-09 07:57:31,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-09 07:57:31,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 193. [2024-11-09 07:57:31,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 169 states have (on average 1.2603550295857988) internal successors, (213), 180 states have internal predecessors, (213), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 07:57:31,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 233 transitions. [2024-11-09 07:57:31,205 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 233 transitions. Word has length 48 [2024-11-09 07:57:31,205 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:31,205 INFO L471 AbstractCegarLoop]: Abstraction has 193 states and 233 transitions. [2024-11-09 07:57:31,206 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 18 states have internal predecessors, (62), 2 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (7), 5 states have call predecessors, (7), 2 states have call successors, (7) [2024-11-09 07:57:31,206 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 233 transitions. [2024-11-09 07:57:31,206 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2024-11-09 07:57:31,206 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:31,207 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:31,220 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-09 07:57:31,408 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:31,408 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:57:31,409 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:31,409 INFO L85 PathProgramCache]: Analyzing trace with hash -407674691, now seen corresponding path program 1 times [2024-11-09 07:57:31,409 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:31,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1388454306] [2024-11-09 07:57:31,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:31,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:31,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:31,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:31,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:31,818 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 07:57:31,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:31,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 07:57:31,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:31,945 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2024-11-09 07:57:31,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:32,024 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 07:57:32,024 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:32,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1388454306] [2024-11-09 07:57:32,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1388454306] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:32,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [410832990] [2024-11-09 07:57:32,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:32,025 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:32,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:32,027 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:57:32,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-09 07:57:32,208 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:32,210 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 48 conjuncts are in the unsatisfiable core [2024-11-09 07:57:32,213 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:32,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:57:32,340 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:57:32,341 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 11 treesize of output 11 [2024-11-09 07:57:32,372 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:57:32,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:57:32,455 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:57:32,456 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 52 [2024-11-09 07:57:32,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-09 07:57:32,503 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 34 treesize of output 18 [2024-11-09 07:57:32,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2024-11-09 07:57:32,626 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_~pi~0.base Int)) (and (= (select |c_old(#valid)| alloc_and_zero_~pi~0.base) 0) (= (store |c_old(#length)| alloc_and_zero_~pi~0.base (select |c_#length| alloc_and_zero_~pi~0.base)) |c_#length|))) is different from true [2024-11-09 07:57:32,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:57:32,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:57:32,656 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:57:32,657 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 11 treesize of output 11 [2024-11-09 07:57:32,685 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 16 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-09 07:57:32,685 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:32,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [410832990] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:32,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:57:32,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 14] total 31 [2024-11-09 07:57:32,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1169824225] [2024-11-09 07:57:32,800 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:32,801 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-09 07:57:32,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:32,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-09 07:57:32,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=98, Invalid=961, Unknown=1, NotChecked=62, Total=1122 [2024-11-09 07:57:32,802 INFO L87 Difference]: Start difference. First operand 193 states and 233 transitions. Second operand has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 24 states have internal predecessors, (70), 5 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-09 07:57:33,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:33,356 INFO L93 Difference]: Finished difference Result 190 states and 227 transitions. [2024-11-09 07:57:33,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:57:33,356 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 24 states have internal predecessors, (70), 5 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) Word has length 48 [2024-11-09 07:57:33,356 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:33,357 INFO L225 Difference]: With dead ends: 190 [2024-11-09 07:57:33,357 INFO L226 Difference]: Without dead ends: 190 [2024-11-09 07:57:33,358 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 41 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 296 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=211, Invalid=1684, Unknown=1, NotChecked=84, Total=1980 [2024-11-09 07:57:33,358 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 25 mSDsluCounter, 903 mSDsCounter, 0 mSdLazyCounter, 721 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 962 SdHoareTripleChecker+Invalid, 807 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 721 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:33,358 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 962 Invalid, 807 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 721 Invalid, 0 Unknown, 76 Unchecked, 0.3s Time] [2024-11-09 07:57:33,359 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-11-09 07:57:33,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 190. [2024-11-09 07:57:33,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 169 states have (on average 1.2248520710059172) internal successors, (207), 177 states have internal predecessors, (207), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 07:57:33,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 227 transitions. [2024-11-09 07:57:33,362 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 227 transitions. Word has length 48 [2024-11-09 07:57:33,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:33,363 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 227 transitions. [2024-11-09 07:57:33,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.2580645161290325) internal successors, (70), 24 states have internal predecessors, (70), 5 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (7), 6 states have call predecessors, (7), 5 states have call successors, (7) [2024-11-09 07:57:33,363 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 227 transitions. [2024-11-09 07:57:33,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-09 07:57:33,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:33,364 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:33,383 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-11-09 07:57:33,564 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:33,565 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:57:33,565 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:33,565 INFO L85 PathProgramCache]: Analyzing trace with hash 1938673338, now seen corresponding path program 1 times [2024-11-09 07:57:33,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:33,565 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462784368] [2024-11-09 07:57:33,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:33,565 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:33,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:33,922 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:33,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:33,925 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 07:57:33,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:33,962 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 07:57:33,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:34,071 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:34,072 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:34,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462784368] [2024-11-09 07:57:34,072 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462784368] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:34,072 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [885787246] [2024-11-09 07:57:34,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:34,072 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:34,072 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:34,073 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:57:34,074 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-09 07:57:34,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:34,227 INFO L255 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-09 07:57:34,229 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:34,365 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-09 07:57:34,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 5 [2024-11-09 07:57:34,521 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:57:34,522 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 11 treesize of output 11 [2024-11-09 07:57:34,598 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 07:57:34,680 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:34,680 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 17 [2024-11-09 07:57:34,787 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:34,787 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:35,008 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1929 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~ret9#1.base| v_ArrVal_1929) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) |c_#StackHeapBarrier|)) is different from false [2024-11-09 07:57:35,033 WARN L851 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_create_#t~ret9#1.base_41| Int) (v_ArrVal_1929 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_create_#t~ret9#1.base_41| v_ArrVal_1929) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) |c_#StackHeapBarrier|) (not (= (select |c_#valid| |v_ULTIMATE.start_create_#t~ret9#1.base_41|) 0)))) is different from false [2024-11-09 07:57:35,034 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [885787246] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:35,035 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:57:35,035 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 23] total 35 [2024-11-09 07:57:35,035 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [721819125] [2024-11-09 07:57:35,035 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:35,035 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 07:57:35,036 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:35,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 07:57:35,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=1380, Unknown=14, NotChecked=150, Total=1640 [2024-11-09 07:57:35,037 INFO L87 Difference]: Start difference. First operand 190 states and 227 transitions. Second operand has 36 states, 33 states have (on average 2.121212121212121) internal successors, (70), 29 states have internal predecessors, (70), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 07:57:35,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:35,929 INFO L93 Difference]: Finished difference Result 193 states and 232 transitions. [2024-11-09 07:57:35,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 07:57:35,930 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 33 states have (on average 2.121212121212121) internal successors, (70), 29 states have internal predecessors, (70), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 49 [2024-11-09 07:57:35,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:35,931 INFO L225 Difference]: With dead ends: 193 [2024-11-09 07:57:35,931 INFO L226 Difference]: Without dead ends: 193 [2024-11-09 07:57:35,932 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 105 GetRequests, 45 SyntacticMatches, 6 SemanticMatches, 54 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=184, Invalid=2672, Unknown=14, NotChecked=210, Total=3080 [2024-11-09 07:57:35,932 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 21 mSDsluCounter, 1371 mSDsCounter, 0 mSdLazyCounter, 1251 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 1439 SdHoareTripleChecker+Invalid, 1258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1251 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:35,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 1439 Invalid, 1258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1251 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:57:35,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 193 states. [2024-11-09 07:57:35,936 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 193 to 191. [2024-11-09 07:57:35,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 191 states, 170 states have (on average 1.223529411764706) internal successors, (208), 178 states have internal predecessors, (208), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 07:57:35,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 191 states to 191 states and 228 transitions. [2024-11-09 07:57:35,937 INFO L78 Accepts]: Start accepts. Automaton has 191 states and 228 transitions. Word has length 49 [2024-11-09 07:57:35,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:35,937 INFO L471 AbstractCegarLoop]: Abstraction has 191 states and 228 transitions. [2024-11-09 07:57:35,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 33 states have (on average 2.121212121212121) internal successors, (70), 29 states have internal predecessors, (70), 5 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 07:57:35,938 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 228 transitions. [2024-11-09 07:57:35,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2024-11-09 07:57:35,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:35,939 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:35,956 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-09 07:57:36,139 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:36,140 INFO L396 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:57:36,140 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:36,140 INFO L85 PathProgramCache]: Analyzing trace with hash 24977884, now seen corresponding path program 1 times [2024-11-09 07:57:36,141 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:36,141 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [914565505] [2024-11-09 07:57:36,141 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:36,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:36,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:37,029 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:37,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:37,148 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 07:57:37,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:37,457 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 07:57:37,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:37,683 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:37,683 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:37,683 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [914565505] [2024-11-09 07:57:37,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [914565505] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:37,684 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1504031604] [2024-11-09 07:57:37,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:37,684 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:37,684 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:37,686 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:57:37,687 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-09 07:57:37,855 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:37,857 INFO L255 TraceCheckSpWp]: Trace formula consists of 299 conjuncts, 90 conjuncts are in the unsatisfiable core [2024-11-09 07:57:37,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:37,864 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-09 07:57:37,892 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:57:37,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:57:38,295 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:57:38,295 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 16 treesize of output 15 [2024-11-09 07:57:38,319 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:57:38,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 07:57:38,326 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:57:38,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:57:38,431 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:57:38,548 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:57:38,549 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-09 07:57:38,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-09 07:57:38,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-09 07:57:38,778 INFO L349 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2024-11-09 07:57:38,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 52 [2024-11-09 07:57:38,786 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 11 [2024-11-09 07:57:38,794 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 8 [2024-11-09 07:57:38,887 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:38,887 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 15 [2024-11-09 07:57:38,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:38,893 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 15 [2024-11-09 07:57:39,006 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:39,006 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:39,133 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_2058 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2058) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0)) (forall ((v_ArrVal_2057 (Array Int Int))) (= 0 (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_create_#t~mem12#1.base| v_ArrVal_2057) |c_ULTIMATE.start_main_~shared~0#1.base|) 0)))) is different from false [2024-11-09 07:57:39,143 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_create_~now~1#1.base|) |c_ULTIMATE.start_create_~now~1#1.offset|))) (and (forall ((v_ArrVal_2057 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| .cse0 v_ArrVal_2057) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0)) (forall ((v_ArrVal_2058 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.base| .cse0 v_ArrVal_2058) |c_ULTIMATE.start_main_~shared~0#1.base|) 0) 0)))) is different from false [2024-11-09 07:57:43,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1504031604] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:43,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:57:43,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 27] total 46 [2024-11-09 07:57:43,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745293344] [2024-11-09 07:57:43,447 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:43,448 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-09 07:57:43,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:43,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-09 07:57:43,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=2285, Unknown=32, NotChecked=194, Total=2652 [2024-11-09 07:57:43,449 INFO L87 Difference]: Start difference. First operand 191 states and 228 transitions. Second operand has 46 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 38 states have internal predecessors, (78), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 07:57:44,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:44,738 INFO L93 Difference]: Finished difference Result 196 states and 234 transitions. [2024-11-09 07:57:44,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-09 07:57:44,739 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 38 states have internal predecessors, (78), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 50 [2024-11-09 07:57:44,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:44,740 INFO L225 Difference]: With dead ends: 196 [2024-11-09 07:57:44,740 INFO L226 Difference]: Without dead ends: 196 [2024-11-09 07:57:44,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 50 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 524 ImplicationChecksByTransitivity, 6.2s TimeCoverageRelationStatistics Valid=260, Invalid=3869, Unknown=39, NotChecked=254, Total=4422 [2024-11-09 07:57:44,742 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 38 mSDsluCounter, 1067 mSDsCounter, 0 mSdLazyCounter, 1288 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 1109 SdHoareTripleChecker+Invalid, 1311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:44,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 1109 Invalid, 1311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1288 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 07:57:44,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2024-11-09 07:57:44,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 194. [2024-11-09 07:57:44,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 173 states have (on average 1.2196531791907514) internal successors, (211), 181 states have internal predecessors, (211), 10 states have call successors, (10), 2 states have call predecessors, (10), 2 states have return successors, (10), 10 states have call predecessors, (10), 10 states have call successors, (10) [2024-11-09 07:57:44,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 231 transitions. [2024-11-09 07:57:44,748 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 231 transitions. Word has length 50 [2024-11-09 07:57:44,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:44,748 INFO L471 AbstractCegarLoop]: Abstraction has 194 states and 231 transitions. [2024-11-09 07:57:44,748 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 44 states have (on average 1.7727272727272727) internal successors, (78), 38 states have internal predecessors, (78), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 07:57:44,748 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 231 transitions. [2024-11-09 07:57:44,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 07:57:44,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:44,749 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:44,768 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Ended with exit code 0 [2024-11-09 07:57:44,950 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:44,950 INFO L396 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:57:44,950 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:44,950 INFO L85 PathProgramCache]: Analyzing trace with hash -395164942, now seen corresponding path program 2 times [2024-11-09 07:57:44,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:44,951 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1529726661] [2024-11-09 07:57:44,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:44,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:44,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:45,246 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:45,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:45,285 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 07:57:45,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:45,290 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 07:57:45,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:45,355 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 07:57:45,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:45,435 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 4 proven. 19 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 07:57:45,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:45,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1529726661] [2024-11-09 07:57:45,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1529726661] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:45,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374367538] [2024-11-09 07:57:45,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:57:45,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:45,437 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:45,439 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:57:45,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-09 07:57:45,618 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:57:45,618 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:57:45,620 INFO L255 TraceCheckSpWp]: Trace formula consists of 312 conjuncts, 72 conjuncts are in the unsatisfiable core [2024-11-09 07:57:45,624 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:45,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:57:45,632 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-09 07:57:45,822 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:57:45,822 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 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-09 07:57:45,833 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:57:45,833 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 11 treesize of output 11 [2024-11-09 07:57:45,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:57:45,918 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2024-11-09 07:57:46,007 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base (select |c_#length| alloc_and_zero_internal_~pi~1.base)) |c_#length|) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0))) is different from true [2024-11-09 07:57:46,024 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:57:46,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 14 [2024-11-09 07:57:46,034 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:57:46,034 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 11 treesize of output 11 [2024-11-09 07:57:46,198 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:57:46,198 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 1 case distinctions, treesize of input 21 treesize of output 18 [2024-11-09 07:57:46,412 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 2 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 8 not checked. [2024-11-09 07:57:46,412 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:46,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374367538] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:46,576 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:57:46,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 22] total 35 [2024-11-09 07:57:46,576 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1956899568] [2024-11-09 07:57:46,576 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:46,577 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2024-11-09 07:57:46,577 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:46,577 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2024-11-09 07:57:46,578 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=1285, Unknown=1, NotChecked=72, Total=1482 [2024-11-09 07:57:46,578 INFO L87 Difference]: Start difference. First operand 194 states and 231 transitions. Second operand has 36 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 29 states have internal predecessors, (83), 7 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-09 07:57:47,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:47,190 INFO L93 Difference]: Finished difference Result 247 states and 293 transitions. [2024-11-09 07:57:47,191 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-09 07:57:47,191 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 29 states have internal predecessors, (83), 7 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) Word has length 52 [2024-11-09 07:57:47,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:47,192 INFO L225 Difference]: With dead ends: 247 [2024-11-09 07:57:47,192 INFO L226 Difference]: Without dead ends: 247 [2024-11-09 07:57:47,193 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 44 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 422 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=159, Invalid=1824, Unknown=1, NotChecked=86, Total=2070 [2024-11-09 07:57:47,193 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 28 mSDsluCounter, 979 mSDsCounter, 0 mSdLazyCounter, 909 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 1038 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 909 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 113 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:47,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [28 Valid, 1048 Invalid, 1038 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 909 Invalid, 0 Unknown, 113 Unchecked, 0.5s Time] [2024-11-09 07:57:47,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-09 07:57:47,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 230. [2024-11-09 07:57:47,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 230 states, 206 states have (on average 1.1990291262135921) internal successors, (247), 214 states have internal predecessors, (247), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 07:57:47,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 230 states to 230 states and 273 transitions. [2024-11-09 07:57:47,202 INFO L78 Accepts]: Start accepts. Automaton has 230 states and 273 transitions. Word has length 52 [2024-11-09 07:57:47,202 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:47,202 INFO L471 AbstractCegarLoop]: Abstraction has 230 states and 273 transitions. [2024-11-09 07:57:47,202 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 34 states have (on average 2.4411764705882355) internal successors, (83), 29 states have internal predecessors, (83), 7 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (8), 8 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-09 07:57:47,202 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 273 transitions. [2024-11-09 07:57:47,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 07:57:47,203 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:47,203 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:47,217 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Forceful destruction successful, exit code 0 [2024-11-09 07:57:47,403 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:47,404 INFO L396 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:57:47,404 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:47,404 INFO L85 PathProgramCache]: Analyzing trace with hash -1766101875, now seen corresponding path program 1 times [2024-11-09 07:57:47,404 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:47,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648766393] [2024-11-09 07:57:47,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:47,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:47,568 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:47,569 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:47,571 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 13 [2024-11-09 07:57:47,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:47,599 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 24 [2024-11-09 07:57:47,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:47,606 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:57:47,606 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:47,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648766393] [2024-11-09 07:57:47,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648766393] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:47,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1829189775] [2024-11-09 07:57:47,606 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:47,606 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:47,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:47,607 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:57:47,608 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Waiting until timeout for monitored process [2024-11-09 07:57:47,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:47,789 INFO L255 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-11-09 07:57:47,791 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:47,909 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 07:57:47,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:47,965 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:47,966 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 19 treesize of output 23 [2024-11-09 07:57:48,025 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2024-11-09 07:57:48,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1829189775] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:57:48,026 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:57:48,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 6, 6] total 17 [2024-11-09 07:57:48,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131419157] [2024-11-09 07:57:48,026 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:48,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 07:57:48,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:48,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 07:57:48,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:57:48,027 INFO L87 Difference]: Start difference. First operand 230 states and 273 transitions. Second operand has 18 states, 17 states have (on average 4.588235294117647) internal successors, (78), 16 states have internal predecessors, (78), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 07:57:48,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:48,169 INFO L93 Difference]: Finished difference Result 247 states and 293 transitions. [2024-11-09 07:57:48,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:57:48,169 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 4.588235294117647) internal successors, (78), 16 states have internal predecessors, (78), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) Word has length 52 [2024-11-09 07:57:48,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:48,170 INFO L225 Difference]: With dead ends: 247 [2024-11-09 07:57:48,170 INFO L226 Difference]: Without dead ends: 247 [2024-11-09 07:57:48,170 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=261, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:57:48,171 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 21 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 530 SdHoareTripleChecker+Invalid, 308 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:48,171 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 530 Invalid, 308 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:57:48,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2024-11-09 07:57:48,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 241. [2024-11-09 07:57:48,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 217 states have (on average 1.2119815668202765) internal successors, (263), 225 states have internal predecessors, (263), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 07:57:48,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 289 transitions. [2024-11-09 07:57:48,176 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 289 transitions. Word has length 52 [2024-11-09 07:57:48,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:48,176 INFO L471 AbstractCegarLoop]: Abstraction has 241 states and 289 transitions. [2024-11-09 07:57:48,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 4.588235294117647) internal successors, (78), 16 states have internal predecessors, (78), 4 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (6), 5 states have call predecessors, (6), 4 states have call successors, (6) [2024-11-09 07:57:48,177 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 289 transitions. [2024-11-09 07:57:48,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-09 07:57:48,177 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:48,178 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:48,195 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (21)] Forceful destruction successful, exit code 0 [2024-11-09 07:57:48,378 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable34 [2024-11-09 07:57:48,378 INFO L396 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:57:48,378 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:48,379 INFO L85 PathProgramCache]: Analyzing trace with hash 592305861, now seen corresponding path program 2 times [2024-11-09 07:57:48,379 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:48,379 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1661429355] [2024-11-09 07:57:48,379 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:48,379 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:48,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:49,037 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:49,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:49,081 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 07:57:49,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:49,183 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 07:57:49,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:49,436 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 6 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:49,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:49,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1661429355] [2024-11-09 07:57:49,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1661429355] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:49,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865219845] [2024-11-09 07:57:49,437 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:57:49,437 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:49,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:49,439 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:57:49,441 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Waiting until timeout for monitored process [2024-11-09 07:57:49,645 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:57:49,645 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:57:49,648 INFO L255 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 102 conjuncts are in the unsatisfiable core [2024-11-09 07:57:49,651 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:49,654 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-09 07:57:49,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:57:49,793 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-09 07:57:49,905 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-09 07:57:49,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-09 07:57:49,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 07:57:49,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-09 07:57:50,358 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2024-11-09 07:57:50,359 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2024-11-09 07:57:50,529 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2024-11-09 07:57:50,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 42 [2024-11-09 07:57:50,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-09 07:57:51,116 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:57:51,117 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:57:51,133 INFO L349 Elim1Store]: treesize reduction 44, result has 21.4 percent of original size [2024-11-09 07:57:51,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 53 treesize of output 42 [2024-11-09 07:57:51,143 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:51,143 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 15 [2024-11-09 07:57:51,256 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-09 07:57:51,256 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:51,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865219845] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:51,908 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:57:51,908 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 30] total 49 [2024-11-09 07:57:51,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [498211414] [2024-11-09 07:57:51,908 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:51,908 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2024-11-09 07:57:51,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:51,909 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2024-11-09 07:57:51,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=3253, Unknown=3, NotChecked=0, Total=3422 [2024-11-09 07:57:51,910 INFO L87 Difference]: Start difference. First operand 241 states and 289 transitions. Second operand has 49 states, 47 states have (on average 1.702127659574468) internal successors, (80), 41 states have internal predecessors, (80), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:57:53,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:53,682 INFO L93 Difference]: Finished difference Result 244 states and 293 transitions. [2024-11-09 07:57:53,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-09 07:57:53,682 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 47 states have (on average 1.702127659574468) internal successors, (80), 41 states have internal predecessors, (80), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) Word has length 52 [2024-11-09 07:57:53,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:53,683 INFO L225 Difference]: With dead ends: 244 [2024-11-09 07:57:53,683 INFO L226 Difference]: Without dead ends: 244 [2024-11-09 07:57:53,684 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 47 SyntacticMatches, 1 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 889 ImplicationChecksByTransitivity, 2.7s TimeCoverageRelationStatistics Valid=259, Invalid=4850, Unknown=3, NotChecked=0, Total=5112 [2024-11-09 07:57:53,685 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 20 mSDsluCounter, 1664 mSDsCounter, 0 mSdLazyCounter, 1789 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 1731 SdHoareTripleChecker+Invalid, 1796 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1789 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:53,685 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 1731 Invalid, 1796 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1789 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-09 07:57:53,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-09 07:57:53,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 243. [2024-11-09 07:57:53,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 219 states have (on average 1.2100456621004567) internal successors, (265), 227 states have internal predecessors, (265), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 07:57:53,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 291 transitions. [2024-11-09 07:57:53,689 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 291 transitions. Word has length 52 [2024-11-09 07:57:53,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:53,690 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 291 transitions. [2024-11-09 07:57:53,690 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 47 states have (on average 1.702127659574468) internal successors, (80), 41 states have internal predecessors, (80), 5 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2024-11-09 07:57:53,690 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 291 transitions. [2024-11-09 07:57:53,690 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-09 07:57:53,690 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:53,691 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:53,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (22)] Forceful destruction successful, exit code 0 [2024-11-09 07:57:53,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable35 [2024-11-09 07:57:53,895 INFO L396 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:57:53,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:53,895 INFO L85 PathProgramCache]: Analyzing trace with hash -2024762571, now seen corresponding path program 1 times [2024-11-09 07:57:53,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:53,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105901106] [2024-11-09 07:57:53,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:53,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:53,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:54,324 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:54,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:54,327 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 07:57:54,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:54,362 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 07:57:54,365 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:54,471 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 10 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:57:54,471 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:54,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105901106] [2024-11-09 07:57:54,471 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2105901106] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:54,471 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999667429] [2024-11-09 07:57:54,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:54,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:54,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:54,472 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:57:54,473 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Waiting until timeout for monitored process [2024-11-09 07:57:54,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:54,654 INFO L255 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-09 07:57:54,656 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:54,742 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-09 07:57:54,779 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-09 07:57:54,971 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:57:54,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 13 [2024-11-09 07:57:54,982 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2024-11-09 07:57:54,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 20 treesize of output 22 [2024-11-09 07:57:55,053 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2024-11-09 07:57:55,178 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:55,178 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 16 [2024-11-09 07:57:55,277 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:57:55,293 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-09 07:57:55,298 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:55,298 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:55,464 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:55,465 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 28 treesize of output 32 [2024-11-09 07:57:55,652 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999667429] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:55,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:57:55,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 26] total 41 [2024-11-09 07:57:55,653 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [799816746] [2024-11-09 07:57:55,653 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:55,653 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-11-09 07:57:55,653 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:55,654 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-11-09 07:57:55,654 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=2042, Unknown=0, NotChecked=0, Total=2162 [2024-11-09 07:57:55,655 INFO L87 Difference]: Start difference. First operand 243 states and 291 transitions. Second operand has 42 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 35 states have internal predecessors, (79), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 07:57:56,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:56,778 INFO L93 Difference]: Finished difference Result 250 states and 299 transitions. [2024-11-09 07:57:56,778 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-09 07:57:56,778 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 35 states have internal predecessors, (79), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 54 [2024-11-09 07:57:56,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:56,779 INFO L225 Difference]: With dead ends: 250 [2024-11-09 07:57:56,780 INFO L226 Difference]: Without dead ends: 250 [2024-11-09 07:57:56,780 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 57 SyntacticMatches, 2 SemanticMatches, 61 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=216, Invalid=3690, Unknown=0, NotChecked=0, Total=3906 [2024-11-09 07:57:56,781 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 24 mSDsluCounter, 1474 mSDsCounter, 0 mSdLazyCounter, 1759 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 1538 SdHoareTripleChecker+Invalid, 1768 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1759 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:56,781 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 1538 Invalid, 1768 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1759 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 07:57:56,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2024-11-09 07:57:56,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 243. [2024-11-09 07:57:56,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 219 states have (on average 1.2100456621004567) internal successors, (265), 227 states have internal predecessors, (265), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 07:57:56,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 291 transitions. [2024-11-09 07:57:56,785 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 291 transitions. Word has length 54 [2024-11-09 07:57:56,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:56,786 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 291 transitions. [2024-11-09 07:57:56,786 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 39 states have (on average 2.0256410256410255) internal successors, (79), 35 states have internal predecessors, (79), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 07:57:56,786 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 291 transitions. [2024-11-09 07:57:56,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2024-11-09 07:57:56,787 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:56,787 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:56,806 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (23)] Ended with exit code 0 [2024-11-09 07:57:56,987 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2024-11-09 07:57:56,988 INFO L396 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:57:56,988 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:56,988 INFO L85 PathProgramCache]: Analyzing trace with hash -17256456, now seen corresponding path program 1 times [2024-11-09 07:57:56,988 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:56,988 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [934605993] [2024-11-09 07:57:56,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:56,988 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:57,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:57,259 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:57:57,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:57,262 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 07:57:57,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:57,304 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 25 [2024-11-09 07:57:57,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:57,410 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:57:57,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:57:57,410 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [934605993] [2024-11-09 07:57:57,411 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [934605993] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:57,411 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [635518766] [2024-11-09 07:57:57,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:57,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:57,411 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:57:57,412 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:57:57,413 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Waiting until timeout for monitored process [2024-11-09 07:57:57,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:57:57,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 307 conjuncts, 63 conjuncts are in the unsatisfiable core [2024-11-09 07:57:57,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:57:57,749 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:57:57,900 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:57:57,900 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 17 treesize of output 16 [2024-11-09 07:57:57,965 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-09 07:57:57,966 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 21 treesize of output 20 [2024-11-09 07:57:58,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-09 07:57:58,061 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 20 treesize of output 20 [2024-11-09 07:57:58,167 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-09 07:57:58,263 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:57:58,263 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:57:58,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 07:57:58,621 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [635518766] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:57:58,621 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:57:58,621 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 26] total 43 [2024-11-09 07:57:58,621 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062351626] [2024-11-09 07:57:58,621 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:57:58,622 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2024-11-09 07:57:58,622 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:57:58,622 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2024-11-09 07:57:58,623 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=2309, Unknown=5, NotChecked=0, Total=2450 [2024-11-09 07:57:58,623 INFO L87 Difference]: Start difference. First operand 243 states and 291 transitions. Second operand has 43 states, 41 states have (on average 2.097560975609756) internal successors, (86), 37 states have internal predecessors, (86), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 07:57:59,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:57:59,763 INFO L93 Difference]: Finished difference Result 244 states and 292 transitions. [2024-11-09 07:57:59,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-09 07:57:59,763 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 2.097560975609756) internal successors, (86), 37 states have internal predecessors, (86), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 55 [2024-11-09 07:57:59,764 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:57:59,764 INFO L225 Difference]: With dead ends: 244 [2024-11-09 07:57:59,764 INFO L226 Difference]: Without dead ends: 244 [2024-11-09 07:57:59,765 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 579 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=253, Invalid=4164, Unknown=5, NotChecked=0, Total=4422 [2024-11-09 07:57:59,766 INFO L432 NwaCegarLoop]: 69 mSDtfsCounter, 46 mSDsluCounter, 1812 mSDsCounter, 0 mSdLazyCounter, 1348 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 1881 SdHoareTripleChecker+Invalid, 1374 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 1348 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-09 07:57:59,766 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 1881 Invalid, 1374 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 1348 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-09 07:57:59,766 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2024-11-09 07:57:59,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 243. [2024-11-09 07:57:59,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 243 states, 219 states have (on average 1.2054794520547945) internal successors, (264), 227 states have internal predecessors, (264), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 07:57:59,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 243 states to 243 states and 290 transitions. [2024-11-09 07:57:59,771 INFO L78 Accepts]: Start accepts. Automaton has 243 states and 290 transitions. Word has length 55 [2024-11-09 07:57:59,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:57:59,772 INFO L471 AbstractCegarLoop]: Abstraction has 243 states and 290 transitions. [2024-11-09 07:57:59,772 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 2.097560975609756) internal successors, (86), 37 states have internal predecessors, (86), 5 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2024-11-09 07:57:59,772 INFO L276 IsEmpty]: Start isEmpty. Operand 243 states and 290 transitions. [2024-11-09 07:57:59,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 07:57:59,773 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:57:59,773 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:57:59,792 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (24)] Forceful destruction successful, exit code 0 [2024-11-09 07:57:59,975 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:57:59,975 INFO L396 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:57:59,975 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:57:59,976 INFO L85 PathProgramCache]: Analyzing trace with hash -648395146, now seen corresponding path program 3 times [2024-11-09 07:57:59,976 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:57:59,976 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1719533180] [2024-11-09 07:57:59,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:57:59,976 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:57:59,996 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:00,681 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:58:00,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:00,734 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2024-11-09 07:58:00,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:00,790 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-11-09 07:58:00,794 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:00,931 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 37 [2024-11-09 07:58:00,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:58:01,115 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 21 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 07:58:01,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:58:01,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1719533180] [2024-11-09 07:58:01,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1719533180] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:58:01,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [549426794] [2024-11-09 07:58:01,115 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2024-11-09 07:58:01,115 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:58:01,115 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:58:01,116 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:58:01,117 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Waiting until timeout for monitored process [2024-11-09 07:58:01,334 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2024-11-09 07:58:01,334 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-09 07:58:01,337 INFO L255 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 86 conjuncts are in the unsatisfiable core [2024-11-09 07:58:01,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:58:01,341 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-09 07:58:01,439 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-09 07:58:01,439 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 11 treesize of output 11 [2024-11-09 07:58:01,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-09 07:58:01,612 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (and (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base (select |c_#valid| alloc_and_zero_internal_~pi~1.base))) (= (select |c_old(#valid)| alloc_and_zero_internal_~pi~1.base) 0) (= |c_#memory_$Pointer$#0.base| (store |c_old(#memory_$Pointer$#0.base)| alloc_and_zero_internal_~pi~1.base (select |c_#memory_$Pointer$#0.base| alloc_and_zero_internal_~pi~1.base))))) is different from true [2024-11-09 07:58:01,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:58:01,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 17 [2024-11-09 07:58:01,641 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-09 07:58:01,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-09 07:58:01,654 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-09 07:58:01,655 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-09 07:58:01,904 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:58:01,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-09 07:58:01,926 INFO L349 Elim1Store]: treesize reduction 48, result has 36.0 percent of original size [2024-11-09 07:58:01,927 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 26 treesize of output 41 [2024-11-09 07:58:02,039 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-09 07:58:02,207 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2024-11-09 07:58:02,403 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-11-09 07:58:02,452 INFO L134 CoverageAnalysis]: Checked inductivity of 28 backedges. 4 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-09 07:58:02,452 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:58:02,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [549426794] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:58:02,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:58:02,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 29] total 51 [2024-11-09 07:58:02,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870913180] [2024-11-09 07:58:02,864 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:58:02,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 52 states [2024-11-09 07:58:02,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:58:02,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 52 interpolants. [2024-11-09 07:58:02,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=3103, Unknown=3, NotChecked=112, Total=3422 [2024-11-09 07:58:02,866 INFO L87 Difference]: Start difference. First operand 243 states and 290 transitions. Second operand has 52 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 44 states have internal predecessors, (93), 7 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-09 07:58:04,284 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:58:04,284 INFO L93 Difference]: Finished difference Result 259 states and 311 transitions. [2024-11-09 07:58:04,284 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2024-11-09 07:58:04,284 INFO L78 Accepts]: Start accepts. Automaton has has 52 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 44 states have internal predecessors, (93), 7 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) Word has length 58 [2024-11-09 07:58:04,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:58:04,285 INFO L225 Difference]: With dead ends: 259 [2024-11-09 07:58:04,285 INFO L226 Difference]: Without dead ends: 259 [2024-11-09 07:58:04,286 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 48 SyntacticMatches, 2 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1047 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=256, Invalid=3905, Unknown=3, NotChecked=126, Total=4290 [2024-11-09 07:58:04,286 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 35 mSDsluCounter, 1532 mSDsCounter, 0 mSdLazyCounter, 2053 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 1602 SdHoareTripleChecker+Invalid, 2197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2053 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 124 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:58:04,286 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [35 Valid, 1602 Invalid, 2197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2053 Invalid, 0 Unknown, 124 Unchecked, 1.1s Time] [2024-11-09 07:58:04,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 259 states. [2024-11-09 07:58:04,290 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 259 to 247. [2024-11-09 07:58:04,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 247 states, 223 states have (on average 1.210762331838565) internal successors, (270), 231 states have internal predecessors, (270), 13 states have call successors, (13), 2 states have call predecessors, (13), 2 states have return successors, (13), 13 states have call predecessors, (13), 13 states have call successors, (13) [2024-11-09 07:58:04,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 247 states to 247 states and 296 transitions. [2024-11-09 07:58:04,291 INFO L78 Accepts]: Start accepts. Automaton has 247 states and 296 transitions. Word has length 58 [2024-11-09 07:58:04,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:58:04,292 INFO L471 AbstractCegarLoop]: Abstraction has 247 states and 296 transitions. [2024-11-09 07:58:04,292 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 52 states, 49 states have (on average 1.8979591836734695) internal successors, (93), 44 states have internal predecessors, (93), 7 states have call successors, (8), 4 states have call predecessors, (8), 6 states have return successors, (8), 7 states have call predecessors, (8), 7 states have call successors, (8) [2024-11-09 07:58:04,292 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 296 transitions. [2024-11-09 07:58:04,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2024-11-09 07:58:04,293 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:58:04,293 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:58:04,313 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (25)] Ended with exit code 0 [2024-11-09 07:58:04,493 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2024-11-09 07:58:04,494 INFO L396 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 28 more)] === [2024-11-09 07:58:04,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:58:04,495 INFO L85 PathProgramCache]: Analyzing trace with hash -648395145, now seen corresponding path program 2 times [2024-11-09 07:58:04,495 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:58:04,495 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116530223] [2024-11-09 07:58:04,495 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:58:04,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:58:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat