./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-sll.i --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 4a390ef5 Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-sll.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 89b7500933072598b3ae86cb9a0697a1fc30e47e1dd961db3afeb42e68cfc79e --- Real Ultimate output --- This is Ultimate 0.2.5-dev-4a390ef-m [2024-10-24 16:28:16,780 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-24 16:28:16,861 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-64bit-Automizer_Default.epf [2024-10-24 16:28:16,864 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-24 16:28:16,864 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-24 16:28:16,883 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-24 16:28:16,884 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-24 16:28:16,884 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-24 16:28:16,885 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-24 16:28:16,886 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-24 16:28:16,886 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-24 16:28:16,886 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-24 16:28:16,887 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-24 16:28:16,888 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-24 16:28:16,889 INFO L153 SettingsManager]: * Use SBE=true [2024-10-24 16:28:16,889 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-24 16:28:16,889 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-24 16:28:16,889 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-24 16:28:16,889 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-24 16:28:16,890 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-24 16:28:16,890 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-24 16:28:16,890 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-24 16:28:16,893 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-24 16:28:16,893 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-24 16:28:16,893 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-24 16:28:16,893 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-24 16:28:16,894 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-24 16:28:16,894 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-24 16:28:16,894 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-24 16:28:16,894 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-24 16:28:16,894 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:28:16,894 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-24 16:28:16,895 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-24 16:28:16,895 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-24 16:28:16,895 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-24 16:28:16,895 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-24 16:28:16,895 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-24 16:28:16,895 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-24 16:28:16,895 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-24 16:28:16,895 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 -> 89b7500933072598b3ae86cb9a0697a1fc30e47e1dd961db3afeb42e68cfc79e [2024-10-24 16:28:17,134 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-24 16:28:17,161 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-24 16:28:17,163 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-24 16:28:17,165 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-24 16:28:17,166 INFO L274 PluginConnector]: CDTParser initialized [2024-10-24 16:28:17,167 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-sll.i [2024-10-24 16:28:18,446 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-24 16:28:18,703 INFO L384 CDTParser]: Found 1 translation units. [2024-10-24 16:28:18,703 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-broom/sll-nested-sll.i [2024-10-24 16:28:18,727 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/160d8f01f/fb734db325ea4365adc87a3828b63897/FLAG4b02b4f5f [2024-10-24 16:28:18,741 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/160d8f01f/fb734db325ea4365adc87a3828b63897 [2024-10-24 16:28:18,743 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-24 16:28:18,744 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-24 16:28:18,746 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-24 16:28:18,748 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-24 16:28:18,755 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-24 16:28:18,756 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:28:18" (1/1) ... [2024-10-24 16:28:18,756 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72646762 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:18, skipping insertion in model container [2024-10-24 16:28:18,757 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 24.10 04:28:18" (1/1) ... [2024-10-24 16:28:18,801 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-24 16:28:19,092 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:28:19,099 INFO L200 MainTranslator]: Completed pre-run [2024-10-24 16:28:19,128 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-24 16:28:19,152 INFO L204 MainTranslator]: Completed translation [2024-10-24 16:28:19,152 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:19 WrapperNode [2024-10-24 16:28:19,152 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-24 16:28:19,153 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-24 16:28:19,153 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-24 16:28:19,153 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-24 16:28:19,159 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:19" (1/1) ... [2024-10-24 16:28:19,168 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:19" (1/1) ... [2024-10-24 16:28:19,187 INFO L138 Inliner]: procedures = 122, calls = 33, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 89 [2024-10-24 16:28:19,188 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-24 16:28:19,188 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-24 16:28:19,188 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-24 16:28:19,188 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-24 16:28:19,200 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:19" (1/1) ... [2024-10-24 16:28:19,200 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:19" (1/1) ... [2024-10-24 16:28:19,203 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:19" (1/1) ... [2024-10-24 16:28:19,225 INFO L175 MemorySlicer]: Split 16 memory accesses to 1 slices as follows [16]. 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-10-24 16:28:19,225 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:19" (1/1) ... [2024-10-24 16:28:19,225 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:19" (1/1) ... [2024-10-24 16:28:19,230 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:19" (1/1) ... [2024-10-24 16:28:19,233 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:19" (1/1) ... [2024-10-24 16:28:19,234 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:19" (1/1) ... [2024-10-24 16:28:19,236 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:19" (1/1) ... [2024-10-24 16:28:19,238 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-24 16:28:19,238 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-24 16:28:19,238 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-24 16:28:19,239 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-24 16:28:19,239 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:19" (1/1) ... [2024-10-24 16:28:19,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-24 16:28:19,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:28:19,271 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-24 16:28:19,274 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-24 16:28:19,316 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero_internal [2024-10-24 16:28:19,317 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero_internal [2024-10-24 16:28:19,317 INFO L130 BoogieDeclarations]: Found specification of procedure create_internal [2024-10-24 16:28:19,317 INFO L138 BoogieDeclarations]: Found implementation of procedure create_internal [2024-10-24 16:28:19,317 INFO L130 BoogieDeclarations]: Found specification of procedure alloc_and_zero [2024-10-24 16:28:19,318 INFO L138 BoogieDeclarations]: Found implementation of procedure alloc_and_zero [2024-10-24 16:28:19,318 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-24 16:28:19,318 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-24 16:28:19,318 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-24 16:28:19,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-24 16:28:19,318 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-24 16:28:19,318 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-24 16:28:19,429 INFO L238 CfgBuilder]: Building ICFG [2024-10-24 16:28:19,436 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-24 16:28:19,717 INFO L? ?]: Removed 110 outVars from TransFormulas that were not future-live. [2024-10-24 16:28:19,717 INFO L287 CfgBuilder]: Performing block encoding [2024-10-24 16:28:19,771 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-24 16:28:19,772 INFO L314 CfgBuilder]: Removed 6 assume(true) statements. [2024-10-24 16:28:19,772 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:28:19 BoogieIcfgContainer [2024-10-24 16:28:19,772 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-24 16:28:19,775 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-24 16:28:19,775 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-24 16:28:19,778 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-24 16:28:19,778 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 24.10 04:28:18" (1/3) ... [2024-10-24 16:28:19,779 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d7677b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:28:19, skipping insertion in model container [2024-10-24 16:28:19,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 24.10 04:28:19" (2/3) ... [2024-10-24 16:28:19,780 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3d7677b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 24.10 04:28:19, skipping insertion in model container [2024-10-24 16:28:19,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 24.10 04:28:19" (3/3) ... [2024-10-24 16:28:19,782 INFO L112 eAbstractionObserver]: Analyzing ICFG sll-nested-sll.i [2024-10-24 16:28:19,796 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-24 16:28:19,797 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 39 error locations. [2024-10-24 16:28:19,854 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-24 16:28:19,859 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;@170e8e66, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-24 16:28:19,859 INFO L334 AbstractCegarLoop]: Starting to check reachability of 39 error locations. [2024-10-24 16:28:19,863 INFO L276 IsEmpty]: Start isEmpty. Operand has 91 states, 42 states have (on average 2.2142857142857144) internal successors, (93), 81 states have internal predecessors, (93), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:28:19,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 16:28:19,868 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:19,868 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 16:28:19,869 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-24 16:28:19,872 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:19,872 INFO L85 PathProgramCache]: Analyzing trace with hash 6991277, now seen corresponding path program 1 times [2024-10-24 16:28:19,879 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:28:19,879 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1308644061] [2024-10-24 16:28:19,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:19,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:28:19,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:20,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:28:20,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:28:20,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1308644061] [2024-10-24 16:28:20,113 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1308644061] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:20,113 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:20,113 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:28:20,114 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641861223] [2024-10-24 16:28:20,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:20,118 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:28:20,119 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:28:20,139 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:28:20,140 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:28:20,141 INFO L87 Difference]: Start difference. First operand has 91 states, 42 states have (on average 2.2142857142857144) internal successors, (93), 81 states have internal predecessors, (93), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-10-24 16:28:20,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:20,245 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2024-10-24 16:28:20,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:28:20,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 4 [2024-10-24 16:28:20,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:20,252 INFO L225 Difference]: With dead ends: 89 [2024-10-24 16:28:20,252 INFO L226 Difference]: Without dead ends: 88 [2024-10-24 16:28:20,254 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:28:20,256 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 1 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 130 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:20,257 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 130 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:28:20,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2024-10-24 16:28:20,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2024-10-24 16:28:20,284 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 42 states have (on average 2.0) internal successors, (84), 78 states have internal predecessors, (84), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:28:20,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 96 transitions. [2024-10-24 16:28:20,287 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 96 transitions. Word has length 4 [2024-10-24 16:28:20,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:20,288 INFO L471 AbstractCegarLoop]: Abstraction has 88 states and 96 transitions. [2024-10-24 16:28:20,288 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-10-24 16:28:20,288 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 96 transitions. [2024-10-24 16:28:20,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-10-24 16:28:20,288 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:20,288 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-10-24 16:28:20,289 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-24 16:28:20,289 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-24 16:28:20,290 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:20,290 INFO L85 PathProgramCache]: Analyzing trace with hash 6991278, now seen corresponding path program 1 times [2024-10-24 16:28:20,290 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:28:20,290 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2084969323] [2024-10-24 16:28:20,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:20,290 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:28:20,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:20,369 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:28:20,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:28:20,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2084969323] [2024-10-24 16:28:20,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2084969323] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:20,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:20,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-24 16:28:20,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [783709014] [2024-10-24 16:28:20,370 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:20,371 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-24 16:28:20,371 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:28:20,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-24 16:28:20,372 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:28:20,372 INFO L87 Difference]: Start difference. First operand 88 states and 96 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-10-24 16:28:20,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:20,450 INFO L93 Difference]: Finished difference Result 86 states and 94 transitions. [2024-10-24 16:28:20,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-24 16:28:20,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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 4 [2024-10-24 16:28:20,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:20,452 INFO L225 Difference]: With dead ends: 86 [2024-10-24 16:28:20,452 INFO L226 Difference]: Without dead ends: 86 [2024-10-24 16:28:20,452 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-24 16:28:20,453 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 1 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:20,454 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 135 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:28:20,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2024-10-24 16:28:20,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2024-10-24 16:28:20,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 42 states have (on average 1.9523809523809523) internal successors, (82), 76 states have internal predecessors, (82), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:28:20,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 94 transitions. [2024-10-24 16:28:20,460 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 94 transitions. Word has length 4 [2024-10-24 16:28:20,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:20,460 INFO L471 AbstractCegarLoop]: Abstraction has 86 states and 94 transitions. [2024-10-24 16:28:20,460 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 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-10-24 16:28:20,460 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 94 transitions. [2024-10-24 16:28:20,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 16:28:20,461 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:20,461 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:28:20,461 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-24 16:28:20,461 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting alloc_and_zero_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-24 16:28:20,461 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:20,462 INFO L85 PathProgramCache]: Analyzing trace with hash -939442667, now seen corresponding path program 1 times [2024-10-24 16:28:20,462 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:28:20,462 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1124973015] [2024-10-24 16:28:20,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:20,462 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:28:20,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:20,578 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:28:20,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:20,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:28:20,596 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:28:20,596 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1124973015] [2024-10-24 16:28:20,596 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1124973015] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:20,596 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:20,596 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:28:20,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [653411059] [2024-10-24 16:28:20,597 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:20,597 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:28:20,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:28:20,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:28:20,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:28:20,598 INFO L87 Difference]: Start difference. First operand 86 states and 94 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:28:20,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:20,718 INFO L93 Difference]: Finished difference Result 85 states and 93 transitions. [2024-10-24 16:28:20,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:28:20,720 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-24 16:28:20,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:20,720 INFO L225 Difference]: With dead ends: 85 [2024-10-24 16:28:20,720 INFO L226 Difference]: Without dead ends: 85 [2024-10-24 16:28:20,721 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:28:20,723 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:20,724 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 158 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:28:20,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2024-10-24 16:28:20,732 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 85. [2024-10-24 16:28:20,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 42 states have (on average 1.9285714285714286) internal successors, (81), 75 states have internal predecessors, (81), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:28:20,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 93 transitions. [2024-10-24 16:28:20,735 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 93 transitions. Word has length 11 [2024-10-24 16:28:20,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:20,736 INFO L471 AbstractCegarLoop]: Abstraction has 85 states and 93 transitions. [2024-10-24 16:28:20,737 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:28:20,737 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 93 transitions. [2024-10-24 16:28:20,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-24 16:28:20,737 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:20,737 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:28:20,737 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-24 16:28:20,737 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting alloc_and_zero_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-24 16:28:20,738 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:20,738 INFO L85 PathProgramCache]: Analyzing trace with hash -939442666, now seen corresponding path program 1 times [2024-10-24 16:28:20,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:28:20,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [878040757] [2024-10-24 16:28:20,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:20,738 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:28:20,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:20,857 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:28:20,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:20,871 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:28:20,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:28:20,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [878040757] [2024-10-24 16:28:20,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [878040757] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:20,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:20,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-24 16:28:20,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606413561] [2024-10-24 16:28:20,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:20,872 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-24 16:28:20,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:28:20,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-24 16:28:20,872 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:28:20,873 INFO L87 Difference]: Start difference. First operand 85 states and 93 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:28:20,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:20,966 INFO L93 Difference]: Finished difference Result 84 states and 92 transitions. [2024-10-24 16:28:20,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-24 16:28:20,966 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 11 [2024-10-24 16:28:20,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:20,968 INFO L225 Difference]: With dead ends: 84 [2024-10-24 16:28:20,968 INFO L226 Difference]: Without dead ends: 84 [2024-10-24 16:28:20,968 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-10-24 16:28:20,970 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 111 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:20,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 163 Invalid, 111 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:28:20,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2024-10-24 16:28:20,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2024-10-24 16:28:20,983 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 42 states have (on average 1.9047619047619047) internal successors, (80), 74 states have internal predecessors, (80), 6 states have call successors, (6), 3 states have call predecessors, (6), 3 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-10-24 16:28:20,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 92 transitions. [2024-10-24 16:28:20,984 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 92 transitions. Word has length 11 [2024-10-24 16:28:20,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:20,984 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 92 transitions. [2024-10-24 16:28:20,985 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2024-10-24 16:28:20,985 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 92 transitions. [2024-10-24 16:28:20,985 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 16:28:20,985 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:20,985 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:28:20,985 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-24 16:28:20,985 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 36 more)] === [2024-10-24 16:28:20,986 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:20,986 INFO L85 PathProgramCache]: Analyzing trace with hash 1093149562, now seen corresponding path program 1 times [2024-10-24 16:28:20,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:28:20,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1556751234] [2024-10-24 16:28:20,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:20,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:28:21,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:21,156 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:28:21,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:21,196 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:28:21,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:21,279 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 16:28:21,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:21,382 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:28:21,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:28:21,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1556751234] [2024-10-24 16:28:21,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1556751234] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:21,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:21,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 16:28:21,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2072966172] [2024-10-24 16:28:21,385 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:21,385 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-10-24 16:28:21,385 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:28:21,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-10-24 16:28:21,386 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:28:21,386 INFO L87 Difference]: Start difference. First operand 84 states and 92 transitions. Second operand has 10 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:28:21,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:21,649 INFO L93 Difference]: Finished difference Result 98 states and 114 transitions. [2024-10-24 16:28:21,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:28:21,650 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 18 [2024-10-24 16:28:21,650 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:21,652 INFO L225 Difference]: With dead ends: 98 [2024-10-24 16:28:21,653 INFO L226 Difference]: Without dead ends: 98 [2024-10-24 16:28:21,653 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=101, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:28:21,654 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 19 mSDsluCounter, 223 mSDsCounter, 0 mSdLazyCounter, 350 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 350 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:21,655 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 282 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 350 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:28:21,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2024-10-24 16:28:21,665 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2024-10-24 16:28:21,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 51 states have (on average 1.8627450980392157) internal successors, (95), 81 states have internal predecessors, (95), 7 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (9), 9 states have call predecessors, (9), 7 states have call successors, (9) [2024-10-24 16:28:21,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 111 transitions. [2024-10-24 16:28:21,666 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 111 transitions. Word has length 18 [2024-10-24 16:28:21,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:21,667 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 111 transitions. [2024-10-24 16:28:21,667 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 7 states have (on average 1.7142857142857142) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:28:21,667 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 111 transitions. [2024-10-24 16:28:21,667 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2024-10-24 16:28:21,667 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:21,667 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:28:21,667 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-24 16:28:21,667 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 36 more)] === [2024-10-24 16:28:21,668 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:21,668 INFO L85 PathProgramCache]: Analyzing trace with hash 1093149563, now seen corresponding path program 1 times [2024-10-24 16:28:21,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:28:21,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [528459049] [2024-10-24 16:28:21,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:21,672 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:28:21,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:21,829 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:28:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:21,920 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:28:21,924 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:21,975 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 16:28:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:22,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:28:22,041 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:28:22,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [528459049] [2024-10-24 16:28:22,041 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [528459049] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:22,041 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:22,041 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 16:28:22,041 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [217828309] [2024-10-24 16:28:22,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:22,042 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 16:28:22,042 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:28:22,042 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 16:28:22,042 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:28:22,043 INFO L87 Difference]: Start difference. First operand 94 states and 111 transitions. Second operand has 11 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:28:22,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:22,347 INFO L93 Difference]: Finished difference Result 106 states and 127 transitions. [2024-10-24 16:28:22,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:28:22,350 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 18 [2024-10-24 16:28:22,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:22,351 INFO L225 Difference]: With dead ends: 106 [2024-10-24 16:28:22,351 INFO L226 Difference]: Without dead ends: 106 [2024-10-24 16:28:22,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=124, Unknown=0, NotChecked=0, Total=156 [2024-10-24 16:28:22,352 INFO L432 NwaCegarLoop]: 63 mSDtfsCounter, 10 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 412 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 427 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 412 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:22,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 308 Invalid, 427 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 412 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:28:22,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-10-24 16:28:22,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 102. [2024-10-24 16:28:22,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 57 states have (on average 1.8070175438596492) internal successors, (103), 87 states have internal predecessors, (103), 9 states have call successors, (9), 3 states have call predecessors, (9), 4 states have return successors, (12), 11 states have call predecessors, (12), 9 states have call successors, (12) [2024-10-24 16:28:22,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 124 transitions. [2024-10-24 16:28:22,362 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 124 transitions. Word has length 18 [2024-10-24 16:28:22,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:22,363 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 124 transitions. [2024-10-24 16:28:22,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 1.5) internal successors, (12), 8 states have internal predecessors, (12), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:28:22,364 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 124 transitions. [2024-10-24 16:28:22,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-24 16:28:22,365 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:22,365 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:28:22,366 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-24 16:28:22,366 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting create_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-24 16:28:22,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:22,366 INFO L85 PathProgramCache]: Analyzing trace with hash -1711403091, now seen corresponding path program 1 times [2024-10-24 16:28:22,366 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:28:22,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [728965324] [2024-10-24 16:28:22,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:22,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:28:22,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:22,462 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:28:22,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:22,467 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 16:28:22,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:22,489 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 16:28:22,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:22,555 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:28:22,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:28:22,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [728965324] [2024-10-24 16:28:22,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [728965324] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:28:22,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1658111208] [2024-10-24 16:28:22,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:22,557 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:28:22,557 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:28:22,561 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:28:22,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-24 16:28:22,647 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:22,649 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 16:28:22,660 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:22,710 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-10-24 16:28:22,761 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-10-24 16:28:22,781 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-24 16:28:22,781 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-10-24 16:28:22,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-24 16:28:22,792 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:28:22,909 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:28:22,910 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1658111208] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:28:22,910 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:28:22,910 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 6] total 11 [2024-10-24 16:28:22,910 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404062699] [2024-10-24 16:28:22,910 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:28:22,910 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 16:28:22,910 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:28:22,911 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 16:28:22,911 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=84, Unknown=1, NotChecked=18, Total=132 [2024-10-24 16:28:22,911 INFO L87 Difference]: Start difference. First operand 102 states and 124 transitions. Second operand has 12 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 16:28:23,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:23,183 INFO L93 Difference]: Finished difference Result 103 states and 127 transitions. [2024-10-24 16:28:23,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:28:23,185 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 20 [2024-10-24 16:28:23,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:23,186 INFO L225 Difference]: With dead ends: 103 [2024-10-24 16:28:23,186 INFO L226 Difference]: Without dead ends: 103 [2024-10-24 16:28:23,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=188, Unknown=1, NotChecked=28, Total=272 [2024-10-24 16:28:23,186 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 21 mSDsluCounter, 247 mSDsCounter, 0 mSdLazyCounter, 305 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 421 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 305 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:23,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 311 Invalid, 421 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 305 Invalid, 0 Unknown, 98 Unchecked, 0.2s Time] [2024-10-24 16:28:23,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-10-24 16:28:23,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-10-24 16:28:23,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 58 states have (on average 1.793103448275862) internal successors, (104), 87 states have internal predecessors, (104), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2024-10-24 16:28:23,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 127 transitions. [2024-10-24 16:28:23,195 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 127 transitions. Word has length 20 [2024-10-24 16:28:23,195 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:23,195 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 127 transitions. [2024-10-24 16:28:23,195 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.2222222222222223) internal successors, (20), 9 states have internal predecessors, (20), 2 states have call successors, (8), 4 states have call predecessors, (8), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2024-10-24 16:28:23,196 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 127 transitions. [2024-10-24 16:28:23,196 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-24 16:28:23,198 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:23,198 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:28:23,212 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-24 16:28:23,399 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:28:23,399 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting create_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-24 16:28:23,400 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:23,400 INFO L85 PathProgramCache]: Analyzing trace with hash -1711403090, now seen corresponding path program 1 times [2024-10-24 16:28:23,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:28:23,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [875463453] [2024-10-24 16:28:23,400 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:23,400 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:28:23,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:23,530 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:28:23,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:23,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 16:28:23,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:23,585 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 16:28:23,588 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:23,631 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:28:23,631 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:28:23,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [875463453] [2024-10-24 16:28:23,632 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [875463453] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:28:23,632 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2123904696] [2024-10-24 16:28:23,632 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:23,632 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:28:23,632 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:28:23,634 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:28:23,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-24 16:28:23,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:23,709 INFO L255 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 27 conjuncts are in the unsatisfiable core [2024-10-24 16:28:23,711 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:23,721 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-10-24 16:28:23,769 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2024-10-24 16:28:23,784 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-24 16:28:23,785 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-10-24 16:28:23,799 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-24 16:28:23,799 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:28:23,855 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2123904696] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:28:23,855 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:28:23,855 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 10 [2024-10-24 16:28:23,855 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122597679] [2024-10-24 16:28:23,856 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:28:23,856 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 16:28:23,856 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:28:23,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 16:28:23,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=105, Unknown=1, NotChecked=20, Total=156 [2024-10-24 16:28:23,857 INFO L87 Difference]: Start difference. First operand 103 states and 127 transitions. Second operand has 11 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:28:24,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:24,063 INFO L93 Difference]: Finished difference Result 104 states and 127 transitions. [2024-10-24 16:28:24,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:28:24,064 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) Word has length 20 [2024-10-24 16:28:24,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:24,065 INFO L225 Difference]: With dead ends: 104 [2024-10-24 16:28:24,065 INFO L226 Difference]: Without dead ends: 104 [2024-10-24 16:28:24,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=194, Unknown=1, NotChecked=28, Total=272 [2024-10-24 16:28:24,066 INFO L432 NwaCegarLoop]: 68 mSDtfsCounter, 8 mSDsluCounter, 249 mSDsCounter, 0 mSdLazyCounter, 238 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 317 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 238 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:24,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 317 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 238 Invalid, 0 Unknown, 98 Unchecked, 0.1s Time] [2024-10-24 16:28:24,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-24 16:28:24,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-24 16:28:24,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 88 states have internal predecessors, (104), 10 states have call successors, (10), 3 states have call predecessors, (10), 4 states have return successors, (13), 12 states have call predecessors, (13), 10 states have call successors, (13) [2024-10-24 16:28:24,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 127 transitions. [2024-10-24 16:28:24,073 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 127 transitions. Word has length 20 [2024-10-24 16:28:24,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:24,073 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 127 transitions. [2024-10-24 16:28:24,073 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 2.125) internal successors, (17), 8 states have internal predecessors, (17), 2 states have call successors, (7), 3 states have call predecessors, (7), 4 states have return successors, (4), 3 states have call predecessors, (4), 2 states have call successors, (4) [2024-10-24 16:28:24,073 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 127 transitions. [2024-10-24 16:28:24,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 16:28:24,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:24,074 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:28:24,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-10-24 16:28:24,274 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,SelfDestructingSolverStorable7 [2024-10-24 16:28:24,275 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-24 16:28:24,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:24,275 INFO L85 PathProgramCache]: Analyzing trace with hash -222925609, now seen corresponding path program 1 times [2024-10-24 16:28:24,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:28:24,275 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824120572] [2024-10-24 16:28:24,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:24,275 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:28:24,289 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:24,333 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:28:24,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:24,337 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:28:24,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:24,347 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 16:28:24,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:24,350 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:28:24,351 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:28:24,351 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824120572] [2024-10-24 16:28:24,351 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824120572] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:24,351 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:24,351 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-24 16:28:24,351 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822901858] [2024-10-24 16:28:24,351 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:24,353 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-24 16:28:24,354 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:28:24,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-24 16:28:24,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-10-24 16:28:24,355 INFO L87 Difference]: Start difference. First operand 104 states and 127 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:28:24,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:24,487 INFO L93 Difference]: Finished difference Result 119 states and 153 transitions. [2024-10-24 16:28:24,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-10-24 16:28:24,487 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 23 [2024-10-24 16:28:24,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:24,488 INFO L225 Difference]: With dead ends: 119 [2024-10-24 16:28:24,489 INFO L226 Difference]: Without dead ends: 119 [2024-10-24 16:28:24,489 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:28:24,489 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 20 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 209 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 209 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:24,489 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 219 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 209 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:28:24,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-24 16:28:24,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 114. [2024-10-24 16:28:24,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 114 states, 69 states have (on average 1.7971014492753623) internal successors, (124), 96 states have internal predecessors, (124), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2024-10-24 16:28:24,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 114 states to 114 states and 150 transitions. [2024-10-24 16:28:24,494 INFO L78 Accepts]: Start accepts. Automaton has 114 states and 150 transitions. Word has length 23 [2024-10-24 16:28:24,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:24,495 INFO L471 AbstractCegarLoop]: Abstraction has 114 states and 150 transitions. [2024-10-24 16:28:24,495 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 5 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:28:24,495 INFO L276 IsEmpty]: Start isEmpty. Operand 114 states and 150 transitions. [2024-10-24 16:28:24,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-10-24 16:28:24,495 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:24,495 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:28:24,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-10-24 16:28:24,496 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-24 16:28:24,496 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:24,496 INFO L85 PathProgramCache]: Analyzing trace with hash -222925608, now seen corresponding path program 1 times [2024-10-24 16:28:24,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:28:24,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1288111231] [2024-10-24 16:28:24,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:24,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:28:24,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:24,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:28:24,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:24,631 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:28:24,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:24,640 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 16:28:24,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:24,648 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:28:24,648 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:28:24,649 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1288111231] [2024-10-24 16:28:24,649 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1288111231] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:24,649 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:24,649 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 16:28:24,649 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858393590] [2024-10-24 16:28:24,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:24,649 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:28:24,649 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:28:24,650 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:28:24,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:28:24,650 INFO L87 Difference]: Start difference. First operand 114 states and 150 transitions. Second operand has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:28:24,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:24,843 INFO L93 Difference]: Finished difference Result 125 states and 161 transitions. [2024-10-24 16:28:24,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:28:24,844 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 23 [2024-10-24 16:28:24,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:24,845 INFO L225 Difference]: With dead ends: 125 [2024-10-24 16:28:24,845 INFO L226 Difference]: Without dead ends: 125 [2024-10-24 16:28:24,846 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2024-10-24 16:28:24,846 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 17 mSDsluCounter, 350 mSDsCounter, 0 mSdLazyCounter, 290 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 297 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 290 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:24,846 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 408 Invalid, 297 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 290 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:28:24,847 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-10-24 16:28:24,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 121. [2024-10-24 16:28:24,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 76 states have (on average 1.7763157894736843) internal successors, (135), 103 states have internal predecessors, (135), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2024-10-24 16:28:24,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 161 transitions. [2024-10-24 16:28:24,853 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 161 transitions. Word has length 23 [2024-10-24 16:28:24,853 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:24,854 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 161 transitions. [2024-10-24 16:28:24,854 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 7 states have internal predecessors, (17), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:28:24,854 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 161 transitions. [2024-10-24 16:28:24,861 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-24 16:28:24,862 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:24,862 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:28:24,862 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-10-24 16:28:24,862 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 36 more)] === [2024-10-24 16:28:24,862 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:24,862 INFO L85 PathProgramCache]: Analyzing trace with hash -126915569, now seen corresponding path program 1 times [2024-10-24 16:28:24,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:28:24,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390169212] [2024-10-24 16:28:24,863 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:24,863 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:28:24,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:24,978 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:28:24,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:25,002 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:28:25,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:25,143 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 16:28:25,146 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:25,200 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:28:25,205 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:25,318 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:28:25,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:28:25,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390169212] [2024-10-24 16:28:25,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390169212] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:28:25,319 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [435868834] [2024-10-24 16:28:25,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:25,319 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:28:25,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:28:25,323 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:28:25,325 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-24 16:28:25,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:25,405 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 24 conjuncts are in the unsatisfiable core [2024-10-24 16:28:25,407 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:25,410 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-10-24 16:28:25,438 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))) is different from true [2024-10-24 16:28:25,474 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-10-24 16:28:25,632 INFO L349 Elim1Store]: treesize reduction 104, result has 34.2 percent of original size [2024-10-24 16:28:25,632 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 40 treesize of output 104 [2024-10-24 16:28:26,016 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 12 treesize of output 9 [2024-10-24 16:28:26,057 INFO L349 Elim1Store]: treesize reduction 43, result has 28.3 percent of original size [2024-10-24 16:28:26,058 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 7 case distinctions, treesize of input 34 treesize of output 33 [2024-10-24 16:28:26,073 INFO L349 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2024-10-24 16:28:26,073 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 3 case distinctions, treesize of input 24 treesize of output 14 [2024-10-24 16:28:26,094 INFO L349 Elim1Store]: treesize reduction 15, result has 21.1 percent of original size [2024-10-24 16:28:26,095 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 3 case distinctions, treesize of input 22 treesize of output 16 [2024-10-24 16:28:26,130 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-10-24 16:28:26,131 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:28:26,195 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [435868834] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:28:26,195 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:28:26,195 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 9] total 16 [2024-10-24 16:28:26,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511480606] [2024-10-24 16:28:26,196 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:28:26,196 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-10-24 16:28:26,196 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:28:26,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-10-24 16:28:26,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=195, Unknown=2, NotChecked=58, Total=306 [2024-10-24 16:28:26,197 INFO L87 Difference]: Start difference. First operand 121 states and 161 transitions. Second operand has 17 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 14 states have internal predecessors, (32), 6 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-24 16:28:26,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:26,734 INFO L93 Difference]: Finished difference Result 133 states and 183 transitions. [2024-10-24 16:28:26,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-10-24 16:28:26,734 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 14 states have internal predecessors, (32), 6 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) Word has length 26 [2024-10-24 16:28:26,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:26,735 INFO L225 Difference]: With dead ends: 133 [2024-10-24 16:28:26,735 INFO L226 Difference]: Without dead ends: 133 [2024-10-24 16:28:26,736 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 3 SemanticMatches, 20 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=86, Invalid=300, Unknown=2, NotChecked=74, Total=462 [2024-10-24 16:28:26,736 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 34 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 666 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 236 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:26,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 322 Invalid, 666 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 401 Invalid, 0 Unknown, 236 Unchecked, 0.3s Time] [2024-10-24 16:28:26,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-24 16:28:26,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 126. [2024-10-24 16:28:26,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 80 states have (on average 1.7625) internal successors, (141), 107 states have internal predecessors, (141), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 15 states have call predecessors, (19), 11 states have call successors, (19) [2024-10-24 16:28:26,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 171 transitions. [2024-10-24 16:28:26,741 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 171 transitions. Word has length 26 [2024-10-24 16:28:26,742 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:26,742 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 171 transitions. [2024-10-24 16:28:26,742 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 13 states have (on average 2.4615384615384617) internal successors, (32), 14 states have internal predecessors, (32), 6 states have call successors, (8), 3 states have call predecessors, (8), 7 states have return successors, (7), 6 states have call predecessors, (7), 6 states have call successors, (7) [2024-10-24 16:28:26,742 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 171 transitions. [2024-10-24 16:28:26,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-24 16:28:26,742 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:26,743 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:28:26,756 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-24 16:28:26,943 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-10-24 16:28:26,943 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 36 more)] === [2024-10-24 16:28:26,944 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:26,944 INFO L85 PathProgramCache]: Analyzing trace with hash -126915568, now seen corresponding path program 1 times [2024-10-24 16:28:26,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:28:26,944 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2000183578] [2024-10-24 16:28:26,944 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:26,944 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:28:26,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:27,120 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:28:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:27,177 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:28:27,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:27,325 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 16:28:27,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:27,414 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:28:27,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:27,544 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:28:27,545 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:28:27,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2000183578] [2024-10-24 16:28:27,545 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2000183578] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:28:27,545 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761081015] [2024-10-24 16:28:27,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:27,545 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:28:27,545 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:28:27,546 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:28:27,547 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-24 16:28:27,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:27,625 INFO L255 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-24 16:28:27,627 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:27,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 16:28:27,636 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-10-24 16:28:27,710 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) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) is different from true [2024-10-24 16:28:27,755 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-10-24 16:28:27,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:28:27,850 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:28:27,851 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 19 treesize of output 9 [2024-10-24 16:28:27,867 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-24 16:28:27,867 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-10-24 16:28:27,870 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2024-10-24 16:28:27,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:28:28,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761081015] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:28:28,046 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:28:28,046 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 10] total 20 [2024-10-24 16:28:28,046 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831468444] [2024-10-24 16:28:28,046 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:28:28,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-24 16:28:28,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:28:28,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-24 16:28:28,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=71, Invalid=355, Unknown=2, NotChecked=78, Total=506 [2024-10-24 16:28:28,047 INFO L87 Difference]: Start difference. First operand 126 states and 171 transitions. Second operand has 21 states, 15 states have (on average 2.2) internal successors, (33), 17 states have internal predecessors, (33), 6 states have call successors, (8), 3 states have call predecessors, (8), 8 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-24 16:28:28,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:28,754 INFO L93 Difference]: Finished difference Result 142 states and 192 transitions. [2024-10-24 16:28:28,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 16:28:28,754 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 15 states have (on average 2.2) internal successors, (33), 17 states have internal predecessors, (33), 6 states have call successors, (8), 3 states have call predecessors, (8), 8 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) Word has length 26 [2024-10-24 16:28:28,754 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:28,755 INFO L225 Difference]: With dead ends: 142 [2024-10-24 16:28:28,755 INFO L226 Difference]: Without dead ends: 142 [2024-10-24 16:28:28,756 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=103, Invalid=502, Unknown=3, NotChecked=94, Total=702 [2024-10-24 16:28:28,757 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 30 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 690 mSolverCounterSat, 26 mSolverCounterUnsat, 8 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 974 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 690 IncrementalHoareTripleChecker+Invalid, 8 IncrementalHoareTripleChecker+Unknown, 250 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:28,757 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 457 Invalid, 974 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 690 Invalid, 8 Unknown, 250 Unchecked, 0.5s Time] [2024-10-24 16:28:28,757 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-10-24 16:28:28,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 123. [2024-10-24 16:28:28,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 78 states have (on average 1.7692307692307692) internal successors, (138), 105 states have internal predecessors, (138), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2024-10-24 16:28:28,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 164 transitions. [2024-10-24 16:28:28,764 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 164 transitions. Word has length 26 [2024-10-24 16:28:28,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:28,764 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 164 transitions. [2024-10-24 16:28:28,764 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 15 states have (on average 2.2) internal successors, (33), 17 states have internal predecessors, (33), 6 states have call successors, (8), 3 states have call predecessors, (8), 8 states have return successors, (8), 6 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-24 16:28:28,764 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 164 transitions. [2024-10-24 16:28:28,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 16:28:28,765 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:28,765 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:28:28,778 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-24 16:28:28,965 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-10-24 16:28:28,965 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-24 16:28:28,966 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:28,966 INFO L85 PathProgramCache]: Analyzing trace with hash 516824054, now seen corresponding path program 1 times [2024-10-24 16:28:28,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:28:28,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [719486604] [2024-10-24 16:28:28,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:28,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:28:28,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:29,011 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:28:29,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:29,032 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:28:29,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:29,039 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 16:28:29,041 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:29,043 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:28:29,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:28:29,044 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [719486604] [2024-10-24 16:28:29,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [719486604] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:29,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:29,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-10-24 16:28:29,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1502283550] [2024-10-24 16:28:29,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:29,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-24 16:28:29,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:28:29,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-24 16:28:29,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:28:29,046 INFO L87 Difference]: Start difference. First operand 123 states and 164 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:28:29,152 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:29,153 INFO L93 Difference]: Finished difference Result 131 states and 174 transitions. [2024-10-24 16:28:29,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:28:29,153 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2024-10-24 16:28:29,153 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:29,154 INFO L225 Difference]: With dead ends: 131 [2024-10-24 16:28:29,154 INFO L226 Difference]: Without dead ends: 131 [2024-10-24 16:28:29,154 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:28:29,154 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 22 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 201 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 201 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:29,154 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 411 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 201 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:28:29,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-24 16:28:29,159 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 124. [2024-10-24 16:28:29,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 124 states, 79 states have (on average 1.7341772151898733) internal successors, (137), 106 states have internal predecessors, (137), 11 states have call successors, (11), 3 states have call predecessors, (11), 4 states have return successors, (15), 14 states have call predecessors, (15), 11 states have call successors, (15) [2024-10-24 16:28:29,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 124 states to 124 states and 163 transitions. [2024-10-24 16:28:29,160 INFO L78 Accepts]: Start accepts. Automaton has 124 states and 163 transitions. Word has length 25 [2024-10-24 16:28:29,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:29,160 INFO L471 AbstractCegarLoop]: Abstraction has 124 states and 163 transitions. [2024-10-24 16:28:29,160 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:28:29,160 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 163 transitions. [2024-10-24 16:28:29,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 16:28:29,162 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:29,162 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] [2024-10-24 16:28:29,162 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-24 16:28:29,162 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-24 16:28:29,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:29,162 INFO L85 PathProgramCache]: Analyzing trace with hash 516984702, now seen corresponding path program 1 times [2024-10-24 16:28:29,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:28:29,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1516067864] [2024-10-24 16:28:29,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:29,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:28:29,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:29,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:28:29,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:29,369 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:28:29,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:29,417 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 16:28:29,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:29,435 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:28:29,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:28:29,435 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1516067864] [2024-10-24 16:28:29,435 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1516067864] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:29,435 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:29,436 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2024-10-24 16:28:29,436 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7204449] [2024-10-24 16:28:29,436 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:29,436 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-10-24 16:28:29,436 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:28:29,436 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-10-24 16:28:29,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=182, Unknown=0, NotChecked=0, Total=210 [2024-10-24 16:28:29,436 INFO L87 Difference]: Start difference. First operand 124 states and 163 transitions. Second operand has 15 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:28:29,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:29,711 INFO L93 Difference]: Finished difference Result 143 states and 188 transitions. [2024-10-24 16:28:29,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 16:28:29,711 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2024-10-24 16:28:29,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:29,712 INFO L225 Difference]: With dead ends: 143 [2024-10-24 16:28:29,712 INFO L226 Difference]: Without dead ends: 143 [2024-10-24 16:28:29,712 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=236, Unknown=0, NotChecked=0, Total=272 [2024-10-24 16:28:29,713 INFO L432 NwaCegarLoop]: 55 mSDtfsCounter, 26 mSDsluCounter, 495 mSDsCounter, 0 mSdLazyCounter, 604 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 612 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 604 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:29,713 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 550 Invalid, 612 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 604 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:28:29,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-24 16:28:29,717 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 134. [2024-10-24 16:28:29,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 88 states have (on average 1.6931818181818181) internal successors, (149), 115 states have internal predecessors, (149), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 15 states have call predecessors, (19), 11 states have call successors, (19) [2024-10-24 16:28:29,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 179 transitions. [2024-10-24 16:28:29,719 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 179 transitions. Word has length 25 [2024-10-24 16:28:29,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:29,719 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 179 transitions. [2024-10-24 16:28:29,719 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 10 states have (on average 1.9) internal successors, (19), 11 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:28:29,719 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 179 transitions. [2024-10-24 16:28:29,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-24 16:28:29,721 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:29,721 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] [2024-10-24 16:28:29,721 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-24 16:28:29,721 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-24 16:28:29,722 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:29,722 INFO L85 PathProgramCache]: Analyzing trace with hash 516984703, now seen corresponding path program 1 times [2024-10-24 16:28:29,722 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:28:29,722 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849655517] [2024-10-24 16:28:29,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:29,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:28:29,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:29,967 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:28:29,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:29,995 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:28:29,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:30,083 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 16:28:30,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:30,127 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:28:30,128 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:28:30,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849655517] [2024-10-24 16:28:30,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849655517] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:30,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:28:30,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2024-10-24 16:28:30,128 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [978435864] [2024-10-24 16:28:30,128 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:30,129 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 16:28:30,129 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:28:30,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 16:28:30,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=210, Unknown=0, NotChecked=0, Total=240 [2024-10-24 16:28:30,129 INFO L87 Difference]: Start difference. First operand 134 states and 179 transitions. Second operand has 16 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:28:30,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:30,443 INFO L93 Difference]: Finished difference Result 143 states and 187 transitions. [2024-10-24 16:28:30,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-24 16:28:30,443 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 25 [2024-10-24 16:28:30,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:30,444 INFO L225 Difference]: With dead ends: 143 [2024-10-24 16:28:30,444 INFO L226 Difference]: Without dead ends: 143 [2024-10-24 16:28:30,445 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=268, Unknown=0, NotChecked=0, Total=306 [2024-10-24 16:28:30,445 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 25 mSDsluCounter, 574 mSDsCounter, 0 mSdLazyCounter, 612 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 630 SdHoareTripleChecker+Invalid, 620 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 612 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:30,445 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 630 Invalid, 620 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 612 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:28:30,446 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-10-24 16:28:30,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 134. [2024-10-24 16:28:30,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 88 states have (on average 1.6818181818181819) internal successors, (148), 115 states have internal predecessors, (148), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 15 states have call predecessors, (19), 11 states have call successors, (19) [2024-10-24 16:28:30,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 178 transitions. [2024-10-24 16:28:30,452 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 178 transitions. Word has length 25 [2024-10-24 16:28:30,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:30,453 INFO L471 AbstractCegarLoop]: Abstraction has 134 states and 178 transitions. [2024-10-24 16:28:30,453 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 11 states have (on average 1.7272727272727273) internal successors, (19), 12 states have internal predecessors, (19), 3 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:28:30,453 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 178 transitions. [2024-10-24 16:28:30,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-24 16:28:30,453 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:30,453 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:28:30,453 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-10-24 16:28:30,453 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting create_internalErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-24 16:28:30,453 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:30,453 INFO L85 PathProgramCache]: Analyzing trace with hash -1667922174, now seen corresponding path program 1 times [2024-10-24 16:28:30,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:28:30,454 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780346094] [2024-10-24 16:28:30,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:30,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:28:30,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:30,541 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:28:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:30,546 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 16:28:30,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:30,550 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 16:28:30,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:30,565 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 16:28:30,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:30,608 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 16:28:30,608 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:28:30,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780346094] [2024-10-24 16:28:30,609 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780346094] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:28:30,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [972541949] [2024-10-24 16:28:30,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:30,609 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:28:30,609 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:28:30,612 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:28:30,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-24 16:28:30,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:30,712 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-10-24 16:28:30,714 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:30,716 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-10-24 16:28:30,731 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-10-24 16:28:30,735 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-10-24 16:28:30,750 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-10-24 16:28:30,760 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-24 16:28:30,760 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-10-24 16:28:30,766 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-24 16:28:30,767 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:28:30,841 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:28:30,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [972541949] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:28:30,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:28:30,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 7] total 12 [2024-10-24 16:28:30,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [578895191] [2024-10-24 16:28:30,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:28:30,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-10-24 16:28:30,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:28:30,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-10-24 16:28:30,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=104, Unknown=1, NotChecked=20, Total=156 [2024-10-24 16:28:30,843 INFO L87 Difference]: Start difference. First operand 134 states and 178 transitions. Second operand has 13 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 16:28:31,145 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:31,145 INFO L93 Difference]: Finished difference Result 133 states and 177 transitions. [2024-10-24 16:28:31,146 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 16:28:31,146 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) Word has length 28 [2024-10-24 16:28:31,146 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:31,147 INFO L225 Difference]: With dead ends: 133 [2024-10-24 16:28:31,147 INFO L226 Difference]: Without dead ends: 133 [2024-10-24 16:28:31,147 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 17 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=63, Invalid=246, Unknown=1, NotChecked=32, Total=342 [2024-10-24 16:28:31,147 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 25 mSDsluCounter, 277 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 347 SdHoareTripleChecker+Invalid, 460 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:31,148 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 347 Invalid, 460 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 349 Invalid, 0 Unknown, 95 Unchecked, 0.2s Time] [2024-10-24 16:28:31,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2024-10-24 16:28:31,153 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2024-10-24 16:28:31,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 88 states have (on average 1.6704545454545454) internal successors, (147), 114 states have internal predecessors, (147), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 15 states have call predecessors, (19), 11 states have call successors, (19) [2024-10-24 16:28:31,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 177 transitions. [2024-10-24 16:28:31,155 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 177 transitions. Word has length 28 [2024-10-24 16:28:31,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:31,155 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 177 transitions. [2024-10-24 16:28:31,155 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 10 states have (on average 2.6) internal successors, (26), 10 states have internal predecessors, (26), 2 states have call successors, (10), 4 states have call predecessors, (10), 5 states have return successors, (6), 3 states have call predecessors, (6), 2 states have call successors, (6) [2024-10-24 16:28:31,155 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 177 transitions. [2024-10-24 16:28:31,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-24 16:28:31,157 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:31,157 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:28:31,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-10-24 16:28:31,361 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,SelfDestructingSolverStorable15 [2024-10-24 16:28:31,362 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting create_internalErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-24 16:28:31,362 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:31,362 INFO L85 PathProgramCache]: Analyzing trace with hash -1667922173, now seen corresponding path program 1 times [2024-10-24 16:28:31,362 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:28:31,362 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331923967] [2024-10-24 16:28:31,363 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:31,363 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:28:31,376 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:31,584 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:28:31,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:31,588 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2024-10-24 16:28:31,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:31,591 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 16:28:31,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:31,628 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2024-10-24 16:28:31,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:31,671 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 7 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:28:31,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:28:31,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331923967] [2024-10-24 16:28:31,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331923967] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:28:31,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1874357184] [2024-10-24 16:28:31,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:31,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:28:31,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:28:31,673 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:28:31,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-24 16:28:31,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:31,777 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-24 16:28:31,779 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:31,783 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-10-24 16:28:31,816 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-10-24 16:28:31,821 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-10-24 16:28:31,840 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-10-24 16:28:31,864 WARN L873 $PredicateComparison]: unable to prove that (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= (store |c_old(#length)| alloc_and_zero_internal_~pi~1.base 8) |c_#length|)) is different from true [2024-10-24 16:28:31,899 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-24 16:28:31,899 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-10-24 16:28:31,909 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 2 not checked. [2024-10-24 16:28:31,909 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:28:31,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1874357184] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:28:31,974 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:28:31,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8] total 15 [2024-10-24 16:28:31,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620760313] [2024-10-24 16:28:31,974 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:28:31,975 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2024-10-24 16:28:31,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:28:31,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2024-10-24 16:28:31,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=229, Unknown=1, NotChecked=30, Total=306 [2024-10-24 16:28:31,976 INFO L87 Difference]: Start difference. First operand 133 states and 177 transitions. Second operand has 16 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-24 16:28:32,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:32,309 INFO L93 Difference]: Finished difference Result 131 states and 175 transitions. [2024-10-24 16:28:32,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 16:28:32,309 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 28 [2024-10-24 16:28:32,309 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:32,310 INFO L225 Difference]: With dead ends: 131 [2024-10-24 16:28:32,310 INFO L226 Difference]: Without dead ends: 131 [2024-10-24 16:28:32,311 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 28 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=71, Invalid=352, Unknown=1, NotChecked=38, Total=462 [2024-10-24 16:28:32,311 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 12 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 540 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 94 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:32,311 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 433 Invalid, 540 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 436 Invalid, 0 Unknown, 94 Unchecked, 0.2s Time] [2024-10-24 16:28:32,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-10-24 16:28:32,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 131. [2024-10-24 16:28:32,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 88 states have (on average 1.6477272727272727) internal successors, (145), 112 states have internal predecessors, (145), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 15 states have call predecessors, (19), 11 states have call successors, (19) [2024-10-24 16:28:32,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 175 transitions. [2024-10-24 16:28:32,315 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 175 transitions. Word has length 28 [2024-10-24 16:28:32,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:32,316 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 175 transitions. [2024-10-24 16:28:32,316 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 12 states have (on average 2.4166666666666665) internal successors, (29), 12 states have internal predecessors, (29), 3 states have call successors, (9), 3 states have call predecessors, (9), 5 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-24 16:28:32,316 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 175 transitions. [2024-10-24 16:28:32,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-10-24 16:28:32,316 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:32,317 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] [2024-10-24 16:28:32,329 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-10-24 16:28:32,520 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,SelfDestructingSolverStorable16 [2024-10-24 16:28:32,521 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-24 16:28:32,521 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:32,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1393785251, now seen corresponding path program 1 times [2024-10-24 16:28:32,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:28:32,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [532944972] [2024-10-24 16:28:32,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:32,521 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:28:32,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:32,814 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:28:32,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:32,868 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:28:32,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:32,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 16:28:32,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:33,045 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:28:33,045 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:28:33,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [532944972] [2024-10-24 16:28:33,046 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [532944972] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:28:33,046 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476657731] [2024-10-24 16:28:33,046 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:33,046 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:28:33,047 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:28:33,048 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:28:33,049 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-24 16:28:33,140 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:33,142 INFO L255 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-10-24 16:28:33,144 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:33,149 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-10-24 16:28:33,245 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-10-24 16:28:33,250 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-10-24 16:28:33,391 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:28:33,391 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-10-24 16:28:33,430 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 33 treesize of output 17 [2024-10-24 16:28:33,436 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 33 treesize of output 17 [2024-10-24 16:28:33,602 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:28:33,608 INFO L349 Elim1Store]: treesize reduction 29, result has 9.4 percent of original size [2024-10-24 16:28:33,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 63 treesize of output 31 [2024-10-24 16:28:33,618 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-24 16:28:33,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 16 [2024-10-24 16:28:33,621 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:28:33,622 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:28:34,139 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:28:34,139 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 724 treesize of output 710 [2024-10-24 16:28:34,214 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:28:34,214 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 5 new quantified variables, introduced 6 case distinctions, treesize of input 1986 treesize of output 1871 [2024-10-24 16:28:36,342 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476657731] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:28:36,343 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:28:36,343 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 17] total 31 [2024-10-24 16:28:36,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1533416642] [2024-10-24 16:28:36,346 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:28:36,346 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-10-24 16:28:36,346 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:28:36,347 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-10-24 16:28:36,347 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=1169, Unknown=0, NotChecked=0, Total=1260 [2024-10-24 16:28:36,347 INFO L87 Difference]: Start difference. First operand 131 states and 175 transitions. Second operand has 31 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 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-10-24 16:28:36,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:36,951 INFO L93 Difference]: Finished difference Result 135 states and 180 transitions. [2024-10-24 16:28:36,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 16:28:36,953 INFO L78 Accepts]: Start accepts. Automaton has has 31 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 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 27 [2024-10-24 16:28:36,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:36,954 INFO L225 Difference]: With dead ends: 135 [2024-10-24 16:28:36,954 INFO L226 Difference]: Without dead ends: 135 [2024-10-24 16:28:36,955 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=120, Invalid=1440, Unknown=0, NotChecked=0, Total=1560 [2024-10-24 16:28:36,955 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 18 mSDsluCounter, 1228 mSDsCounter, 0 mSdLazyCounter, 1117 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 1287 SdHoareTripleChecker+Invalid, 1124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:36,955 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 1287 Invalid, 1124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1117 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-24 16:28:36,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2024-10-24 16:28:36,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 132. [2024-10-24 16:28:36,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 89 states have (on average 1.6404494382022472) internal successors, (146), 113 states have internal predecessors, (146), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 15 states have call predecessors, (19), 11 states have call successors, (19) [2024-10-24 16:28:36,959 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 176 transitions. [2024-10-24 16:28:36,959 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 176 transitions. Word has length 27 [2024-10-24 16:28:36,960 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:36,960 INFO L471 AbstractCegarLoop]: Abstraction has 132 states and 176 transitions. [2024-10-24 16:28:36,960 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 23 states have (on average 1.6956521739130435) internal successors, (39), 23 states have internal predecessors, (39), 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-10-24 16:28:36,960 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 176 transitions. [2024-10-24 16:28:36,961 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-24 16:28:36,961 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:36,961 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] [2024-10-24 16:28:36,976 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-10-24 16:28:37,161 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:28:37,162 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 36 more)] === [2024-10-24 16:28:37,162 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:37,162 INFO L85 PathProgramCache]: Analyzing trace with hash -262943231, now seen corresponding path program 1 times [2024-10-24 16:28:37,162 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:28:37,162 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [371599991] [2024-10-24 16:28:37,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:37,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:28:37,174 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:37,423 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:28:37,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:37,495 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:28:37,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:37,564 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 16:28:37,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:37,625 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:28:37,625 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:28:37,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [371599991] [2024-10-24 16:28:37,625 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [371599991] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:28:37,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1398609921] [2024-10-24 16:28:37,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:37,625 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:28:37,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:28:37,627 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:28:37,628 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-24 16:28:37,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:37,722 INFO L255 TraceCheckSpWp]: Trace formula consists of 185 conjuncts, 29 conjuncts are in the unsatisfiable core [2024-10-24 16:28:37,725 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:37,821 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 19 treesize of output 1 [2024-10-24 16:28:37,859 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 8 [2024-10-24 16:28:37,873 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:28:37,873 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:28:37,874 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1398609921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:28:37,874 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 16:28:37,874 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [14] total 24 [2024-10-24 16:28:37,874 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375384231] [2024-10-24 16:28:37,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:28:37,874 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 16:28:37,874 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:28:37,875 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 16:28:37,875 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=501, Unknown=0, NotChecked=0, Total=552 [2024-10-24 16:28:37,875 INFO L87 Difference]: Start difference. First operand 132 states and 176 transitions. Second operand has 12 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:28:38,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:38,005 INFO L93 Difference]: Finished difference Result 138 states and 179 transitions. [2024-10-24 16:28:38,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-24 16:28:38,005 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 28 [2024-10-24 16:28:38,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:38,006 INFO L225 Difference]: With dead ends: 138 [2024-10-24 16:28:38,006 INFO L226 Difference]: Without dead ends: 138 [2024-10-24 16:28:38,007 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=591, Unknown=0, NotChecked=0, Total=650 [2024-10-24 16:28:38,007 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 25 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 570 SdHoareTripleChecker+Invalid, 307 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:38,008 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 570 Invalid, 307 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:28:38,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2024-10-24 16:28:38,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 133. [2024-10-24 16:28:38,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 90 states have (on average 1.6222222222222222) internal successors, (146), 114 states have internal predecessors, (146), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 15 states have call predecessors, (19), 11 states have call successors, (19) [2024-10-24 16:28:38,011 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 176 transitions. [2024-10-24 16:28:38,011 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 176 transitions. Word has length 28 [2024-10-24 16:28:38,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:38,011 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 176 transitions. [2024-10-24 16:28:38,011 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 2 states have call successors, (3), 1 states have call predecessors, (3), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:28:38,011 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 176 transitions. [2024-10-24 16:28:38,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-24 16:28:38,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:38,011 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] [2024-10-24 16:28:38,024 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-24 16:28:38,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:28:38,212 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-24 16:28:38,212 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:38,212 INFO L85 PathProgramCache]: Analyzing trace with hash 1485928130, now seen corresponding path program 1 times [2024-10-24 16:28:38,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:28:38,212 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615657395] [2024-10-24 16:28:38,212 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:38,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:28:38,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:38,459 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:28:38,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:38,529 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:28:38,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:38,594 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 16:28:38,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:38,660 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:28:38,661 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:28:38,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615657395] [2024-10-24 16:28:38,661 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615657395] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:28:38,661 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1967285325] [2024-10-24 16:28:38,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:38,661 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:28:38,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:28:38,663 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:28:38,667 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-24 16:28:38,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:38,757 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-24 16:28:38,759 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:38,761 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-10-24 16:28:38,778 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-10-24 16:28:38,782 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-10-24 16:28:38,789 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 19 treesize of output 18 [2024-10-24 16:28:38,793 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-10-24 16:28:38,891 WARN L873 $PredicateComparison]: unable to prove that (exists ((v_alloc_and_zero_internal_~pi~1.base_77 Int)) (and (= |c_#memory_$Pointer$#0.offset| (store |c_old(#memory_$Pointer$#0.offset)| v_alloc_and_zero_internal_~pi~1.base_77 (select |c_#memory_$Pointer$#0.offset| v_alloc_and_zero_internal_~pi~1.base_77))) (= (select |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_77) 0) (= (store |c_old(#memory_$Pointer$#0.base)| v_alloc_and_zero_internal_~pi~1.base_77 (select |c_#memory_$Pointer$#0.base| v_alloc_and_zero_internal_~pi~1.base_77)) |c_#memory_$Pointer$#0.base|))) is different from true [2024-10-24 16:28:38,940 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:28:38,941 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-10-24 16:28:38,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:28:38,945 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 16 [2024-10-24 16:28:38,951 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:28:38,951 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-10-24 16:28:38,997 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2024-10-24 16:28:39,000 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 27 treesize of output 17 [2024-10-24 16:28:39,017 INFO L349 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2024-10-24 16:28:39,017 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 31 [2024-10-24 16:28:39,127 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:28:39,127 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:28:39,444 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1967285325] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:28:39,445 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:28:39,445 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2024-10-24 16:28:39,445 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966029297] [2024-10-24 16:28:39,445 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:28:39,445 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-24 16:28:39,445 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:28:39,446 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-24 16:28:39,446 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=581, Unknown=1, NotChecked=48, Total=702 [2024-10-24 16:28:39,446 INFO L87 Difference]: Start difference. First operand 133 states and 176 transitions. Second operand has 23 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 17 states have internal predecessors, (45), 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-10-24 16:28:39,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:28:39,873 INFO L93 Difference]: Finished difference Result 137 states and 181 transitions. [2024-10-24 16:28:39,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 16:28:39,874 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 17 states have internal predecessors, (45), 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 30 [2024-10-24 16:28:39,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:28:39,874 INFO L225 Difference]: With dead ends: 137 [2024-10-24 16:28:39,875 INFO L226 Difference]: Without dead ends: 137 [2024-10-24 16:28:39,875 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 186 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=124, Invalid=1001, Unknown=1, NotChecked=64, Total=1190 [2024-10-24 16:28:39,875 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 10 mSDsluCounter, 576 mSDsCounter, 0 mSdLazyCounter, 496 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 636 SdHoareTripleChecker+Invalid, 618 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 496 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 103 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:28:39,875 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 636 Invalid, 618 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 496 Invalid, 0 Unknown, 103 Unchecked, 0.2s Time] [2024-10-24 16:28:39,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2024-10-24 16:28:39,878 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 136. [2024-10-24 16:28:39,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 93 states have (on average 1.6021505376344085) internal successors, (149), 117 states have internal predecessors, (149), 11 states have call successors, (11), 3 states have call predecessors, (11), 5 states have return successors, (19), 15 states have call predecessors, (19), 11 states have call successors, (19) [2024-10-24 16:28:39,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 179 transitions. [2024-10-24 16:28:39,879 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 179 transitions. Word has length 30 [2024-10-24 16:28:39,879 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:28:39,879 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 179 transitions. [2024-10-24 16:28:39,879 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 19 states have (on average 2.3684210526315788) internal successors, (45), 17 states have internal predecessors, (45), 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-10-24 16:28:39,879 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 179 transitions. [2024-10-24 16:28:39,879 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 16:28:39,879 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:28:39,880 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:28:39,894 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-10-24 16:28:40,080 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:28:40,080 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-24 16:28:40,081 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:28:40,081 INFO L85 PathProgramCache]: Analyzing trace with hash 63131556, now seen corresponding path program 2 times [2024-10-24 16:28:40,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:28:40,081 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988850537] [2024-10-24 16:28:40,081 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:28:40,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:28:40,092 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:40,207 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:28:40,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:40,224 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:28:40,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:40,596 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 16:28:40,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:40,639 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:28:40,643 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:40,726 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 16:28:40,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:28:40,953 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 2 proven. 12 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 16:28:40,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:28:40,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988850537] [2024-10-24 16:28:40,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988850537] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:28:40,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1225275172] [2024-10-24 16:28:40,954 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:28:40,954 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:28:40,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:28:40,955 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:28:40,956 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-24 16:28:41,071 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:28:41,071 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:28:41,073 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 37 conjuncts are in the unsatisfiable core [2024-10-24 16:28:41,076 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:28:41,082 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-10-24 16:28:41,105 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-10-24 16:28:45,212 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-10-24 16:28:45,268 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 49 treesize of output 41 [2024-10-24 16:28:49,380 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (and (exists ((v_prenex_22 Int)) (let ((.cse0 (store |c_old(#valid)| v_prenex_22 1))) (let ((.cse1 (@diff .cse0 |v_old(#valid)_AFTER_CALL_37|))) (and (= |v_old(#valid)_AFTER_CALL_37| (store .cse0 .cse1 (select |v_old(#valid)_AFTER_CALL_37| .cse1))) (= c_create_internal_~now~0.base .cse1))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_88 Int)) (= |c_#valid| (store (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_88 1) alloc_and_zero_internal_~pi~1.base 1)))) is different from false [2024-10-24 16:28:49,382 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (and (exists ((v_prenex_22 Int)) (let ((.cse0 (store |c_old(#valid)| v_prenex_22 1))) (let ((.cse1 (@diff .cse0 |v_old(#valid)_AFTER_CALL_37|))) (and (= |v_old(#valid)_AFTER_CALL_37| (store .cse0 .cse1 (select |v_old(#valid)_AFTER_CALL_37| .cse1))) (= c_create_internal_~now~0.base .cse1))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_88 Int)) (= |c_#valid| (store (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_88 1) alloc_and_zero_internal_~pi~1.base 1)))) is different from true [2024-10-24 16:28:49,397 WARN L851 $PredicateComparison]: unable to prove that (or (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_88 Int)) (= |c_#valid| (store (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_88 1) alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_prenex_22 Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse1 (store |c_old(#valid)| v_prenex_22 1))) (let ((.cse0 (@diff .cse1 |v_old(#valid)_AFTER_CALL_37|))) (and (= (select |c_#valid| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_37| (store .cse1 .cse0 (select |v_old(#valid)_AFTER_CALL_37| .cse0))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1))))))) is different from false [2024-10-24 16:28:49,398 WARN L873 $PredicateComparison]: unable to prove that (or (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_88 Int)) (= |c_#valid| (store (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_88 1) alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_prenex_22 Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse1 (store |c_old(#valid)| v_prenex_22 1))) (let ((.cse0 (@diff .cse1 |v_old(#valid)_AFTER_CALL_37|))) (and (= (select |c_#valid| .cse0) 1) (= |v_old(#valid)_AFTER_CALL_37| (store .cse1 .cse0 (select |v_old(#valid)_AFTER_CALL_37| .cse0))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1))))))) is different from true [2024-10-24 16:28:49,472 INFO L349 Elim1Store]: treesize reduction 111, result has 18.4 percent of original size [2024-10-24 16:28:49,472 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 60 treesize of output 141 [2024-10-24 16:28:49,700 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:28:49,709 INFO L349 Elim1Store]: treesize reduction 15, result has 40.0 percent of original size [2024-10-24 16:28:49,710 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 3 case distinctions, treesize of input 38 treesize of output 27 [2024-10-24 16:28:50,887 WARN L851 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimArr_4 (Array Int Int))) (and (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((v_prenex_22 Int)) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_prenex_24 Int) (v_DerPreprocessor_7 Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse0 (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|))) (let ((.cse1 (store (store (store |v_old(#valid)_AFTER_CALL_37| v_prenex_22 v_DerPreprocessor_7) .cse0 1) v_prenex_24 1))) (and (= v_arrayElimArr_4 (store (store |v_old(#valid)_AFTER_CALL_37| .cse0 (select v_arrayElimArr_4 .cse0)) v_prenex_22 1)) (= (select |c_#valid| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_37| v_prenex_22) 1) (= v_DerPreprocessor_7 (select .cse1 v_prenex_22)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1)) (= (select .cse1 |c_ULTIMATE.start_create_~now~1#1.base|) 1))))) (= (select v_arrayElimArr_4 v_prenex_22) 1))))) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (exists ((v_prenex_22 Int)) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_88 Int) (v_DerPreprocessor_7 Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse2 (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|))) (let ((.cse3 (store (store (store |v_old(#valid)_AFTER_CALL_37| v_prenex_22 v_DerPreprocessor_7) v_alloc_and_zero_internal_~pi~1.base_88 1) .cse2 1))) (and (= v_arrayElimArr_4 (store (store |v_old(#valid)_AFTER_CALL_37| .cse2 (select v_arrayElimArr_4 .cse2)) v_prenex_22 1)) (= (select |c_#valid| .cse2) 1) (= (select .cse3 |c_ULTIMATE.start_create_~now~1#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_37| v_prenex_22) 1) (= (select .cse3 v_prenex_22) v_DerPreprocessor_7) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1)))))) (= (select v_arrayElimArr_4 v_prenex_22) 1))) (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((v_prenex_22 Int)) (and (= (select v_arrayElimArr_4 v_prenex_22) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse4 (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|))) (let ((.cse5 (select v_arrayElimArr_4 .cse4))) (and (= v_arrayElimArr_4 (store (store |v_old(#valid)_AFTER_CALL_37| .cse4 .cse5) v_prenex_22 1)) (= (select |c_#valid| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_37| v_prenex_22) 1) (exists ((v_alloc_and_zero_internal_~pi~1.base_88 Int) (v_prenex_24 Int) (v_DerPreprocessor_7 Int)) (let ((.cse6 (store (store (store (store |v_old(#valid)_AFTER_CALL_37| v_prenex_22 v_DerPreprocessor_7) .cse4 .cse5) v_alloc_and_zero_internal_~pi~1.base_88 1) v_prenex_24 1))) (and (= (select .cse6 v_prenex_22) v_DerPreprocessor_7) (not (= .cse4 v_alloc_and_zero_internal_~pi~1.base_88)) (not (= .cse4 v_prenex_24)) (= (select .cse6 |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) (not (= .cse4 v_prenex_22)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1)))))))))) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_88 Int) (v_DerPreprocessor_8 Int) (v_prenex_24 Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse7 (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|))) (let ((.cse8 (store (store (store |v_old(#valid)_AFTER_CALL_37| .cse7 v_DerPreprocessor_8) v_alloc_and_zero_internal_~pi~1.base_88 1) v_prenex_24 1))) (and (= (select |c_#valid| .cse7) 1) (= (select .cse8 .cse7) v_DerPreprocessor_8) (= v_arrayElimArr_4 (store |v_old(#valid)_AFTER_CALL_37| .cse7 1)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1)) (= (select .cse8 |c_ULTIMATE.start_create_~now~1#1.base|) 1))))) (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (or (exists ((v_arrayElimArr_4 (Array Int Int))) (and (exists ((v_alloc_and_zero_internal_~pi~1.base_88 Int) (v_prenex_22 Int) (v_prenex_24 Int)) (and (= (select |c_#valid| v_alloc_and_zero_internal_~pi~1.base_88) 1) (= v_arrayElimArr_4 (store (store (store |c_#valid| v_alloc_and_zero_internal_~pi~1.base_88 (select v_arrayElimArr_4 v_alloc_and_zero_internal_~pi~1.base_88)) v_prenex_24 (select v_arrayElimArr_4 v_prenex_24)) v_prenex_22 1)) (= (select |c_#valid| v_prenex_24) 1))) (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_37| (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|)) 1)))) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (exists ((v_prenex_24 Int)) (and (exists ((v_alloc_and_zero_internal_~pi~1.base_88 Int)) (and (= (select |c_#valid| v_alloc_and_zero_internal_~pi~1.base_88) 1) (exists ((v_prenex_22 Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (not (= (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|) v_prenex_22))) (= v_arrayElimArr_4 (store (store (store |c_#valid| v_alloc_and_zero_internal_~pi~1.base_88 (select v_arrayElimArr_4 v_alloc_and_zero_internal_~pi~1.base_88)) v_prenex_24 (select v_arrayElimArr_4 v_prenex_24)) v_prenex_22 1)))))) (= (select |c_#valid| v_prenex_24) 1))) (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((v_prenex_24 Int)) (and (exists ((v_alloc_and_zero_internal_~pi~1.base_88 Int)) (and (= (select |c_#valid| v_alloc_and_zero_internal_~pi~1.base_88) 1) (exists ((|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (= v_arrayElimArr_4 (store (store (store |c_#valid| v_alloc_and_zero_internal_~pi~1.base_88 (select v_arrayElimArr_4 v_alloc_and_zero_internal_~pi~1.base_88)) v_prenex_24 (select v_arrayElimArr_4 v_prenex_24)) (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|) 1))))) (= (select |c_#valid| v_prenex_24) 1))))))) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse9 (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|))) (and (= (select |c_#valid| .cse9) 1) (= v_arrayElimArr_4 (store |v_old(#valid)_AFTER_CALL_37| .cse9 1)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1))))) (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) is different from false [2024-10-24 16:28:50,893 WARN L873 $PredicateComparison]: unable to prove that (or (exists ((v_arrayElimArr_4 (Array Int Int))) (and (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((v_prenex_22 Int)) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_prenex_24 Int) (v_DerPreprocessor_7 Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse0 (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|))) (let ((.cse1 (store (store (store |v_old(#valid)_AFTER_CALL_37| v_prenex_22 v_DerPreprocessor_7) .cse0 1) v_prenex_24 1))) (and (= v_arrayElimArr_4 (store (store |v_old(#valid)_AFTER_CALL_37| .cse0 (select v_arrayElimArr_4 .cse0)) v_prenex_22 1)) (= (select |c_#valid| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_37| v_prenex_22) 1) (= v_DerPreprocessor_7 (select .cse1 v_prenex_22)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1)) (= (select .cse1 |c_ULTIMATE.start_create_~now~1#1.base|) 1))))) (= (select v_arrayElimArr_4 v_prenex_22) 1))))) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (exists ((v_prenex_22 Int)) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_88 Int) (v_DerPreprocessor_7 Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse2 (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|))) (let ((.cse3 (store (store (store |v_old(#valid)_AFTER_CALL_37| v_prenex_22 v_DerPreprocessor_7) v_alloc_and_zero_internal_~pi~1.base_88 1) .cse2 1))) (and (= v_arrayElimArr_4 (store (store |v_old(#valid)_AFTER_CALL_37| .cse2 (select v_arrayElimArr_4 .cse2)) v_prenex_22 1)) (= (select |c_#valid| .cse2) 1) (= (select .cse3 |c_ULTIMATE.start_create_~now~1#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_37| v_prenex_22) 1) (= (select .cse3 v_prenex_22) v_DerPreprocessor_7) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1)))))) (= (select v_arrayElimArr_4 v_prenex_22) 1))) (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((v_prenex_22 Int)) (and (= (select v_arrayElimArr_4 v_prenex_22) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse4 (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|))) (let ((.cse5 (select v_arrayElimArr_4 .cse4))) (and (= v_arrayElimArr_4 (store (store |v_old(#valid)_AFTER_CALL_37| .cse4 .cse5) v_prenex_22 1)) (= (select |c_#valid| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_37| v_prenex_22) 1) (exists ((v_alloc_and_zero_internal_~pi~1.base_88 Int) (v_prenex_24 Int) (v_DerPreprocessor_7 Int)) (let ((.cse6 (store (store (store (store |v_old(#valid)_AFTER_CALL_37| v_prenex_22 v_DerPreprocessor_7) .cse4 .cse5) v_alloc_and_zero_internal_~pi~1.base_88 1) v_prenex_24 1))) (and (= (select .cse6 v_prenex_22) v_DerPreprocessor_7) (not (= .cse4 v_alloc_and_zero_internal_~pi~1.base_88)) (not (= .cse4 v_prenex_24)) (= (select .cse6 |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) (not (= .cse4 v_prenex_22)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1)))))))))) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_88 Int) (v_DerPreprocessor_8 Int) (v_prenex_24 Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse7 (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|))) (let ((.cse8 (store (store (store |v_old(#valid)_AFTER_CALL_37| .cse7 v_DerPreprocessor_8) v_alloc_and_zero_internal_~pi~1.base_88 1) v_prenex_24 1))) (and (= (select |c_#valid| .cse7) 1) (= (select .cse8 .cse7) v_DerPreprocessor_8) (= v_arrayElimArr_4 (store |v_old(#valid)_AFTER_CALL_37| .cse7 1)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1)) (= (select .cse8 |c_ULTIMATE.start_create_~now~1#1.base|) 1))))) (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (or (exists ((v_arrayElimArr_4 (Array Int Int))) (and (exists ((v_alloc_and_zero_internal_~pi~1.base_88 Int) (v_prenex_22 Int) (v_prenex_24 Int)) (and (= (select |c_#valid| v_alloc_and_zero_internal_~pi~1.base_88) 1) (= v_arrayElimArr_4 (store (store (store |c_#valid| v_alloc_and_zero_internal_~pi~1.base_88 (select v_arrayElimArr_4 v_alloc_and_zero_internal_~pi~1.base_88)) v_prenex_24 (select v_arrayElimArr_4 v_prenex_24)) v_prenex_22 1)) (= (select |c_#valid| v_prenex_24) 1))) (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_37| (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|)) 1)))) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (exists ((v_prenex_24 Int)) (and (exists ((v_alloc_and_zero_internal_~pi~1.base_88 Int)) (and (= (select |c_#valid| v_alloc_and_zero_internal_~pi~1.base_88) 1) (exists ((v_prenex_22 Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (not (= (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|) v_prenex_22))) (= v_arrayElimArr_4 (store (store (store |c_#valid| v_alloc_and_zero_internal_~pi~1.base_88 (select v_arrayElimArr_4 v_alloc_and_zero_internal_~pi~1.base_88)) v_prenex_24 (select v_arrayElimArr_4 v_prenex_24)) v_prenex_22 1)))))) (= (select |c_#valid| v_prenex_24) 1))) (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((v_prenex_24 Int)) (and (exists ((v_alloc_and_zero_internal_~pi~1.base_88 Int)) (and (= (select |c_#valid| v_alloc_and_zero_internal_~pi~1.base_88) 1) (exists ((|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (= v_arrayElimArr_4 (store (store (store |c_#valid| v_alloc_and_zero_internal_~pi~1.base_88 (select v_arrayElimArr_4 v_alloc_and_zero_internal_~pi~1.base_88)) v_prenex_24 (select v_arrayElimArr_4 v_prenex_24)) (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|) 1))))) (= (select |c_#valid| v_prenex_24) 1))))))) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse9 (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|))) (and (= (select |c_#valid| .cse9) 1) (= v_arrayElimArr_4 (store |v_old(#valid)_AFTER_CALL_37| .cse9 1)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1))))) (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) is different from true [2024-10-24 16:28:50,893 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 13 not checked. [2024-10-24 16:28:50,893 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:28:51,086 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1225275172] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:28:51,086 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:28:51,086 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 15] total 25 [2024-10-24 16:28:51,086 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2106629932] [2024-10-24 16:28:51,086 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:28:51,086 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-10-24 16:28:51,087 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:28:51,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-10-24 16:28:51,088 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=144, Invalid=465, Unknown=7, NotChecked=196, Total=812 [2024-10-24 16:28:51,088 INFO L87 Difference]: Start difference. First operand 136 states and 179 transitions. Second operand has 26 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 18 states have internal predecessors, (41), 8 states have call successors, (10), 3 states have call predecessors, (10), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-24 16:28:51,472 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse4))) (let ((.cse17 (store |c_old(#valid)| .cse4 .cse6))) (let ((.cse13 (@diff .cse17 |c_#valid|))) (let ((.cse7 (select |c_#valid| .cse13))) (let ((.cse14 (store .cse17 .cse13 .cse7))) (let ((.cse11 (@diff .cse14 |c_#valid|))) (let ((.cse10 (select |c_#valid| .cse11)) (.cse5 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse8 (= (select |c_old(#valid)| .cse13) 0)) (.cse9 (= |c_#valid| .cse17)) (.cse12 (= |c_#valid| .cse14)) (.cse2 (= |c_#valid| |c_old(#valid)|)) (.cse3 (= (select |c_old(#valid)| .cse4) 0))) (and (or (exists ((alloc_and_zero_internal_~pi~1.base Int)) (let ((.cse1 (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) (let ((.cse0 (@diff .cse1 |c_#valid|))) (and (= .cse0 |c_create_internal_#t~ret7.base|) (= |c_#valid| (store .cse1 .cse0 (select |c_#valid| .cse0))))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (or .cse2 .cse3 (= .cse4 .cse5)) (or .cse2 (= .cse4 |c_create_internal_#t~ret7.base|) .cse3) (or .cse2 .cse3 (= .cse6 1)) (or (= .cse7 1) .cse8 .cse9) (or (= .cse10 1) (= (select |c_old(#valid)| .cse11) 0) .cse12) (or (= .cse13 |c_create_internal_#t~ret7.base|) .cse8 .cse9) (= |c_#valid| (store .cse14 .cse11 .cse10)) (or (= .cse13 c_create_internal_~now~0.base) .cse8 .cse9) (or (= .cse13 .cse5) .cse8 .cse9) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (and (exists ((v_prenex_22 Int)) (let ((.cse15 (store |c_old(#valid)| v_prenex_22 1))) (let ((.cse16 (@diff .cse15 |v_old(#valid)_AFTER_CALL_37|))) (and (= |v_old(#valid)_AFTER_CALL_37| (store .cse15 .cse16 (select |v_old(#valid)_AFTER_CALL_37| .cse16))) (= c_create_internal_~now~0.base .cse16))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_88 Int)) (= |c_#valid| (store (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_88 1) alloc_and_zero_internal_~pi~1.base 1)))) .cse12 (or .cse2 .cse3 (= c_create_internal_~now~0.base .cse4))))))))))) is different from false [2024-10-24 16:28:51,478 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse4))) (let ((.cse17 (store |c_old(#valid)| .cse4 .cse6))) (let ((.cse13 (@diff .cse17 |c_#valid|))) (let ((.cse7 (select |c_#valid| .cse13))) (let ((.cse14 (store .cse17 .cse13 .cse7))) (let ((.cse11 (@diff .cse14 |c_#valid|))) (let ((.cse10 (select |c_#valid| .cse11)) (.cse5 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse8 (= (select |c_old(#valid)| .cse13) 0)) (.cse9 (= |c_#valid| .cse17)) (.cse12 (= |c_#valid| .cse14)) (.cse2 (= |c_#valid| |c_old(#valid)|)) (.cse3 (= (select |c_old(#valid)| .cse4) 0))) (and (or (exists ((alloc_and_zero_internal_~pi~1.base Int)) (let ((.cse1 (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) (let ((.cse0 (@diff .cse1 |c_#valid|))) (and (= .cse0 |c_create_internal_#t~ret7.base|) (= |c_#valid| (store .cse1 .cse0 (select |c_#valid| .cse0))))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (or .cse2 .cse3 (= .cse4 .cse5)) (or .cse2 (= .cse4 |c_create_internal_#t~ret7.base|) .cse3) (or .cse2 .cse3 (= .cse6 1)) (or (= .cse7 1) .cse8 .cse9) (or (= .cse10 1) (= (select |c_old(#valid)| .cse11) 0) .cse12) (or (= .cse13 |c_create_internal_#t~ret7.base|) .cse8 .cse9) (= |c_#valid| (store .cse14 .cse11 .cse10)) (or (= .cse13 c_create_internal_~now~0.base) .cse8 .cse9) (or (= .cse13 .cse5) .cse8 .cse9) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (and (exists ((v_prenex_22 Int)) (let ((.cse15 (store |c_old(#valid)| v_prenex_22 1))) (let ((.cse16 (@diff .cse15 |v_old(#valid)_AFTER_CALL_37|))) (and (= |v_old(#valid)_AFTER_CALL_37| (store .cse15 .cse16 (select |v_old(#valid)_AFTER_CALL_37| .cse16))) (= c_create_internal_~now~0.base .cse16))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_88 Int)) (= |c_#valid| (store (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_88 1) alloc_and_zero_internal_~pi~1.base 1)))) .cse12 (or .cse2 .cse3 (= c_create_internal_~now~0.base .cse4))))))))))) is different from true [2024-10-24 16:28:51,495 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse2))) (let ((.cse17 (store |c_old(#valid)| .cse2 .cse4))) (let ((.cse16 (@diff .cse17 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse16))) (let ((.cse11 (store .cse17 .cse16 .cse5))) (let ((.cse9 (@diff .cse11 |c_#valid|))) (let ((.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse2) 0)) (.cse8 (select |c_#valid| .cse9)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse6 (= (select |c_old(#valid)| .cse16) 0)) (.cse7 (= |c_#valid| .cse17)) (.cse10 (= |c_#valid| .cse11))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse0 .cse1 (= .cse4 1)) (or (= .cse5 1) .cse6 .cse7) (or (= .cse8 1) (= (select |c_old(#valid)| .cse9) 0) .cse10) (= |c_#valid| (store .cse11 .cse9 .cse8)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int)) (let ((.cse13 (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) (let ((.cse12 (@diff .cse13 |c_#valid|))) (and (= .cse12 .cse3) (= |c_#valid| (store .cse13 .cse12 (select |c_#valid| .cse12))))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (or (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_88 Int)) (= |c_#valid| (store (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_88 1) alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_prenex_22 Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse15 (store |c_old(#valid)| v_prenex_22 1))) (let ((.cse14 (@diff .cse15 |v_old(#valid)_AFTER_CALL_37|))) (and (= (select |c_#valid| .cse14) 1) (= |v_old(#valid)_AFTER_CALL_37| (store .cse15 .cse14 (select |v_old(#valid)_AFTER_CALL_37| .cse14))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1))))))) (or (= .cse16 .cse3) .cse6 .cse7) .cse10))))))))) is different from false [2024-10-24 16:28:51,500 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse2 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse2))) (let ((.cse17 (store |c_old(#valid)| .cse2 .cse4))) (let ((.cse16 (@diff .cse17 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse16))) (let ((.cse11 (store .cse17 .cse16 .cse5))) (let ((.cse9 (@diff .cse11 |c_#valid|))) (let ((.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse2) 0)) (.cse8 (select |c_#valid| .cse9)) (.cse3 (select (select |c_#memory_$Pointer$#0.base| c_create_internal_~now~0.base) c_create_internal_~now~0.offset)) (.cse6 (= (select |c_old(#valid)| .cse16) 0)) (.cse7 (= |c_#valid| .cse17)) (.cse10 (= |c_#valid| .cse11))) (and (or .cse0 .cse1 (= .cse2 .cse3)) (or .cse0 .cse1 (= .cse4 1)) (or (= .cse5 1) .cse6 .cse7) (or (= .cse8 1) (= (select |c_old(#valid)| .cse9) 0) .cse10) (= |c_#valid| (store .cse11 .cse9 .cse8)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int)) (let ((.cse13 (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1))) (let ((.cse12 (@diff .cse13 |c_#valid|))) (and (= .cse12 .cse3) (= |c_#valid| (store .cse13 .cse12 (select |c_#valid| .cse12))))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) (or (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_88 Int)) (= |c_#valid| (store (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_88 1) alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_prenex_22 Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse15 (store |c_old(#valid)| v_prenex_22 1))) (let ((.cse14 (@diff .cse15 |v_old(#valid)_AFTER_CALL_37|))) (and (= (select |c_#valid| .cse14) 1) (= |v_old(#valid)_AFTER_CALL_37| (store .cse15 .cse14 (select |v_old(#valid)_AFTER_CALL_37| .cse14))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1))))))) (or (= .cse16 .cse3) .cse6 .cse7) .cse10))))))))) is different from true [2024-10-24 16:28:51,509 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse2 (select |c_#valid| .cse15))) (let ((.cse16 (store |c_old(#valid)| .cse15 .cse2))) (let ((.cse10 (@diff .cse16 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse10))) (let ((.cse9 (store .cse16 .cse10 .cse3))) (let ((.cse7 (@diff .cse9 |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse7)) (.cse4 (= (select |c_old(#valid)| .cse10) 0)) (.cse5 (= |c_#valid| .cse16)) (.cse8 (= |c_#valid| .cse9)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse15) 0))) (and (or .cse0 .cse1 (= .cse2 1)) (or (= .cse3 1) .cse4 .cse5) (or (= .cse6 1) (= (select |c_old(#valid)| .cse7) 0) .cse8) (= |c_#valid| (store .cse9 .cse7 .cse6)) (or (= .cse10 c_create_internal_~now~0.base) .cse4 .cse5) (or (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_88 Int)) (= |c_#valid| (store (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_88 1) alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_prenex_22 Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse12 (store |c_old(#valid)| v_prenex_22 1))) (let ((.cse11 (@diff .cse12 |v_old(#valid)_AFTER_CALL_37|))) (and (= (select |c_#valid| .cse11) 1) (= |v_old(#valid)_AFTER_CALL_37| (store .cse12 .cse11 (select |v_old(#valid)_AFTER_CALL_37| .cse11))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1))))))) (or (exists ((v_prenex_22 Int)) (let ((.cse13 (store |c_old(#valid)| v_prenex_22 1))) (let ((.cse14 (@diff .cse13 |c_#valid|))) (and (= |c_#valid| (store .cse13 .cse14 (select |c_#valid| .cse14))) (= .cse14 c_create_internal_~now~0.base))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) .cse8 (or .cse0 .cse1 (= c_create_internal_~now~0.base .cse15))))))))))) is different from false [2024-10-24 16:28:51,514 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse15 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse2 (select |c_#valid| .cse15))) (let ((.cse16 (store |c_old(#valid)| .cse15 .cse2))) (let ((.cse10 (@diff .cse16 |c_#valid|))) (let ((.cse3 (select |c_#valid| .cse10))) (let ((.cse9 (store .cse16 .cse10 .cse3))) (let ((.cse7 (@diff .cse9 |c_#valid|))) (let ((.cse6 (select |c_#valid| .cse7)) (.cse4 (= (select |c_old(#valid)| .cse10) 0)) (.cse5 (= |c_#valid| .cse16)) (.cse8 (= |c_#valid| .cse9)) (.cse0 (= |c_#valid| |c_old(#valid)|)) (.cse1 (= (select |c_old(#valid)| .cse15) 0))) (and (or .cse0 .cse1 (= .cse2 1)) (or (= .cse3 1) .cse4 .cse5) (or (= .cse6 1) (= (select |c_old(#valid)| .cse7) 0) .cse8) (= |c_#valid| (store .cse9 .cse7 .cse6)) (or (= .cse10 c_create_internal_~now~0.base) .cse4 .cse5) (or (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_88 Int)) (= |c_#valid| (store (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_88 1) alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_prenex_22 Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse12 (store |c_old(#valid)| v_prenex_22 1))) (let ((.cse11 (@diff .cse12 |v_old(#valid)_AFTER_CALL_37|))) (and (= (select |c_#valid| .cse11) 1) (= |v_old(#valid)_AFTER_CALL_37| (store .cse12 .cse11 (select |v_old(#valid)_AFTER_CALL_37| .cse11))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1))))))) (or (exists ((v_prenex_22 Int)) (let ((.cse13 (store |c_old(#valid)| v_prenex_22 1))) (let ((.cse14 (@diff .cse13 |c_#valid|))) (and (= |c_#valid| (store .cse13 .cse14 (select |c_#valid| .cse14))) (= .cse14 c_create_internal_~now~0.base))))) (exists ((alloc_and_zero_internal_~pi~1.base Int)) (= |c_#valid| (store |c_old(#valid)| alloc_and_zero_internal_~pi~1.base 1)))) .cse8 (or .cse0 .cse1 (= c_create_internal_~now~0.base .cse15))))))))))) is different from true [2024-10-24 16:28:59,594 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (select |c_#valid| .cse0))) (let ((.cse4 (store |c_old(#valid)| .cse0 .cse1))) (let ((.cse3 (@diff .cse4 |c_#valid|))) (let ((.cse2 (select |c_#valid| .cse3))) (let ((.cse7 (store .cse4 .cse3 .cse2))) (let ((.cse6 (@diff .cse7 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (and (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse0) 0) (= .cse1 1)) (or (= .cse2 1) (= (select |c_old(#valid)| .cse3) 0) (= |c_#valid| .cse4)) (or (= .cse5 1) (= (select |c_old(#valid)| .cse6) 0) (= |c_#valid| .cse7)) (= |c_#valid| (store .cse7 .cse6 .cse5)) (or (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_88 Int)) (= |c_#valid| (store (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_88 1) alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_prenex_22 Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse9 (store |c_old(#valid)| v_prenex_22 1))) (let ((.cse8 (@diff .cse9 |v_old(#valid)_AFTER_CALL_37|))) (and (= (select |c_#valid| .cse8) 1) (= |v_old(#valid)_AFTER_CALL_37| (store .cse9 .cse8 (select |v_old(#valid)_AFTER_CALL_37| .cse8))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1)))))))))))))))) is different from false [2024-10-24 16:28:59,598 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse1 (select |c_#valid| .cse0))) (let ((.cse4 (store |c_old(#valid)| .cse0 .cse1))) (let ((.cse3 (@diff .cse4 |c_#valid|))) (let ((.cse2 (select |c_#valid| .cse3))) (let ((.cse7 (store .cse4 .cse3 .cse2))) (let ((.cse6 (@diff .cse7 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (and (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse0) 0) (= .cse1 1)) (or (= .cse2 1) (= (select |c_old(#valid)| .cse3) 0) (= |c_#valid| .cse4)) (or (= .cse5 1) (= (select |c_old(#valid)| .cse6) 0) (= |c_#valid| .cse7)) (= |c_#valid| (store .cse7 .cse6 .cse5)) (or (and (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_88 Int)) (= |c_#valid| (store (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_88 1) alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_prenex_22 Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse9 (store |c_old(#valid)| v_prenex_22 1))) (let ((.cse8 (@diff .cse9 |v_old(#valid)_AFTER_CALL_37|))) (and (= (select |c_#valid| .cse8) 1) (= |v_old(#valid)_AFTER_CALL_37| (store .cse9 .cse8 (select |v_old(#valid)_AFTER_CALL_37| .cse8))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1)))))))))))))))) is different from true [2024-10-24 16:29:00,203 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse9 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and (or (exists ((v_arrayElimArr_4 (Array Int Int))) (and (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((v_prenex_22 Int)) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_prenex_24 Int) (v_DerPreprocessor_7 Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse0 (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|))) (let ((.cse1 (store (store (store |v_old(#valid)_AFTER_CALL_37| v_prenex_22 v_DerPreprocessor_7) .cse0 1) v_prenex_24 1))) (and (= v_arrayElimArr_4 (store (store |v_old(#valid)_AFTER_CALL_37| .cse0 (select v_arrayElimArr_4 .cse0)) v_prenex_22 1)) (= (select |c_#valid| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_37| v_prenex_22) 1) (= v_DerPreprocessor_7 (select .cse1 v_prenex_22)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1)) (= (select .cse1 |c_ULTIMATE.start_create_~now~1#1.base|) 1))))) (= (select v_arrayElimArr_4 v_prenex_22) 1))))) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (exists ((v_prenex_22 Int)) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_88 Int) (v_DerPreprocessor_7 Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse2 (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|))) (let ((.cse3 (store (store (store |v_old(#valid)_AFTER_CALL_37| v_prenex_22 v_DerPreprocessor_7) v_alloc_and_zero_internal_~pi~1.base_88 1) .cse2 1))) (and (= v_arrayElimArr_4 (store (store |v_old(#valid)_AFTER_CALL_37| .cse2 (select v_arrayElimArr_4 .cse2)) v_prenex_22 1)) (= (select |c_#valid| .cse2) 1) (= (select .cse3 |c_ULTIMATE.start_create_~now~1#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_37| v_prenex_22) 1) (= (select .cse3 v_prenex_22) v_DerPreprocessor_7) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1)))))) (= (select v_arrayElimArr_4 v_prenex_22) 1))) (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((v_prenex_22 Int)) (and (= (select v_arrayElimArr_4 v_prenex_22) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse4 (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|))) (let ((.cse5 (select v_arrayElimArr_4 .cse4))) (and (= v_arrayElimArr_4 (store (store |v_old(#valid)_AFTER_CALL_37| .cse4 .cse5) v_prenex_22 1)) (= (select |c_#valid| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_37| v_prenex_22) 1) (exists ((v_alloc_and_zero_internal_~pi~1.base_88 Int) (v_prenex_24 Int) (v_DerPreprocessor_7 Int)) (let ((.cse6 (store (store (store (store |v_old(#valid)_AFTER_CALL_37| v_prenex_22 v_DerPreprocessor_7) .cse4 .cse5) v_alloc_and_zero_internal_~pi~1.base_88 1) v_prenex_24 1))) (and (= (select .cse6 v_prenex_22) v_DerPreprocessor_7) (not (= .cse4 v_alloc_and_zero_internal_~pi~1.base_88)) (not (= .cse4 v_prenex_24)) (= (select .cse6 |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) (not (= .cse4 v_prenex_22)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1)))))))))) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_88 Int) (v_DerPreprocessor_8 Int) (v_prenex_24 Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse7 (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|))) (let ((.cse8 (store (store (store |v_old(#valid)_AFTER_CALL_37| .cse7 v_DerPreprocessor_8) v_alloc_and_zero_internal_~pi~1.base_88 1) v_prenex_24 1))) (and (= (select |c_#valid| .cse7) 1) (= (select .cse8 .cse7) v_DerPreprocessor_8) (= v_arrayElimArr_4 (store |v_old(#valid)_AFTER_CALL_37| .cse7 1)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1)) (= (select .cse8 |c_ULTIMATE.start_create_~now~1#1.base|) 1))))) (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse9 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (or (exists ((v_arrayElimArr_4 (Array Int Int))) (and (exists ((v_alloc_and_zero_internal_~pi~1.base_88 Int) (v_prenex_22 Int) (v_prenex_24 Int)) (and (= (select |c_#valid| v_alloc_and_zero_internal_~pi~1.base_88) 1) (= v_arrayElimArr_4 (store (store (store |c_#valid| v_alloc_and_zero_internal_~pi~1.base_88 (select v_arrayElimArr_4 v_alloc_and_zero_internal_~pi~1.base_88)) v_prenex_24 (select v_arrayElimArr_4 v_prenex_24)) v_prenex_22 1)) (= (select |c_#valid| v_prenex_24) 1))) (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_37| (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|)) 1)))) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (exists ((v_prenex_24 Int)) (and (exists ((v_alloc_and_zero_internal_~pi~1.base_88 Int)) (and (= (select |c_#valid| v_alloc_and_zero_internal_~pi~1.base_88) 1) (exists ((v_prenex_22 Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (not (= (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|) v_prenex_22))) (= v_arrayElimArr_4 (store (store (store |c_#valid| v_alloc_and_zero_internal_~pi~1.base_88 (select v_arrayElimArr_4 v_alloc_and_zero_internal_~pi~1.base_88)) v_prenex_24 (select v_arrayElimArr_4 v_prenex_24)) v_prenex_22 1)))))) (= (select |c_#valid| v_prenex_24) 1))) (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((v_prenex_24 Int)) (and (exists ((v_alloc_and_zero_internal_~pi~1.base_88 Int)) (and (= (select |c_#valid| v_alloc_and_zero_internal_~pi~1.base_88) 1) (exists ((|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (= v_arrayElimArr_4 (store (store (store |c_#valid| v_alloc_and_zero_internal_~pi~1.base_88 (select v_arrayElimArr_4 v_alloc_and_zero_internal_~pi~1.base_88)) v_prenex_24 (select v_arrayElimArr_4 v_prenex_24)) (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|) 1))))) (= (select |c_#valid| v_prenex_24) 1))))))) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse10 (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|))) (and (= (select |c_#valid| .cse10) 1) (= v_arrayElimArr_4 (store |v_old(#valid)_AFTER_CALL_37| .cse10 1)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1))))) (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) .cse9)) is different from false [2024-10-24 16:29:00,208 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (= (select |c_#valid| |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and (or (exists ((v_arrayElimArr_4 (Array Int Int))) (and (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((v_prenex_22 Int)) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_prenex_24 Int) (v_DerPreprocessor_7 Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse0 (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|))) (let ((.cse1 (store (store (store |v_old(#valid)_AFTER_CALL_37| v_prenex_22 v_DerPreprocessor_7) .cse0 1) v_prenex_24 1))) (and (= v_arrayElimArr_4 (store (store |v_old(#valid)_AFTER_CALL_37| .cse0 (select v_arrayElimArr_4 .cse0)) v_prenex_22 1)) (= (select |c_#valid| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_37| v_prenex_22) 1) (= v_DerPreprocessor_7 (select .cse1 v_prenex_22)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1)) (= (select .cse1 |c_ULTIMATE.start_create_~now~1#1.base|) 1))))) (= (select v_arrayElimArr_4 v_prenex_22) 1))))) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (exists ((v_prenex_22 Int)) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_88 Int) (v_DerPreprocessor_7 Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse2 (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|))) (let ((.cse3 (store (store (store |v_old(#valid)_AFTER_CALL_37| v_prenex_22 v_DerPreprocessor_7) v_alloc_and_zero_internal_~pi~1.base_88 1) .cse2 1))) (and (= v_arrayElimArr_4 (store (store |v_old(#valid)_AFTER_CALL_37| .cse2 (select v_arrayElimArr_4 .cse2)) v_prenex_22 1)) (= (select |c_#valid| .cse2) 1) (= (select .cse3 |c_ULTIMATE.start_create_~now~1#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_37| v_prenex_22) 1) (= (select .cse3 v_prenex_22) v_DerPreprocessor_7) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1)))))) (= (select v_arrayElimArr_4 v_prenex_22) 1))) (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((v_prenex_22 Int)) (and (= (select v_arrayElimArr_4 v_prenex_22) 1) (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse4 (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|))) (let ((.cse5 (select v_arrayElimArr_4 .cse4))) (and (= v_arrayElimArr_4 (store (store |v_old(#valid)_AFTER_CALL_37| .cse4 .cse5) v_prenex_22 1)) (= (select |c_#valid| .cse4) 1) (= (select |v_old(#valid)_AFTER_CALL_37| v_prenex_22) 1) (exists ((v_alloc_and_zero_internal_~pi~1.base_88 Int) (v_prenex_24 Int) (v_DerPreprocessor_7 Int)) (let ((.cse6 (store (store (store (store |v_old(#valid)_AFTER_CALL_37| v_prenex_22 v_DerPreprocessor_7) .cse4 .cse5) v_alloc_and_zero_internal_~pi~1.base_88 1) v_prenex_24 1))) (and (= (select .cse6 v_prenex_22) v_DerPreprocessor_7) (not (= .cse4 v_alloc_and_zero_internal_~pi~1.base_88)) (not (= .cse4 v_prenex_24)) (= (select .cse6 |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) (not (= .cse4 v_prenex_22)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1)))))))))) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_88 Int) (v_DerPreprocessor_8 Int) (v_prenex_24 Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse7 (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|))) (let ((.cse8 (store (store (store |v_old(#valid)_AFTER_CALL_37| .cse7 v_DerPreprocessor_8) v_alloc_and_zero_internal_~pi~1.base_88 1) v_prenex_24 1))) (and (= (select |c_#valid| .cse7) 1) (= (select .cse8 .cse7) v_DerPreprocessor_8) (= v_arrayElimArr_4 (store |v_old(#valid)_AFTER_CALL_37| .cse7 1)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1)) (= (select .cse8 |c_ULTIMATE.start_create_~now~1#1.base|) 1))))) (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (and .cse9 (exists ((create_internal_~now~0.base Int)) (= (select |c_#valid| create_internal_~now~0.base) 1)) (or (exists ((v_arrayElimArr_4 (Array Int Int))) (and (exists ((v_alloc_and_zero_internal_~pi~1.base_88 Int) (v_prenex_22 Int) (v_prenex_24 Int)) (and (= (select |c_#valid| v_alloc_and_zero_internal_~pi~1.base_88) 1) (= v_arrayElimArr_4 (store (store (store |c_#valid| v_alloc_and_zero_internal_~pi~1.base_88 (select v_arrayElimArr_4 v_alloc_and_zero_internal_~pi~1.base_88)) v_prenex_24 (select v_arrayElimArr_4 v_prenex_24)) v_prenex_22 1)) (= (select |c_#valid| v_prenex_24) 1))) (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (= (select |v_old(#valid)_AFTER_CALL_37| (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|)) 1)))) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (exists ((v_prenex_24 Int)) (and (exists ((v_alloc_and_zero_internal_~pi~1.base_88 Int)) (and (= (select |c_#valid| v_alloc_and_zero_internal_~pi~1.base_88) 1) (exists ((v_prenex_22 Int)) (and (exists ((|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (not (= (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|) v_prenex_22))) (= v_arrayElimArr_4 (store (store (store |c_#valid| v_alloc_and_zero_internal_~pi~1.base_88 (select v_arrayElimArr_4 v_alloc_and_zero_internal_~pi~1.base_88)) v_prenex_24 (select v_arrayElimArr_4 v_prenex_24)) v_prenex_22 1)))))) (= (select |c_#valid| v_prenex_24) 1))) (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1))) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1) (exists ((v_prenex_24 Int)) (and (exists ((v_alloc_and_zero_internal_~pi~1.base_88 Int)) (and (= (select |c_#valid| v_alloc_and_zero_internal_~pi~1.base_88) 1) (exists ((|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (= v_arrayElimArr_4 (store (store (store |c_#valid| v_alloc_and_zero_internal_~pi~1.base_88 (select v_arrayElimArr_4 v_alloc_and_zero_internal_~pi~1.base_88)) v_prenex_24 (select v_arrayElimArr_4 v_prenex_24)) (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|) 1))))) (= (select |c_#valid| v_prenex_24) 1))))))) (exists ((v_arrayElimArr_4 (Array Int Int))) (and (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (let ((.cse10 (@diff v_arrayElimArr_4 |v_old(#valid)_AFTER_CALL_37|))) (and (= (select |c_#valid| .cse10) 1) (= v_arrayElimArr_4 (store |v_old(#valid)_AFTER_CALL_37| .cse10 1)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1))))) (= (select v_arrayElimArr_4 |c_ULTIMATE.start_create_~now~1#1.base|) 1)))) .cse9)) is different from true [2024-10-24 16:29:00,318 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (let ((.cse7 (store |c_old(#valid)| .cse3 .cse4))) (let ((.cse6 (@diff .cse7 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (let ((.cse2 (store .cse7 .cse6 .cse5))) (let ((.cse1 (@diff .cse2 |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse1))) (and (or (= .cse0 1) (= (select |c_old(#valid)| .cse1) 0) (= .cse1 c_create_internal_~now~0.base) (= |c_#valid| .cse2)) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse3) 0) (= .cse4 1) (= c_create_internal_~now~0.base .cse3)) (= |c_#valid| (store .cse2 .cse1 .cse0)) (or (= .cse5 1) (= .cse6 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse6) 0) (= |c_#valid| .cse7)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (and (exists ((v_prenex_22 Int)) (let ((.cse8 (store |c_old(#valid)| v_prenex_22 1))) (let ((.cse9 (@diff .cse8 |v_old(#valid)_AFTER_CALL_37|))) (and (= |v_old(#valid)_AFTER_CALL_37| (store .cse8 .cse9 (select |v_old(#valid)_AFTER_CALL_37| .cse9))) (= c_create_internal_~now~0.base .cse9))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_88 Int)) (= |c_#valid| (store (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_88 1) alloc_and_zero_internal_~pi~1.base 1))))))))))))) is different from false [2024-10-24 16:29:00,322 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (@diff |c_old(#valid)| |c_#valid|))) (let ((.cse4 (select |c_#valid| .cse3))) (let ((.cse7 (store |c_old(#valid)| .cse3 .cse4))) (let ((.cse6 (@diff .cse7 |c_#valid|))) (let ((.cse5 (select |c_#valid| .cse6))) (let ((.cse2 (store .cse7 .cse6 .cse5))) (let ((.cse1 (@diff .cse2 |c_#valid|))) (let ((.cse0 (select |c_#valid| .cse1))) (and (or (= .cse0 1) (= (select |c_old(#valid)| .cse1) 0) (= .cse1 c_create_internal_~now~0.base) (= |c_#valid| .cse2)) (or (= |c_#valid| |c_old(#valid)|) (= (select |c_old(#valid)| .cse3) 0) (= .cse4 1) (= c_create_internal_~now~0.base .cse3)) (= |c_#valid| (store .cse2 .cse1 .cse0)) (or (= .cse5 1) (= .cse6 c_create_internal_~now~0.base) (= (select |c_old(#valid)| .cse6) 0) (= |c_#valid| .cse7)) (or (exists ((alloc_and_zero_internal_~pi~1.base Int) (|v_old(#valid)_AFTER_CALL_37| (Array Int Int))) (and (exists ((v_prenex_22 Int)) (let ((.cse8 (store |c_old(#valid)| v_prenex_22 1))) (let ((.cse9 (@diff .cse8 |v_old(#valid)_AFTER_CALL_37|))) (and (= |v_old(#valid)_AFTER_CALL_37| (store .cse8 .cse9 (select |v_old(#valid)_AFTER_CALL_37| .cse9))) (= c_create_internal_~now~0.base .cse9))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_37| alloc_and_zero_internal_~pi~1.base 1)))) (exists ((alloc_and_zero_internal_~pi~1.base Int) (v_alloc_and_zero_internal_~pi~1.base_88 Int)) (= |c_#valid| (store (store |c_old(#valid)| v_alloc_and_zero_internal_~pi~1.base_88 1) alloc_and_zero_internal_~pi~1.base 1))))))))))))) is different from true [2024-10-24 16:29:00,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:00,533 INFO L93 Difference]: Finished difference Result 159 states and 218 transitions. [2024-10-24 16:29:00,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-24 16:29:00,534 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 18 states have internal predecessors, (41), 8 states have call successors, (10), 3 states have call predecessors, (10), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) Word has length 34 [2024-10-24 16:29:00,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:00,534 INFO L225 Difference]: With dead ends: 159 [2024-10-24 16:29:00,534 INFO L226 Difference]: Without dead ends: 159 [2024-10-24 16:29:00,535 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 40 SyntacticMatches, 5 SemanticMatches, 37 ConstructedPredicates, 10 IntricatePredicates, 0 DeprecatedPredicates, 195 ImplicationChecksByTransitivity, 18.2s TimeCoverageRelationStatistics Valid=221, Invalid=612, Unknown=19, NotChecked=630, Total=1482 [2024-10-24 16:29:00,535 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 24 mSDsluCounter, 570 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 779 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:00,535 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 626 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 733 Invalid, 0 Unknown, 779 Unchecked, 0.6s Time] [2024-10-24 16:29:00,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2024-10-24 16:29:00,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 144. [2024-10-24 16:29:00,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 99 states have (on average 1.5858585858585859) internal successors, (157), 123 states have internal predecessors, (157), 12 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (24), 17 states have call predecessors, (24), 12 states have call successors, (24) [2024-10-24 16:29:00,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 193 transitions. [2024-10-24 16:29:00,539 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 193 transitions. Word has length 34 [2024-10-24 16:29:00,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:00,539 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 193 transitions. [2024-10-24 16:29:00,539 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 21 states have (on average 1.9523809523809523) internal successors, (41), 18 states have internal predecessors, (41), 8 states have call successors, (10), 3 states have call predecessors, (10), 7 states have return successors, (9), 9 states have call predecessors, (9), 8 states have call successors, (9) [2024-10-24 16:29:00,539 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 193 transitions. [2024-10-24 16:29:00,539 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-10-24 16:29:00,540 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:00,540 INFO L215 NwaCegarLoop]: trace histogram [3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:00,552 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-24 16:29:00,740 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,SelfDestructingSolverStorable20 [2024-10-24 16:29:00,740 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-24 16:29:00,740 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:00,741 INFO L85 PathProgramCache]: Analyzing trace with hash 63131557, now seen corresponding path program 2 times [2024-10-24 16:29:00,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:00,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1024839904] [2024-10-24 16:29:00,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:00,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:00,912 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:29:00,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:00,954 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:29:00,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:01,433 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 16:29:01,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:01,535 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:29:01,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:01,923 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 15 [2024-10-24 16:29:01,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:02,264 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 16:29:02,265 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:02,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1024839904] [2024-10-24 16:29:02,265 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1024839904] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:29:02,265 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1008923868] [2024-10-24 16:29:02,265 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-10-24 16:29:02,265 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:29:02,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:29:02,267 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:29:02,268 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-24 16:29:02,384 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-10-24 16:29:02,384 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-10-24 16:29:02,386 INFO L255 TraceCheckSpWp]: Trace formula consists of 266 conjuncts, 61 conjuncts are in the unsatisfiable core [2024-10-24 16:29:02,388 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:29:02,392 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-10-24 16:29:02,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 16:29:02,603 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))) (= (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-10-24 16:29:02,682 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-10-24 16:29:02,922 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:29:02,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 152 treesize of output 258 [2024-10-24 16:29:02,976 INFO L349 Elim1Store]: treesize reduction 160, result has 14.4 percent of original size [2024-10-24 16:29:02,976 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 71 treesize of output 112 [2024-10-24 16:29:04,426 INFO L349 Elim1Store]: treesize reduction 90, result has 1.1 percent of original size [2024-10-24 16:29:04,426 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 8 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 43 treesize of output 11 [2024-10-24 16:29:04,597 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 6 not checked. [2024-10-24 16:29:04,597 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:29:04,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1008923868] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:29:04,807 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:29:04,807 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 15] total 31 [2024-10-24 16:29:04,807 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417896449] [2024-10-24 16:29:04,807 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:29:04,807 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-24 16:29:04,807 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:04,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-24 16:29:04,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=133, Invalid=865, Unknown=2, NotChecked=122, Total=1122 [2024-10-24 16:29:04,808 INFO L87 Difference]: Start difference. First operand 144 states and 193 transitions. Second operand has 32 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 9 states have call successors, (10), 3 states have call predecessors, (10), 10 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2024-10-24 16:29:06,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:06,043 INFO L93 Difference]: Finished difference Result 160 states and 216 transitions. [2024-10-24 16:29:06,045 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 16:29:06,045 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 9 states have call successors, (10), 3 states have call predecessors, (10), 10 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) Word has length 34 [2024-10-24 16:29:06,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:06,046 INFO L225 Difference]: With dead ends: 160 [2024-10-24 16:29:06,046 INFO L226 Difference]: Without dead ends: 160 [2024-10-24 16:29:06,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 386 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=195, Invalid=1293, Unknown=2, NotChecked=150, Total=1640 [2024-10-24 16:29:06,046 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 55 mSDsluCounter, 515 mSDsCounter, 0 mSdLazyCounter, 929 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 574 SdHoareTripleChecker+Invalid, 1238 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 929 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 272 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:06,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 574 Invalid, 1238 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 929 Invalid, 0 Unknown, 272 Unchecked, 0.8s Time] [2024-10-24 16:29:06,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2024-10-24 16:29:06,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 145. [2024-10-24 16:29:06,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 100 states have (on average 1.6) internal successors, (160), 124 states have internal predecessors, (160), 12 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (24), 17 states have call predecessors, (24), 12 states have call successors, (24) [2024-10-24 16:29:06,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 196 transitions. [2024-10-24 16:29:06,054 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 196 transitions. Word has length 34 [2024-10-24 16:29:06,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:06,054 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 196 transitions. [2024-10-24 16:29:06,054 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 23 states have (on average 2.0) internal successors, (46), 23 states have internal predecessors, (46), 9 states have call successors, (10), 3 states have call predecessors, (10), 10 states have return successors, (10), 10 states have call predecessors, (10), 9 states have call successors, (10) [2024-10-24 16:29:06,055 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 196 transitions. [2024-10-24 16:29:06,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 16:29:06,055 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:06,055 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:06,071 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-24 16:29:06,255 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,SelfDestructingSolverStorable21 [2024-10-24 16:29:06,256 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-24 16:29:06,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:06,256 INFO L85 PathProgramCache]: Analyzing trace with hash -1000905399, now seen corresponding path program 1 times [2024-10-24 16:29:06,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:06,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [113382450] [2024-10-24 16:29:06,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:06,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:06,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:06,420 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:29:06,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:06,448 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:29:06,453 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:06,507 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 16:29:06,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:06,510 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:29:06,511 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:06,512 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:29:06,513 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:06,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [113382450] [2024-10-24 16:29:06,513 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [113382450] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:29:06,513 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1551507242] [2024-10-24 16:29:06,513 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:06,513 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:29:06,513 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:29:06,514 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:29:06,515 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-24 16:29:06,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:06,613 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-10-24 16:29:06,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:29:06,650 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 19 treesize of output 1 [2024-10-24 16:29:06,676 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 21 treesize of output 9 [2024-10-24 16:29:06,677 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:29:06,677 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:29:06,686 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 28 [2024-10-24 16:29:06,751 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-24 16:29:06,752 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 11 [2024-10-24 16:29:06,766 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:29:06,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1551507242] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-24 16:29:06,767 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-24 16:29:06,767 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 9, 9] total 19 [2024-10-24 16:29:06,767 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774236902] [2024-10-24 16:29:06,767 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-24 16:29:06,769 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2024-10-24 16:29:06,769 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:06,770 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2024-10-24 16:29:06,770 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=332, Unknown=0, NotChecked=0, Total=380 [2024-10-24 16:29:06,770 INFO L87 Difference]: Start difference. First operand 145 states and 196 transitions. Second operand has 20 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-24 16:29:07,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:07,153 INFO L93 Difference]: Finished difference Result 162 states and 215 transitions. [2024-10-24 16:29:07,153 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-24 16:29:07,154 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) Word has length 33 [2024-10-24 16:29:07,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:07,154 INFO L225 Difference]: With dead ends: 162 [2024-10-24 16:29:07,154 INFO L226 Difference]: Without dead ends: 162 [2024-10-24 16:29:07,155 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 66 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2024-10-24 16:29:07,155 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 23 mSDsluCounter, 850 mSDsCounter, 0 mSdLazyCounter, 787 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 920 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 787 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:07,155 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 920 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 787 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-24 16:29:07,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2024-10-24 16:29:07,158 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 153. [2024-10-24 16:29:07,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 108 states have (on average 1.5740740740740742) internal successors, (170), 131 states have internal predecessors, (170), 12 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2024-10-24 16:29:07,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 206 transitions. [2024-10-24 16:29:07,159 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 206 transitions. Word has length 33 [2024-10-24 16:29:07,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:07,159 INFO L471 AbstractCegarLoop]: Abstraction has 153 states and 206 transitions. [2024-10-24 16:29:07,159 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 15 states have (on average 2.466666666666667) internal successors, (37), 15 states have internal predecessors, (37), 5 states have call successors, (8), 2 states have call predecessors, (8), 3 states have return successors, (8), 6 states have call predecessors, (8), 5 states have call successors, (8) [2024-10-24 16:29:07,159 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 206 transitions. [2024-10-24 16:29:07,160 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 16:29:07,160 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:07,160 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:07,173 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-24 16:29:07,360 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,SelfDestructingSolverStorable22 [2024-10-24 16:29:07,360 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-24 16:29:07,361 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:07,361 INFO L85 PathProgramCache]: Analyzing trace with hash -1000905398, now seen corresponding path program 1 times [2024-10-24 16:29:07,361 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:07,361 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263690146] [2024-10-24 16:29:07,361 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:07,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:07,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:07,573 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:29:07,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:07,603 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:29:07,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:07,716 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 16:29:07,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:07,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:29:07,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:07,751 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:29:07,751 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:07,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263690146] [2024-10-24 16:29:07,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [263690146] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:29:07,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1814989837] [2024-10-24 16:29:07,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:07,752 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:29:07,752 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:29:07,753 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:29:07,755 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-24 16:29:07,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:07,869 INFO L255 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-10-24 16:29:07,871 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:29:07,891 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-10-24 16:29:07,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-10-24 16:29:07,989 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-10-24 16:29:07,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:29:07,998 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-10-24 16:29:08,003 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:29:08,003 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-10-24 16:29:08,039 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 19 treesize of output 1 [2024-10-24 16:29:08,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2024-10-24 16:29:08,087 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 21 treesize of output 9 [2024-10-24 16:29:08,091 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-24 16:29:08,091 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:29:08,164 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 30 treesize of output 24 [2024-10-24 16:29:08,175 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:29:08,176 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:29:08,177 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:29:08,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-24 16:29:08,280 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-24 16:29:08,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1814989837] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:29:08,382 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-10-24 16:29:08,382 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 14] total 27 [2024-10-24 16:29:08,382 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [707688109] [2024-10-24 16:29:08,382 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-10-24 16:29:08,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2024-10-24 16:29:08,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:08,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2024-10-24 16:29:08,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=1031, Unknown=1, NotChecked=64, Total=1190 [2024-10-24 16:29:08,383 INFO L87 Difference]: Start difference. First operand 153 states and 206 transitions. Second operand has 28 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 6 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-24 16:29:08,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:08,792 INFO L93 Difference]: Finished difference Result 167 states and 220 transitions. [2024-10-24 16:29:08,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-24 16:29:08,792 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 6 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 33 [2024-10-24 16:29:08,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:08,793 INFO L225 Difference]: With dead ends: 167 [2024-10-24 16:29:08,793 INFO L226 Difference]: Without dead ends: 167 [2024-10-24 16:29:08,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 240 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=124, Invalid=1361, Unknown=1, NotChecked=74, Total=1560 [2024-10-24 16:29:08,794 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 45 mSDsluCounter, 778 mSDsCounter, 0 mSdLazyCounter, 815 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 830 SdHoareTripleChecker+Invalid, 978 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 815 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 146 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:08,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 830 Invalid, 978 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 815 Invalid, 0 Unknown, 146 Unchecked, 0.3s Time] [2024-10-24 16:29:08,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2024-10-24 16:29:08,797 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 158. [2024-10-24 16:29:08,797 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 113 states have (on average 1.5486725663716814) internal successors, (175), 136 states have internal predecessors, (175), 12 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2024-10-24 16:29:08,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 211 transitions. [2024-10-24 16:29:08,798 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 211 transitions. Word has length 33 [2024-10-24 16:29:08,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:08,798 INFO L471 AbstractCegarLoop]: Abstraction has 158 states and 211 transitions. [2024-10-24 16:29:08,798 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 21 states have (on average 2.0952380952380953) internal successors, (44), 21 states have internal predecessors, (44), 6 states have call successors, (8), 3 states have call predecessors, (8), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2024-10-24 16:29:08,798 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 211 transitions. [2024-10-24 16:29:08,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-24 16:29:08,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:08,799 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] [2024-10-24 16:29:08,812 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2024-10-24 16:29:09,003 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,SelfDestructingSolverStorable23 [2024-10-24 16:29:09,004 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-24 16:29:09,004 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:09,004 INFO L85 PathProgramCache]: Analyzing trace with hash 2047760161, now seen corresponding path program 1 times [2024-10-24 16:29:09,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:09,004 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463929719] [2024-10-24 16:29:09,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:09,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:09,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:09,045 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:29:09,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:09,048 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:29:09,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:09,051 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 16:29:09,052 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:09,053 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 16:29:09,053 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:09,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463929719] [2024-10-24 16:29:09,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1463929719] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:09,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:09,054 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-24 16:29:09,054 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592419537] [2024-10-24 16:29:09,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:09,054 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-24 16:29:09,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:09,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-24 16:29:09,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2024-10-24 16:29:09,054 INFO L87 Difference]: Start difference. First operand 158 states and 211 transitions. Second operand has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:29:09,185 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:09,185 INFO L93 Difference]: Finished difference Result 190 states and 247 transitions. [2024-10-24 16:29:09,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-24 16:29:09,186 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) Word has length 32 [2024-10-24 16:29:09,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:09,186 INFO L225 Difference]: With dead ends: 190 [2024-10-24 16:29:09,186 INFO L226 Difference]: Without dead ends: 190 [2024-10-24 16:29:09,186 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-10-24 16:29:09,187 INFO L432 NwaCegarLoop]: 46 mSDtfsCounter, 34 mSDsluCounter, 177 mSDsCounter, 0 mSdLazyCounter, 275 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 223 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:09,187 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 223 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 275 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:29:09,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 190 states. [2024-10-24 16:29:09,190 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 190 to 171. [2024-10-24 16:29:09,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 127 states have (on average 1.5748031496062993) internal successors, (200), 149 states have internal predecessors, (200), 12 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2024-10-24 16:29:09,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 236 transitions. [2024-10-24 16:29:09,191 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 236 transitions. Word has length 32 [2024-10-24 16:29:09,191 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:09,191 INFO L471 AbstractCegarLoop]: Abstraction has 171 states and 236 transitions. [2024-10-24 16:29:09,191 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.333333333333333) internal successors, (26), 6 states have internal predecessors, (26), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 2 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:29:09,191 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 236 transitions. [2024-10-24 16:29:09,191 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-10-24 16:29:09,191 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:09,191 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] [2024-10-24 16:29:09,191 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2024-10-24 16:29:09,192 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-24 16:29:09,192 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:09,192 INFO L85 PathProgramCache]: Analyzing trace with hash 2047760162, now seen corresponding path program 1 times [2024-10-24 16:29:09,192 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:09,192 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [649978702] [2024-10-24 16:29:09,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:09,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:09,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:09,297 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:29:09,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:09,323 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:29:09,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:09,328 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 16:29:09,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:09,331 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:29:09,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:09,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [649978702] [2024-10-24 16:29:09,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [649978702] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:29:09,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1132627965] [2024-10-24 16:29:09,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:09,331 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:29:09,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:29:09,333 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:29:09,334 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-24 16:29:09,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:09,439 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-10-24 16:29:09,440 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:29:09,551 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 16:29:09,551 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-10-24 16:29:09,551 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1132627965] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:09,551 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-10-24 16:29:09,551 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [10] total 17 [2024-10-24 16:29:09,551 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [960149858] [2024-10-24 16:29:09,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:09,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:29:09,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:09,552 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:29:09,552 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=264, Unknown=0, NotChecked=0, Total=306 [2024-10-24 16:29:09,553 INFO L87 Difference]: Start difference. First operand 171 states and 236 transitions. Second operand has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:29:09,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:09,704 INFO L93 Difference]: Finished difference Result 203 states and 273 transitions. [2024-10-24 16:29:09,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:29:09,704 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 32 [2024-10-24 16:29:09,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:09,705 INFO L225 Difference]: With dead ends: 203 [2024-10-24 16:29:09,706 INFO L226 Difference]: Without dead ends: 203 [2024-10-24 16:29:09,706 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=296, Unknown=0, NotChecked=0, Total=342 [2024-10-24 16:29:09,707 INFO L432 NwaCegarLoop]: 50 mSDtfsCounter, 29 mSDsluCounter, 319 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 369 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:09,707 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [30 Valid, 369 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:29:09,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 203 states. [2024-10-24 16:29:09,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 203 to 181. [2024-10-24 16:29:09,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 137 states have (on average 1.5912408759124088) internal successors, (218), 159 states have internal predecessors, (218), 12 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2024-10-24 16:29:09,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 254 transitions. [2024-10-24 16:29:09,713 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 254 transitions. Word has length 32 [2024-10-24 16:29:09,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:09,713 INFO L471 AbstractCegarLoop]: Abstraction has 181 states and 254 transitions. [2024-10-24 16:29:09,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 8 states have internal predecessors, (26), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2024-10-24 16:29:09,714 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 254 transitions. [2024-10-24 16:29:09,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-10-24 16:29:09,714 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:09,714 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] [2024-10-24 16:29:09,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-24 16:29:09,914 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:29:09,915 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_LEAK === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-24 16:29:09,915 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:09,915 INFO L85 PathProgramCache]: Analyzing trace with hash -943945021, now seen corresponding path program 1 times [2024-10-24 16:29:09,916 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:09,916 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2013675350] [2024-10-24 16:29:09,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:09,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:09,927 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:09,966 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:29:09,968 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:09,982 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:29:09,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:09,986 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 16:29:09,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:09,988 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-10-24 16:29:09,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:09,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2013675350] [2024-10-24 16:29:09,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2013675350] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:09,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:09,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2024-10-24 16:29:09,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [372213097] [2024-10-24 16:29:09,989 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:09,989 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-24 16:29:09,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:09,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-24 16:29:09,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:29:09,989 INFO L87 Difference]: Start difference. First operand 181 states and 254 transitions. Second operand has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:29:10,111 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:10,111 INFO L93 Difference]: Finished difference Result 204 states and 284 transitions. [2024-10-24 16:29:10,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-10-24 16:29:10,112 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 33 [2024-10-24 16:29:10,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:10,113 INFO L225 Difference]: With dead ends: 204 [2024-10-24 16:29:10,113 INFO L226 Difference]: Without dead ends: 204 [2024-10-24 16:29:10,113 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=57, Unknown=0, NotChecked=0, Total=72 [2024-10-24 16:29:10,113 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 37 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 256 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 256 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:10,113 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [39 Valid, 402 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 256 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-24 16:29:10,114 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2024-10-24 16:29:10,117 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 182. [2024-10-24 16:29:10,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 138 states have (on average 1.5724637681159421) internal successors, (217), 160 states have internal predecessors, (217), 12 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2024-10-24 16:29:10,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 253 transitions. [2024-10-24 16:29:10,118 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 253 transitions. Word has length 33 [2024-10-24 16:29:10,118 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:10,118 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 253 transitions. [2024-10-24 16:29:10,118 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.375) internal successors, (27), 7 states have internal predecessors, (27), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2024-10-24 16:29:10,119 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 253 transitions. [2024-10-24 16:29:10,119 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-24 16:29:10,119 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:10,119 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] [2024-10-24 16:29:10,119 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2024-10-24 16:29:10,119 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-24 16:29:10,119 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:10,120 INFO L85 PathProgramCache]: Analyzing trace with hash -2000287545, now seen corresponding path program 1 times [2024-10-24 16:29:10,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:10,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236665542] [2024-10-24 16:29:10,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:10,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:10,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:10,212 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:29:10,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:10,215 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:29:10,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:10,219 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 16:29:10,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:10,221 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 16:29:10,223 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:10,241 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 16:29:10,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:10,270 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 16:29:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:10,317 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 9 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-10-24 16:29:10,318 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:10,318 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236665542] [2024-10-24 16:29:10,318 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236665542] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:10,318 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:10,318 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-10-24 16:29:10,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [114393708] [2024-10-24 16:29:10,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:10,318 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-10-24 16:29:10,318 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:10,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-10-24 16:29:10,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2024-10-24 16:29:10,320 INFO L87 Difference]: Start difference. First operand 182 states and 253 transitions. Second operand has 11 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-24 16:29:10,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:10,514 INFO L93 Difference]: Finished difference Result 185 states and 259 transitions. [2024-10-24 16:29:10,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 16:29:10,514 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 38 [2024-10-24 16:29:10,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:10,515 INFO L225 Difference]: With dead ends: 185 [2024-10-24 16:29:10,515 INFO L226 Difference]: Without dead ends: 185 [2024-10-24 16:29:10,515 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=37, Invalid=145, Unknown=0, NotChecked=0, Total=182 [2024-10-24 16:29:10,516 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 10 mSDsluCounter, 275 mSDsCounter, 0 mSdLazyCounter, 339 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 339 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:10,516 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 333 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 339 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:29:10,516 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-24 16:29:10,519 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-10-24 16:29:10,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 141 states have (on average 1.5815602836879432) internal successors, (223), 160 states have internal predecessors, (223), 12 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (24), 21 states have call predecessors, (24), 12 states have call successors, (24) [2024-10-24 16:29:10,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 259 transitions. [2024-10-24 16:29:10,520 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 259 transitions. Word has length 38 [2024-10-24 16:29:10,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:10,520 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 259 transitions. [2024-10-24 16:29:10,521 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 8 states have (on average 3.125) internal successors, (25), 9 states have internal predecessors, (25), 3 states have call successors, (5), 1 states have call predecessors, (5), 4 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-24 16:29:10,521 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 259 transitions. [2024-10-24 16:29:10,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-10-24 16:29:10,521 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:10,521 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] [2024-10-24 16:29:10,521 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2024-10-24 16:29:10,522 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-24 16:29:10,522 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:10,522 INFO L85 PathProgramCache]: Analyzing trace with hash -2000287544, now seen corresponding path program 1 times [2024-10-24 16:29:10,522 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:10,522 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1026530374] [2024-10-24 16:29:10,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:10,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:10,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:10,689 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:29:10,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:10,693 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:29:10,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:10,695 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 16:29:10,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:10,697 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2024-10-24 16:29:10,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:10,746 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 27 [2024-10-24 16:29:10,749 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:10,782 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 16:29:10,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:10,817 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-10-24 16:29:10,817 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:10,817 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1026530374] [2024-10-24 16:29:10,817 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1026530374] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-24 16:29:10,817 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-24 16:29:10,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-10-24 16:29:10,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7732014] [2024-10-24 16:29:10,818 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-24 16:29:10,818 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-10-24 16:29:10,818 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-24 16:29:10,818 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-10-24 16:29:10,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2024-10-24 16:29:10,819 INFO L87 Difference]: Start difference. First operand 185 states and 259 transitions. Second operand has 12 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-24 16:29:11,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-24 16:29:11,063 INFO L93 Difference]: Finished difference Result 185 states and 256 transitions. [2024-10-24 16:29:11,063 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-24 16:29:11,063 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) Word has length 38 [2024-10-24 16:29:11,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-24 16:29:11,065 INFO L225 Difference]: With dead ends: 185 [2024-10-24 16:29:11,066 INFO L226 Difference]: Without dead ends: 185 [2024-10-24 16:29:11,066 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=171, Unknown=0, NotChecked=0, Total=210 [2024-10-24 16:29:11,066 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 6 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 499 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 503 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 499 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-24 16:29:11,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 404 Invalid, 503 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 499 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-24 16:29:11,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2024-10-24 16:29:11,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2024-10-24 16:29:11,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 141 states have (on average 1.5602836879432624) internal successors, (220), 160 states have internal predecessors, (220), 12 states have call successors, (12), 3 states have call predecessors, (12), 6 states have return successors, (24), 21 states have call predecessors, (24), 12 states have call successors, (24) [2024-10-24 16:29:11,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 256 transitions. [2024-10-24 16:29:11,074 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 256 transitions. Word has length 38 [2024-10-24 16:29:11,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-24 16:29:11,074 INFO L471 AbstractCegarLoop]: Abstraction has 185 states and 256 transitions. [2024-10-24 16:29:11,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 3 states have call successors, (5), 1 states have call predecessors, (5), 3 states have return successors, (6), 4 states have call predecessors, (6), 3 states have call successors, (6) [2024-10-24 16:29:11,074 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 256 transitions. [2024-10-24 16:29:11,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2024-10-24 16:29:11,074 INFO L207 NwaCegarLoop]: Found error trace [2024-10-24 16:29:11,075 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-24 16:29:11,075 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2024-10-24 16:29:11,075 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [alloc_and_zeroErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, alloc_and_zeroErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 36 more)] === [2024-10-24 16:29:11,075 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-24 16:29:11,075 INFO L85 PathProgramCache]: Analyzing trace with hash 202708328, now seen corresponding path program 1 times [2024-10-24 16:29:11,078 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-24 16:29:11,078 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1716306743] [2024-10-24 16:29:11,078 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:11,078 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-24 16:29:11,089 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:11,329 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 1 [2024-10-24 16:29:11,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:11,379 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:29:11,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:11,572 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 0 [2024-10-24 16:29:11,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:11,619 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-10-24 16:29:11,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:11,642 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-24 16:29:11,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-24 16:29:11,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1716306743] [2024-10-24 16:29:11,643 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1716306743] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-24 16:29:11,643 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [604328726] [2024-10-24 16:29:11,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-24 16:29:11,643 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-24 16:29:11,643 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-24 16:29:11,644 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-24 16:29:11,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-24 16:29:11,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-24 16:29:11,767 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 71 conjuncts are in the unsatisfiable core [2024-10-24 16:29:11,769 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-24 16:29:11,771 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-10-24 16:29:11,871 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-10-24 16:29:11,899 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-24 16:29:11,946 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-24 16:29:11,946 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-10-24 16:29:11,974 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 19 treesize of output 1 [2024-10-24 16:29:11,978 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 35 treesize of output 19 [2024-10-24 16:29:12,041 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 19 treesize of output 7 [2024-10-24 16:29:12,084 INFO L349 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2024-10-24 16:29:12,084 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 16 [2024-10-24 16:29:12,086 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-24 16:29:12,086 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-24 16:29:12,240 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 30 treesize of output 24 [2024-10-24 16:29:17,701 INFO L349 Elim1Store]: treesize reduction 198, result has 57.0 percent of original size [2024-10-24 16:29:17,702 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 10 select indices, 10 select index equivalence classes, 0 disjoint index pairs (out of 45 index pairs), introduced 11 new quantified variables, introduced 45 case distinctions, treesize of input 1832 treesize of output 1858 [2024-10-24 16:29:17,987 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-24 16:29:17,988 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 9 select indices, 9 select index equivalence classes, 0 disjoint index pairs (out of 36 index pairs), introduced 9 new quantified variables, introduced 36 case distinctions, treesize of input 1038 treesize of output 1285