./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0220.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 3061b6dc Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0220.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1080615baa8f6ab055f34c400ddd3cb1288c5bcfd5f3427bea182230e940eff7 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-assert-order-craig-3061b6d-m [2024-11-19 06:41:21,952 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-19 06:41:22,012 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-19 06:41:22,016 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-19 06:41:22,016 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-19 06:41:22,042 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-19 06:41:22,043 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-19 06:41:22,043 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-19 06:41:22,044 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-19 06:41:22,044 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-19 06:41:22,045 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-19 06:41:22,045 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-19 06:41:22,046 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-19 06:41:22,050 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-19 06:41:22,050 INFO L153 SettingsManager]: * Use SBE=true [2024-11-19 06:41:22,051 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-19 06:41:22,051 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-19 06:41:22,051 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-19 06:41:22,051 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-19 06:41:22,052 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-19 06:41:22,052 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-19 06:41:22,053 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-19 06:41:22,054 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-19 06:41:22,054 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-19 06:41:22,054 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-19 06:41:22,054 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-19 06:41:22,055 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-19 06:41:22,055 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-19 06:41:22,055 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-19 06:41:22,055 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-19 06:41:22,056 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-19 06:41:22,056 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-19 06:41:22,057 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-19 06:41:22,057 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:41:22,058 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-19 06:41:22,058 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-19 06:41:22,058 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-19 06:41:22,058 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-19 06:41:22,059 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-19 06:41:22,059 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-19 06:41:22,059 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-19 06:41:22,059 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-19 06:41:22,060 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1080615baa8f6ab055f34c400ddd3cb1288c5bcfd5f3427bea182230e940eff7 [2024-11-19 06:41:22,304 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-19 06:41:22,331 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-19 06:41:22,336 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-19 06:41:22,337 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-19 06:41:22,337 INFO L274 PluginConnector]: CDTParser initialized [2024-11-19 06:41:22,338 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0220.i [2024-11-19 06:41:23,899 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-19 06:41:24,158 INFO L384 CDTParser]: Found 1 translation units. [2024-11-19 06:41:24,159 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0220.i [2024-11-19 06:41:24,173 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c4012b82/53cdd471c6de467b89f39c8fde7b8401/FLAG30e4dc460 [2024-11-19 06:41:24,186 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5c4012b82/53cdd471c6de467b89f39c8fde7b8401 [2024-11-19 06:41:24,188 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-19 06:41:24,190 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-19 06:41:24,191 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-19 06:41:24,191 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-19 06:41:24,196 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-19 06:41:24,196 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:41:24" (1/1) ... [2024-11-19 06:41:24,197 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@499ddcd6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24, skipping insertion in model container [2024-11-19 06:41:24,197 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 06:41:24" (1/1) ... [2024-11-19 06:41:24,242 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-19 06:41:24,641 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:41:24,655 INFO L200 MainTranslator]: Completed pre-run [2024-11-19 06:41:24,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-19 06:41:24,794 INFO L204 MainTranslator]: Completed translation [2024-11-19 06:41:24,795 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24 WrapperNode [2024-11-19 06:41:24,795 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-19 06:41:24,796 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-19 06:41:24,796 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-19 06:41:24,797 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-19 06:41:24,804 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24" (1/1) ... [2024-11-19 06:41:24,822 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24" (1/1) ... [2024-11-19 06:41:24,851 INFO L138 Inliner]: procedures = 180, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 117 [2024-11-19 06:41:24,851 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-19 06:41:24,852 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-19 06:41:24,852 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-19 06:41:24,853 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-19 06:41:24,863 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24" (1/1) ... [2024-11-19 06:41:24,863 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24" (1/1) ... [2024-11-19 06:41:24,867 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24" (1/1) ... [2024-11-19 06:41:24,890 INFO L175 MemorySlicer]: Split 22 memory accesses to 3 slices as follows [2, 8, 12]. 55 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 8 writes are split as follows [0, 2, 6]. [2024-11-19 06:41:24,891 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24" (1/1) ... [2024-11-19 06:41:24,891 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24" (1/1) ... [2024-11-19 06:41:24,903 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24" (1/1) ... [2024-11-19 06:41:24,907 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24" (1/1) ... [2024-11-19 06:41:24,909 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24" (1/1) ... [2024-11-19 06:41:24,911 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24" (1/1) ... [2024-11-19 06:41:24,914 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-19 06:41:24,915 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-19 06:41:24,915 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-19 06:41:24,915 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-19 06:41:24,917 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24" (1/1) ... [2024-11-19 06:41:24,931 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-19 06:41:24,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:41:24,957 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-19 06:41:24,959 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-19 06:41:24,999 INFO L130 BoogieDeclarations]: Found specification of procedure calloc_model [2024-11-19 06:41:25,000 INFO L138 BoogieDeclarations]: Found implementation of procedure calloc_model [2024-11-19 06:41:25,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-19 06:41:25,000 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-19 06:41:25,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-19 06:41:25,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-19 06:41:25,002 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2024-11-19 06:41:25,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-19 06:41:25,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-19 06:41:25,002 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2024-11-19 06:41:25,003 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-19 06:41:25,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2024-11-19 06:41:25,004 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2024-11-19 06:41:25,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2024-11-19 06:41:25,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-19 06:41:25,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-19 06:41:25,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-19 06:41:25,005 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-19 06:41:25,005 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-19 06:41:25,120 INFO L238 CfgBuilder]: Building ICFG [2024-11-19 06:41:25,123 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-19 06:41:25,507 INFO L? ?]: Removed 94 outVars from TransFormulas that were not future-live. [2024-11-19 06:41:25,507 INFO L287 CfgBuilder]: Performing block encoding [2024-11-19 06:41:25,524 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-19 06:41:25,525 INFO L316 CfgBuilder]: Removed 4 assume(true) statements. [2024-11-19 06:41:25,526 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:41:25 BoogieIcfgContainer [2024-11-19 06:41:25,526 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-19 06:41:25,529 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-19 06:41:25,529 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-19 06:41:25,533 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-19 06:41:25,534 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 06:41:24" (1/3) ... [2024-11-19 06:41:25,535 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f15fe17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:41:25, skipping insertion in model container [2024-11-19 06:41:25,535 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 06:41:24" (2/3) ... [2024-11-19 06:41:25,536 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f15fe17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 06:41:25, skipping insertion in model container [2024-11-19 06:41:25,536 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 06:41:25" (3/3) ... [2024-11-19 06:41:25,537 INFO L112 eAbstractionObserver]: Analyzing ICFG test-0220.i [2024-11-19 06:41:25,555 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-19 06:41:25,556 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 46 error locations. [2024-11-19 06:41:25,615 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-19 06:41:25,623 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;@634149ee, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-19 06:41:25,625 INFO L334 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2024-11-19 06:41:25,629 INFO L276 IsEmpty]: Start isEmpty. Operand has 110 states, 60 states have (on average 1.9666666666666666) internal successors, (118), 106 states have internal predecessors, (118), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:41:25,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-19 06:41:25,636 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:25,637 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-19 06:41:25,638 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:41:25,645 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:25,645 INFO L85 PathProgramCache]: Analyzing trace with hash 1359048, now seen corresponding path program 1 times [2024-11-19 06:41:25,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:25,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1810710023] [2024-11-19 06:41:25,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:25,655 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:25,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:25,802 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:25,803 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:25,803 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1810710023] [2024-11-19 06:41:25,804 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1810710023] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:25,804 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:25,804 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:41:25,806 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280670399] [2024-11-19 06:41:25,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:25,811 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-19 06:41:25,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:25,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-19 06:41:25,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:41:25,844 INFO L87 Difference]: Start difference. First operand has 110 states, 60 states have (on average 1.9666666666666666) internal successors, (118), 106 states have internal predecessors, (118), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:25,866 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:25,868 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2024-11-19 06:41:25,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-19 06:41:25,871 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2024-11-19 06:41:25,871 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:25,879 INFO L225 Difference]: With dead ends: 110 [2024-11-19 06:41:25,880 INFO L226 Difference]: Without dead ends: 108 [2024-11-19 06:41:25,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-19 06:41:25,885 INFO L432 NwaCegarLoop]: 115 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:25,886 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 115 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-19 06:41:25,900 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-19 06:41:25,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-19 06:41:25,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 59 states have (on average 1.847457627118644) internal successors, (109), 104 states have internal predecessors, (109), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:41:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2024-11-19 06:41:25,926 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 4 [2024-11-19 06:41:25,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:25,926 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2024-11-19 06:41:25,927 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.0) internal successors, (4), 2 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:25,927 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2024-11-19 06:41:25,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2024-11-19 06:41:25,927 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:25,927 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2024-11-19 06:41:25,927 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-19 06:41:25,928 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:41:25,928 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:25,929 INFO L85 PathProgramCache]: Analyzing trace with hash 1303851166, now seen corresponding path program 1 times [2024-11-19 06:41:25,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:25,929 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775216640] [2024-11-19 06:41:25,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:25,929 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:25,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:26,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:26,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:26,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775216640] [2024-11-19 06:41:26,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775216640] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:26,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:26,099 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-19 06:41:26,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [255997468] [2024-11-19 06:41:26,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:26,100 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-19 06:41:26,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:26,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-19 06:41:26,105 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:41:26,105 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:26,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:26,200 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2024-11-19 06:41:26,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-19 06:41:26,200 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 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 6 [2024-11-19 06:41:26,201 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:26,202 INFO L225 Difference]: With dead ends: 107 [2024-11-19 06:41:26,202 INFO L226 Difference]: Without dead ends: 107 [2024-11-19 06:41:26,202 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-19 06:41:26,203 INFO L432 NwaCegarLoop]: 107 mSDtfsCounter, 4 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 51 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 51 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:26,203 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 168 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 51 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:26,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-19 06:41:26,213 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-19 06:41:26,213 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 59 states have (on average 1.8305084745762712) internal successors, (108), 103 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:41:26,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2024-11-19 06:41:26,215 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 6 [2024-11-19 06:41:26,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:26,216 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2024-11-19 06:41:26,216 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:26,216 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2024-11-19 06:41:26,216 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-11-19 06:41:26,216 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:26,217 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:26,217 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-19 06:41:26,217 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:41:26,218 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:26,218 INFO L85 PathProgramCache]: Analyzing trace with hash 1764680516, now seen corresponding path program 1 times [2024-11-19 06:41:26,218 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:26,218 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1355267212] [2024-11-19 06:41:26,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:26,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:26,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 06:41:26,252 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1758499524] [2024-11-19 06:41:26,253 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:26,253 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:41:26,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:41:26,255 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:41:26,256 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-19 06:41:26,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:26,344 INFO L255 TraceCheckSpWp]: Trace formula consists of 79 conjuncts, 20 conjuncts are in the unsatisfiable core [2024-11-19 06:41:26,349 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:26,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:41:26,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:26,479 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:41:26,479 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:26,479 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1355267212] [2024-11-19 06:41:26,480 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 06:41:26,480 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1758499524] [2024-11-19 06:41:26,480 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1758499524] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:26,480 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:26,480 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-19 06:41:26,480 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [241539561] [2024-11-19 06:41:26,481 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:26,481 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-19 06:41:26,481 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:26,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-19 06:41:26,482 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-19 06:41:26,482 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:26,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:26,609 INFO L93 Difference]: Finished difference Result 106 states and 111 transitions. [2024-11-19 06:41:26,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-19 06:41:26,609 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2024-11-19 06:41:26,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:26,610 INFO L225 Difference]: With dead ends: 106 [2024-11-19 06:41:26,610 INFO L226 Difference]: Without dead ends: 106 [2024-11-19 06:41:26,611 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:41:26,612 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 9 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:26,612 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 271 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:26,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2024-11-19 06:41:26,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2024-11-19 06:41:26,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 59 states have (on average 1.8135593220338984) internal successors, (107), 102 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:41:26,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2024-11-19 06:41:26,627 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 7 [2024-11-19 06:41:26,627 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:26,627 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2024-11-19 06:41:26,628 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-19 06:41:26,628 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2024-11-19 06:41:26,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 06:41:26,631 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:26,631 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:26,646 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-19 06:41:26,832 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:41:26,833 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:41:26,833 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:26,833 INFO L85 PathProgramCache]: Analyzing trace with hash -1861010544, now seen corresponding path program 1 times [2024-11-19 06:41:26,834 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:26,834 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516446737] [2024-11-19 06:41:26,834 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:26,834 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:26,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:27,199 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:41:27,200 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:27,200 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516446737] [2024-11-19 06:41:27,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516446737] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:27,200 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:27,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-19 06:41:27,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1419697210] [2024-11-19 06:41:27,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:27,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-19 06:41:27,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:27,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-19 06:41:27,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:41:27,208 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:41:27,369 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:27,369 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2024-11-19 06:41:27,370 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-19 06:41:27,370 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-19 06:41:27,370 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:27,371 INFO L225 Difference]: With dead ends: 103 [2024-11-19 06:41:27,371 INFO L226 Difference]: Without dead ends: 103 [2024-11-19 06:41:27,371 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-19 06:41:27,372 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 13 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 335 SdHoareTripleChecker+Invalid, 186 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:27,373 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 335 Invalid, 186 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-19 06:41:27,373 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-19 06:41:27,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-19 06:41:27,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 59 states have (on average 1.7627118644067796) internal successors, (104), 99 states have internal predecessors, (104), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:41:27,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2024-11-19 06:41:27,378 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 26 [2024-11-19 06:41:27,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:27,380 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2024-11-19 06:41:27,380 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:41:27,380 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2024-11-19 06:41:27,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-11-19 06:41:27,381 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:27,381 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:27,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-19 06:41:27,381 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:41:27,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:27,382 INFO L85 PathProgramCache]: Analyzing trace with hash -1861010543, now seen corresponding path program 1 times [2024-11-19 06:41:27,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:27,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [400416006] [2024-11-19 06:41:27,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:27,383 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:27,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unknown [2024-11-19 06:41:27,430 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [312308389] [2024-11-19 06:41:27,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:27,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:41:27,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:41:27,437 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:41:27,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-19 06:41:27,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:27,543 INFO L255 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-19 06:41:27,549 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:27,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:41:27,604 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 10 treesize of output 9 [2024-11-19 06:41:27,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:41:27,953 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:41:27,970 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:41:27,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:41:27,991 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:41:27,992 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:41:27,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:27,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [400416006] [2024-11-19 06:41:27,993 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 06:41:27,993 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312308389] [2024-11-19 06:41:27,993 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312308389] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:27,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:27,994 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-19 06:41:27,994 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278392791] [2024-11-19 06:41:27,994 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:27,995 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-19 06:41:27,995 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:27,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-19 06:41:27,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2024-11-19 06:41:27,996 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:41:28,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:28,405 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2024-11-19 06:41:28,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:41:28,406 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 26 [2024-11-19 06:41:28,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:28,410 INFO L225 Difference]: With dead ends: 100 [2024-11-19 06:41:28,410 INFO L226 Difference]: Without dead ends: 100 [2024-11-19 06:41:28,410 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:41:28,411 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 14 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 370 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 370 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:28,411 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 327 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 370 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:41:28,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-19 06:41:28,418 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2024-11-19 06:41:28,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 59 states have (on average 1.7118644067796611) internal successors, (101), 96 states have internal predecessors, (101), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:41:28,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2024-11-19 06:41:28,423 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 26 [2024-11-19 06:41:28,423 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:28,423 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2024-11-19 06:41:28,423 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:41:28,424 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2024-11-19 06:41:28,424 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 06:41:28,424 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:28,424 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:28,442 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-19 06:41:28,625 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:41:28,625 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:41:28,626 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:28,626 INFO L85 PathProgramCache]: Analyzing trace with hash 384928723, now seen corresponding path program 1 times [2024-11-19 06:41:28,626 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:28,626 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [183355087] [2024-11-19 06:41:28,626 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:28,626 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:28,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:29,011 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-19 06:41:29,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:29,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [183355087] [2024-11-19 06:41:29,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [183355087] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:41:29,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1361618848] [2024-11-19 06:41:29,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:29,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:41:29,013 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:41:29,015 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:41:29,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-19 06:41:29,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:29,109 INFO L255 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 22 conjuncts are in the unsatisfiable core [2024-11-19 06:41:29,112 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:29,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:41:29,159 WARN L873 $PredicateComparison]: unable to prove that (exists ((|calloc_model_~ptr~0#1.base| Int)) (and (= (select |c_old(#valid)| |calloc_model_~ptr~0#1.base|) 0) (= |c_#valid| (store |c_old(#valid)| |calloc_model_~ptr~0#1.base| (select |c_#valid| |calloc_model_~ptr~0#1.base|))))) is different from true [2024-11-19 06:41:29,220 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:41:29,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 06:41:29,240 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-19 06:41:29,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-19 06:41:29,264 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-19 06:41:29,265 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:41:29,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1361618848] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:41:29,369 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:41:29,369 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8] total 11 [2024-11-19 06:41:29,370 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621745118] [2024-11-19 06:41:29,370 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:41:29,370 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:41:29,370 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:29,371 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:41:29,371 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=108, Unknown=1, NotChecked=20, Total=156 [2024-11-19 06:41:29,371 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:41:29,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:29,705 INFO L93 Difference]: Finished difference Result 101 states and 108 transitions. [2024-11-19 06:41:29,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-19 06:41:29,706 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) Word has length 30 [2024-11-19 06:41:29,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:29,708 INFO L225 Difference]: With dead ends: 101 [2024-11-19 06:41:29,708 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 06:41:29,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 1 IntricatePredicates, 1 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=55, Invalid=220, Unknown=1, NotChecked=30, Total=306 [2024-11-19 06:41:29,709 INFO L432 NwaCegarLoop]: 79 mSDtfsCounter, 31 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 402 SdHoareTripleChecker+Invalid, 467 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:29,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 402 Invalid, 467 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 359 Invalid, 0 Unknown, 102 Unchecked, 0.2s Time] [2024-11-19 06:41:29,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 06:41:29,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 97. [2024-11-19 06:41:29,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 59 states have (on average 1.6610169491525424) internal successors, (98), 93 states have internal predecessors, (98), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:41:29,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2024-11-19 06:41:29,715 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 30 [2024-11-19 06:41:29,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:29,715 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2024-11-19 06:41:29,715 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.3636363636363638) internal successors, (37), 10 states have internal predecessors, (37), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:41:29,715 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2024-11-19 06:41:29,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-19 06:41:29,716 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:29,716 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:29,738 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-19 06:41:29,922 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:41:29,923 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:41:29,923 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:29,923 INFO L85 PathProgramCache]: Analyzing trace with hash 384928724, now seen corresponding path program 1 times [2024-11-19 06:41:29,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:29,923 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863425809] [2024-11-19 06:41:29,924 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:29,924 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:29,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:30,456 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:41:30,458 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:30,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863425809] [2024-11-19 06:41:30,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [863425809] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:41:30,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:41:30,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-19 06:41:30,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789715053] [2024-11-19 06:41:30,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:41:30,460 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-19 06:41:30,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:30,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-19 06:41:30,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:41:30,461 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:41:30,696 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:41:30,697 INFO L93 Difference]: Finished difference Result 105 states and 111 transitions. [2024-11-19 06:41:30,697 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:41:30,698 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-19 06:41:30,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:41:30,699 INFO L225 Difference]: With dead ends: 105 [2024-11-19 06:41:30,699 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 06:41:30,699 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-19 06:41:30,700 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 4 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 327 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:41:30,702 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 327 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:41:30,702 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 06:41:30,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-19 06:41:30,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 62 states have (on average 1.6451612903225807) internal successors, (102), 97 states have internal predecessors, (102), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:41:30,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 107 transitions. [2024-11-19 06:41:30,712 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 107 transitions. Word has length 30 [2024-11-19 06:41:30,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:41:30,712 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 107 transitions. [2024-11-19 06:41:30,713 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 2.6) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:41:30,713 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 107 transitions. [2024-11-19 06:41:30,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-19 06:41:30,714 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:41:30,714 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:41:30,714 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-19 06:41:30,715 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:41:30,717 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:41:30,717 INFO L85 PathProgramCache]: Analyzing trace with hash -1169041418, now seen corresponding path program 1 times [2024-11-19 06:41:30,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:41:30,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822973678] [2024-11-19 06:41:30,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:30,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:41:30,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:31,235 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:41:31,235 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:41:31,236 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822973678] [2024-11-19 06:41:31,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [822973678] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:41:31,239 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1835216681] [2024-11-19 06:41:31,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:41:31,240 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:41:31,240 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:41:31,242 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:41:31,243 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-19 06:41:31,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:41:31,400 INFO L255 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 31 conjuncts are in the unsatisfiable core [2024-11-19 06:41:31,403 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:41:31,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:41:31,429 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 10 treesize of output 9 [2024-11-19 06:41:32,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:41:32,371 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 18 treesize of output 13 [2024-11-19 06:41:32,380 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:41:32,380 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:41:32,475 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:41:32,475 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:41:45,331 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:41:45,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1835216681] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:41:45,332 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:41:45,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 27 [2024-11-19 06:41:45,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620692668] [2024-11-19 06:41:45,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:41:45,333 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2024-11-19 06:41:45,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:41:45,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2024-11-19 06:41:45,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=99, Invalid=600, Unknown=3, NotChecked=0, Total=702 [2024-11-19 06:41:45,334 INFO L87 Difference]: Start difference. First operand 101 states and 107 transitions. Second operand has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 24 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:41:49,369 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-19 06:41:53,941 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.14s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-19 06:41:58,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=true, quantifiers [0] [2024-11-19 06:42:16,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:16,857 INFO L93 Difference]: Finished difference Result 118 states and 127 transitions. [2024-11-19 06:42:16,858 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-19 06:42:16,858 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 24 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) Word has length 31 [2024-11-19 06:42:16,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:16,859 INFO L225 Difference]: With dead ends: 118 [2024-11-19 06:42:16,859 INFO L226 Difference]: Without dead ends: 110 [2024-11-19 06:42:16,860 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 245 ImplicationChecksByTransitivity, 30.8s TimeCoverageRelationStatistics Valid=175, Invalid=1009, Unknown=6, NotChecked=0, Total=1190 [2024-11-19 06:42:16,860 INFO L432 NwaCegarLoop]: 94 mSDtfsCounter, 9 mSDsluCounter, 646 mSDsCounter, 0 mSdLazyCounter, 925 mSolverCounterSat, 6 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 13.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 740 SdHoareTripleChecker+Invalid, 934 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 925 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 14.0s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:16,861 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 740 Invalid, 934 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 925 Invalid, 3 Unknown, 0 Unchecked, 14.0s Time] [2024-11-19 06:42:16,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-19 06:42:16,871 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 104. [2024-11-19 06:42:16,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 100 states have internal predecessors, (108), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:42:16,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 113 transitions. [2024-11-19 06:42:16,873 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 113 transitions. Word has length 31 [2024-11-19 06:42:16,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:16,873 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 113 transitions. [2024-11-19 06:42:16,873 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 1.8148148148148149) internal successors, (49), 24 states have internal predecessors, (49), 1 states have call successors, (2), 1 states have call predecessors, (2), 4 states have return successors, (4), 4 states have call predecessors, (4), 1 states have call successors, (4) [2024-11-19 06:42:16,873 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2024-11-19 06:42:16,874 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2024-11-19 06:42:16,874 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:16,874 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:42:16,895 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-19 06:42:17,081 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:17,082 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:42:17,082 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:17,082 INFO L85 PathProgramCache]: Analyzing trace with hash 313820244, now seen corresponding path program 2 times [2024-11-19 06:42:17,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:42:17,082 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102182110] [2024-11-19 06:42:17,082 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:42:17,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:42:17,130 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:42:17,130 INFO L228 tOrderPrioritization]: Conjunction of SSA is unknown [2024-11-19 06:42:17,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [164675402] [2024-11-19 06:42:17,132 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-19 06:42:17,132 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:17,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:42:17,134 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:42:17,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-19 06:42:17,325 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-19 06:42:17,326 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-19 06:42:17,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 65 conjuncts are in the unsatisfiable core [2024-11-19 06:42:17,339 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:42:17,373 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 10 treesize of output 9 [2024-11-19 06:42:17,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-19 06:42:18,040 WARN L873 $PredicateComparison]: unable to prove that (exists ((|calloc_model_~ptr~0#1.base| Int)) (and (= (select |c_old(#valid)| |calloc_model_~ptr~0#1.base|) 0) (= (store |c_old(#length)| |calloc_model_~ptr~0#1.base| (select |c_#length| |calloc_model_~ptr~0#1.base|)) |c_#length|) (= |c_#valid| (store |c_old(#valid)| |calloc_model_~ptr~0#1.base| (select |c_#valid| |calloc_model_~ptr~0#1.base|))))) is different from true [2024-11-19 06:42:18,160 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:42:18,160 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 06:42:18,170 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:42:18,236 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 06:42:18,237 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-19 06:42:18,260 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-19 06:42:18,260 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-19 06:42:18,341 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 6 trivial. 11 not checked. [2024-11-19 06:42:18,342 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:42:18,724 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:18,724 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102182110] [2024-11-19 06:42:18,725 WARN L311 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2024-11-19 06:42:18,725 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [164675402] [2024-11-19 06:42:18,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [164675402] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:42:18,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:42:18,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12] total 12 [2024-11-19 06:42:18,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1588393768] [2024-11-19 06:42:18,725 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2024-11-19 06:42:18,726 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2024-11-19 06:42:18,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:42:18,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2024-11-19 06:42:18,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=152, Unknown=1, NotChecked=24, Total=210 [2024-11-19 06:42:18,727 INFO L87 Difference]: Start difference. First operand 104 states and 113 transitions. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:42:19,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:19,707 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2024-11-19 06:42:19,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-19 06:42:19,707 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 34 [2024-11-19 06:42:19,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:19,709 INFO L225 Difference]: With dead ends: 101 [2024-11-19 06:42:19,709 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 06:42:19,709 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=67, Invalid=316, Unknown=1, NotChecked=36, Total=420 [2024-11-19 06:42:19,710 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 37 mSDsluCounter, 348 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 613 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 95 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:19,710 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 423 Invalid, 613 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 511 Invalid, 0 Unknown, 95 Unchecked, 0.7s Time] [2024-11-19 06:42:19,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 06:42:19,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-19 06:42:19,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 65 states have (on average 1.6153846153846154) internal successors, (105), 97 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:42:19,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2024-11-19 06:42:19,721 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 34 [2024-11-19 06:42:19,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:19,721 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2024-11-19 06:42:19,722 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:42:19,722 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2024-11-19 06:42:19,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 06:42:19,722 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:19,722 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:42:19,736 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-19 06:42:19,923 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:19,924 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:42:19,924 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:19,925 INFO L85 PathProgramCache]: Analyzing trace with hash -852525999, now seen corresponding path program 1 times [2024-11-19 06:42:19,925 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:42:19,925 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493652671] [2024-11-19 06:42:19,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:19,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:42:19,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:20,659 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 06:42:20,660 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:20,660 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493652671] [2024-11-19 06:42:20,660 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493652671] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:42:20,660 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:42:20,660 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2024-11-19 06:42:20,660 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821360104] [2024-11-19 06:42:20,660 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:42:20,661 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2024-11-19 06:42:20,661 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:42:20,661 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2024-11-19 06:42:20,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=41, Invalid=169, Unknown=0, NotChecked=0, Total=210 [2024-11-19 06:42:20,662 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 15 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:42:21,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:21,144 INFO L93 Difference]: Finished difference Result 120 states and 129 transitions. [2024-11-19 06:42:21,145 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:42:21,145 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 41 [2024-11-19 06:42:21,145 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:21,146 INFO L225 Difference]: With dead ends: 120 [2024-11-19 06:42:21,146 INFO L226 Difference]: Without dead ends: 120 [2024-11-19 06:42:21,146 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2024-11-19 06:42:21,147 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 136 mSDsluCounter, 395 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 136 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:21,147 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [136 Valid, 462 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-19 06:42:21,148 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-11-19 06:42:21,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 103. [2024-11-19 06:42:21,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 69 states have (on average 1.608695652173913) internal successors, (111), 99 states have internal predecessors, (111), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:42:21,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 116 transitions. [2024-11-19 06:42:21,151 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 116 transitions. Word has length 41 [2024-11-19 06:42:21,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:21,152 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 116 transitions. [2024-11-19 06:42:21,152 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:42:21,152 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 116 transitions. [2024-11-19 06:42:21,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-19 06:42:21,153 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:21,153 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:42:21,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2024-11-19 06:42:21,153 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:42:21,153 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:21,153 INFO L85 PathProgramCache]: Analyzing trace with hash -852525998, now seen corresponding path program 1 times [2024-11-19 06:42:21,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:42:21,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596924314] [2024-11-19 06:42:21,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:21,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:42:21,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:22,127 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2024-11-19 06:42:22,127 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:22,127 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596924314] [2024-11-19 06:42:22,127 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596924314] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:42:22,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1865583892] [2024-11-19 06:42:22,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:22,128 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:22,128 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:42:22,129 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:42:22,130 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-19 06:42:22,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:22,253 INFO L255 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-11-19 06:42:22,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:42:22,374 WARN L873 $PredicateComparison]: unable to prove that (exists ((|calloc_model_~ptr~0#1.base| Int)) (and (= (select |c_old(#valid)| |calloc_model_~ptr~0#1.base|) 0) (= (store |c_old(#length)| |calloc_model_~ptr~0#1.base| (select |c_#length| |calloc_model_~ptr~0#1.base|)) |c_#length|) (= |c_#valid| (store |c_old(#valid)| |calloc_model_~ptr~0#1.base| (select |c_#valid| |calloc_model_~ptr~0#1.base|))))) is different from true [2024-11-19 06:42:22,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:42:22,450 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:42:22,478 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-19 06:42:22,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2024-11-19 06:42:22,524 WARN L873 $PredicateComparison]: unable to prove that (exists ((|calloc_model_~ptr~0#1.base| Int)) (and (= (select |c_old(#valid)| |calloc_model_~ptr~0#1.base|) 0) (= (store |c_old(#length)| |calloc_model_~ptr~0#1.base| (select |c_#length| |calloc_model_~ptr~0#1.base|)) |c_#length|))) is different from true [2024-11-19 06:42:22,588 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:42:22,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-11-19 06:42:22,672 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-19 06:42:22,673 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-11-19 06:42:22,877 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 10 not checked. [2024-11-19 06:42:22,878 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:42:23,347 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1865583892] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:42:23,347 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-19 06:42:23,347 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 7] total 21 [2024-11-19 06:42:23,347 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942486830] [2024-11-19 06:42:23,348 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-19 06:42:23,348 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-19 06:42:23,348 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:42:23,349 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-19 06:42:23,350 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=476, Unknown=2, NotChecked=90, Total=650 [2024-11-19 06:42:23,350 INFO L87 Difference]: Start difference. First operand 103 states and 116 transitions. Second operand has 23 states, 22 states have (on average 3.090909090909091) internal successors, (68), 18 states have internal predecessors, (68), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:42:24,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:24,455 INFO L93 Difference]: Finished difference Result 121 states and 131 transitions. [2024-11-19 06:42:24,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-19 06:42:24,455 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.090909090909091) internal successors, (68), 18 states have internal predecessors, (68), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 41 [2024-11-19 06:42:24,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:24,456 INFO L225 Difference]: With dead ends: 121 [2024-11-19 06:42:24,457 INFO L226 Difference]: Without dead ends: 121 [2024-11-19 06:42:24,457 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 202 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=211, Invalid=985, Unknown=2, NotChecked=134, Total=1332 [2024-11-19 06:42:24,458 INFO L432 NwaCegarLoop]: 64 mSDtfsCounter, 164 mSDsluCounter, 411 mSDsCounter, 0 mSdLazyCounter, 560 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 475 SdHoareTripleChecker+Invalid, 811 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 560 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 227 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:24,458 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 475 Invalid, 811 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 560 Invalid, 0 Unknown, 227 Unchecked, 0.6s Time] [2024-11-19 06:42:24,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-19 06:42:24,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 101. [2024-11-19 06:42:24,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 69 states have (on average 1.5507246376811594) internal successors, (107), 97 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:42:24,463 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 112 transitions. [2024-11-19 06:42:24,464 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 112 transitions. Word has length 41 [2024-11-19 06:42:24,464 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:24,464 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 112 transitions. [2024-11-19 06:42:24,464 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.090909090909091) internal successors, (68), 18 states have internal predecessors, (68), 2 states have call successors, (4), 3 states have call predecessors, (4), 4 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-19 06:42:24,465 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 112 transitions. [2024-11-19 06:42:24,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 06:42:24,467 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:24,467 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:42:24,495 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-19 06:42:24,672 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:24,673 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:42:24,674 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:24,674 INFO L85 PathProgramCache]: Analyzing trace with hash 1009259326, now seen corresponding path program 1 times [2024-11-19 06:42:24,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:42:24,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008275115] [2024-11-19 06:42:24,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:24,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:42:24,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:24,955 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 06:42:24,956 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:24,956 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008275115] [2024-11-19 06:42:24,956 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008275115] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:42:24,956 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:42:24,956 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-19 06:42:24,957 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658371489] [2024-11-19 06:42:24,957 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:42:24,957 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-19 06:42:24,957 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:42:24,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-19 06:42:24,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:42:24,958 INFO L87 Difference]: Start difference. First operand 101 states and 112 transitions. Second operand has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:42:25,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:25,547 INFO L93 Difference]: Finished difference Result 153 states and 169 transitions. [2024-11-19 06:42:25,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-19 06:42:25,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 49 [2024-11-19 06:42:25,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:25,549 INFO L225 Difference]: With dead ends: 153 [2024-11-19 06:42:25,549 INFO L226 Difference]: Without dead ends: 153 [2024-11-19 06:42:25,549 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-11-19 06:42:25,549 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 48 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:25,550 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 315 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 06:42:25,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2024-11-19 06:42:25,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 101. [2024-11-19 06:42:25,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 69 states have (on average 1.536231884057971) internal successors, (106), 97 states have internal predecessors, (106), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:42:25,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 111 transitions. [2024-11-19 06:42:25,554 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 111 transitions. Word has length 49 [2024-11-19 06:42:25,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:25,554 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 111 transitions. [2024-11-19 06:42:25,554 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.2) internal successors, (36), 6 states have internal predecessors, (36), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:42:25,554 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 111 transitions. [2024-11-19 06:42:25,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2024-11-19 06:42:25,555 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:25,555 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:42:25,555 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-19 06:42:25,555 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:42:25,556 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:25,556 INFO L85 PathProgramCache]: Analyzing trace with hash 1009259327, now seen corresponding path program 1 times [2024-11-19 06:42:25,556 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:42:25,556 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1993142458] [2024-11-19 06:42:25,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:25,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:42:25,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:26,150 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 06:42:26,150 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:26,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1993142458] [2024-11-19 06:42:26,151 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1993142458] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:42:26,151 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1769622951] [2024-11-19 06:42:26,151 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:26,151 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:26,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:42:26,153 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:42:26,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-19 06:42:26,308 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:26,311 INFO L255 TraceCheckSpWp]: Trace formula consists of 375 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-19 06:42:26,315 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:42:27,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:42:27,232 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:42:27,365 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:42:27,366 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-19 06:42:27,371 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:42:27,371 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-19 06:42:27,399 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 06:42:27,399 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:42:27,481 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 60 treesize of output 56 [2024-11-19 06:42:27,484 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 90 treesize of output 82 [2024-11-19 06:42:27,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:42:27,502 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-19 06:42:27,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-19 06:42:27,767 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 25 treesize of output 29 [2024-11-19 06:42:28,375 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 06:42:28,375 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1769622951] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-19 06:42:28,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-19 06:42:28,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 12] total 31 [2024-11-19 06:42:28,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907686916] [2024-11-19 06:42:28,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-19 06:42:28,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-19 06:42:28,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:42:28,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-19 06:42:28,378 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=856, Unknown=0, NotChecked=0, Total=992 [2024-11-19 06:42:28,378 INFO L87 Difference]: Start difference. First operand 101 states and 111 transitions. Second operand has 32 states, 28 states have (on average 4.25) internal successors, (119), 29 states have internal predecessors, (119), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 06:42:29,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:29,462 INFO L93 Difference]: Finished difference Result 143 states and 156 transitions. [2024-11-19 06:42:29,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-19 06:42:29,463 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 28 states have (on average 4.25) internal successors, (119), 29 states have internal predecessors, (119), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 49 [2024-11-19 06:42:29,463 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:29,464 INFO L225 Difference]: With dead ends: 143 [2024-11-19 06:42:29,464 INFO L226 Difference]: Without dead ends: 143 [2024-11-19 06:42:29,465 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 358 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=278, Invalid=1614, Unknown=0, NotChecked=0, Total=1892 [2024-11-19 06:42:29,466 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 358 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 647 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 358 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 647 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:29,466 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [358 Valid, 759 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 647 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-19 06:42:29,466 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-19 06:42:29,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 101. [2024-11-19 06:42:29,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 69 states have (on average 1.5217391304347827) internal successors, (105), 97 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:42:29,475 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2024-11-19 06:42:29,475 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 49 [2024-11-19 06:42:29,476 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:29,476 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2024-11-19 06:42:29,477 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 28 states have (on average 4.25) internal successors, (119), 29 states have internal predecessors, (119), 6 states have call successors, (6), 2 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2024-11-19 06:42:29,477 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2024-11-19 06:42:29,477 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-19 06:42:29,478 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:29,479 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:42:29,493 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-19 06:42:29,680 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:29,681 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:42:29,681 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:29,681 INFO L85 PathProgramCache]: Analyzing trace with hash 2073584370, now seen corresponding path program 1 times [2024-11-19 06:42:29,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:42:29,681 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [352545633] [2024-11-19 06:42:29,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:29,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:42:29,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:30,678 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 06:42:30,679 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:30,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [352545633] [2024-11-19 06:42:30,679 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [352545633] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:42:30,679 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [210754931] [2024-11-19 06:42:30,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:30,679 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:30,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:42:30,681 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:42:30,683 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-19 06:42:30,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:30,835 INFO L255 TraceCheckSpWp]: Trace formula consists of 395 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-19 06:42:30,838 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:42:31,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:42:31,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:42:31,978 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:42:31,979 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-19 06:42:31,984 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:42:31,984 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-19 06:42:31,989 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 06:42:31,990 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:42:31,990 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [210754931] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:42:31,990 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:42:31,990 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [14] total 22 [2024-11-19 06:42:31,990 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500640427] [2024-11-19 06:42:31,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:42:31,991 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-19 06:42:31,991 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:42:31,991 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-19 06:42:31,991 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=432, Unknown=0, NotChecked=0, Total=506 [2024-11-19 06:42:31,992 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:42:32,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:32,435 INFO L93 Difference]: Finished difference Result 142 states and 155 transitions. [2024-11-19 06:42:32,435 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-19 06:42:32,435 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 52 [2024-11-19 06:42:32,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:32,436 INFO L225 Difference]: With dead ends: 142 [2024-11-19 06:42:32,436 INFO L226 Difference]: Without dead ends: 142 [2024-11-19 06:42:32,436 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 158 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=92, Invalid=558, Unknown=0, NotChecked=0, Total=650 [2024-11-19 06:42:32,437 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 101 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 101 SdHoareTripleChecker+Valid, 356 SdHoareTripleChecker+Invalid, 279 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:32,437 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [101 Valid, 356 Invalid, 279 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-19 06:42:32,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2024-11-19 06:42:32,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 102. [2024-11-19 06:42:32,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 70 states have (on average 1.5285714285714285) internal successors, (107), 98 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:42:32,441 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2024-11-19 06:42:32,441 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 52 [2024-11-19 06:42:32,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:32,441 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2024-11-19 06:42:32,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.9) internal successors, (39), 10 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:42:32,441 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2024-11-19 06:42:32,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2024-11-19 06:42:32,442 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:32,442 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:42:32,460 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-19 06:42:32,648 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2024-11-19 06:42:32,649 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:42:32,649 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:32,649 INFO L85 PathProgramCache]: Analyzing trace with hash 2073584369, now seen corresponding path program 1 times [2024-11-19 06:42:32,649 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:42:32,649 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1157741199] [2024-11-19 06:42:32,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:32,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:42:32,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:32,760 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 06:42:32,760 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:32,761 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1157741199] [2024-11-19 06:42:32,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1157741199] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:42:32,761 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-19 06:42:32,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-19 06:42:32,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1651815921] [2024-11-19 06:42:32,761 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:42:32,762 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-19 06:42:32,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:42:32,762 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-19 06:42:32,762 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-19 06:42:32,763 INFO L87 Difference]: Start difference. First operand 102 states and 112 transitions. Second operand has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:42:32,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:32,945 INFO L93 Difference]: Finished difference Result 101 states and 110 transitions. [2024-11-19 06:42:32,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-19 06:42:32,946 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2024-11-19 06:42:32,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:32,947 INFO L225 Difference]: With dead ends: 101 [2024-11-19 06:42:32,947 INFO L226 Difference]: Without dead ends: 101 [2024-11-19 06:42:32,947 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-11-19 06:42:32,948 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 14 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 239 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:32,948 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 239 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-19 06:42:32,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-19 06:42:32,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2024-11-19 06:42:32,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 70 states have (on average 1.5) internal successors, (105), 97 states have internal predecessors, (105), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:42:32,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2024-11-19 06:42:32,951 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 52 [2024-11-19 06:42:32,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:32,951 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2024-11-19 06:42:32,952 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 9.75) internal successors, (39), 5 states have internal predecessors, (39), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-19 06:42:32,952 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2024-11-19 06:42:32,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 06:42:32,952 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:32,952 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:42:32,952 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-19 06:42:32,953 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:42:32,953 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:32,954 INFO L85 PathProgramCache]: Analyzing trace with hash -150244078, now seen corresponding path program 1 times [2024-11-19 06:42:32,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:42:32,954 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1638628703] [2024-11-19 06:42:32,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:32,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:42:33,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:33,969 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:42:33,969 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:33,969 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1638628703] [2024-11-19 06:42:33,969 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1638628703] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:42:33,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [503738297] [2024-11-19 06:42:33,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:33,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:33,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:42:33,972 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:42:33,974 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-19 06:42:34,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:34,140 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-19 06:42:34,143 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:42:34,808 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-11-19 06:42:34,965 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 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-19 06:42:35,003 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:42:35,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:42:35,184 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:42:35,184 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2024-11-19 06:42:35,193 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:42:35,193 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2024-11-19 06:42:35,233 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-11-19 06:42:35,295 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2024-11-19 06:42:35,296 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-19 06:42:35,296 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [503738297] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-19 06:42:35,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-19 06:42:35,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [15] total 25 [2024-11-19 06:42:35,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474371797] [2024-11-19 06:42:35,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-19 06:42:35,296 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-19 06:42:35,296 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-19 06:42:35,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-19 06:42:35,297 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=530, Unknown=0, NotChecked=0, Total=600 [2024-11-19 06:42:35,297 INFO L87 Difference]: Start difference. First operand 101 states and 110 transitions. Second operand has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:42:36,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-19 06:42:36,038 INFO L93 Difference]: Finished difference Result 124 states and 138 transitions. [2024-11-19 06:42:36,038 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-19 06:42:36,038 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 54 [2024-11-19 06:42:36,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-19 06:42:36,039 INFO L225 Difference]: With dead ends: 124 [2024-11-19 06:42:36,039 INFO L226 Difference]: Without dead ends: 124 [2024-11-19 06:42:36,040 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=108, Invalid=884, Unknown=0, NotChecked=0, Total=992 [2024-11-19 06:42:36,040 INFO L432 NwaCegarLoop]: 67 mSDtfsCounter, 104 mSDsluCounter, 264 mSDsCounter, 0 mSdLazyCounter, 431 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 431 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-19 06:42:36,041 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 331 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 431 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-19 06:42:36,041 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2024-11-19 06:42:36,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 102. [2024-11-19 06:42:36,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 72 states have (on average 1.4861111111111112) internal successors, (107), 98 states have internal predecessors, (107), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 2 states have call predecessors, (3), 2 states have call successors, (3) [2024-11-19 06:42:36,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 112 transitions. [2024-11-19 06:42:36,046 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 112 transitions. Word has length 54 [2024-11-19 06:42:36,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-19 06:42:36,046 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 112 transitions. [2024-11-19 06:42:36,047 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.727272727272727) internal successors, (41), 11 states have internal predecessors, (41), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-19 06:42:36,047 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 112 transitions. [2024-11-19 06:42:36,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2024-11-19 06:42:36,047 INFO L207 NwaCegarLoop]: Found error trace [2024-11-19 06:42:36,048 INFO L215 NwaCegarLoop]: trace histogram [4, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-19 06:42:36,062 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-11-19 06:42:36,248 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-19 06:42:36,249 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [calloc_modelErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, calloc_modelErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2024-11-19 06:42:36,249 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-19 06:42:36,249 INFO L85 PathProgramCache]: Analyzing trace with hash -150244077, now seen corresponding path program 1 times [2024-11-19 06:42:36,249 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-19 06:42:36,249 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1633661313] [2024-11-19 06:42:36,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:36,250 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-19 06:42:36,311 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:37,384 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-19 06:42:37,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-19 06:42:37,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1633661313] [2024-11-19 06:42:37,384 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1633661313] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-19 06:42:37,384 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [505602327] [2024-11-19 06:42:37,384 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-19 06:42:37,385 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-19 06:42:37,385 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-19 06:42:37,386 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-19 06:42:37,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-19 06:42:37,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-19 06:42:37,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 411 conjuncts, 70 conjuncts are in the unsatisfiable core [2024-11-19 06:42:37,560 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-19 06:42:38,825 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-11-19 06:42:38,840 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-11-19 06:42:39,153 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 23 [2024-11-19 06:42:39,158 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 44 treesize of output 26 [2024-11-19 06:42:39,210 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:42:39,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-11-19 06:42:39,701 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:42:39,703 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 60 treesize of output 44 [2024-11-19 06:42:39,721 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-19 06:42:39,722 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 38 [2024-11-19 06:42:39,802 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 23 treesize of output 15 [2024-11-19 06:42:39,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 14 [2024-11-19 06:42:39,920 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2024-11-19 06:42:39,921 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-19 06:42:40,461 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 177 treesize of output 165 [2024-11-19 06:42:40,466 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 273 treesize of output 245 [2024-11-19 06:42:45,628 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_~#list~0.base| |c_ULTIMATE.start_l1_insert_~list#1.base|)) (.cse1 (= |c_~#list~0.offset| |c_ULTIMATE.start_l1_insert_~list#1.offset|))) (or (and .cse0 (<= (+ |c_ULTIMATE.start_l1_insert_~item~1#1.offset| 1) 0) .cse1) (let ((.cse7 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_l1_insert_~item~1#1.base|)) (.cse2 (and .cse0 .cse1)) (.cse4 (+ |c_ULTIMATE.start_l1_insert_~item~1#1.offset| 4)) (.cse5 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_l1_insert_~item~1#1.base|))) (and (or .cse2 (let ((.cse3 (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.offset| Int)) (or (let ((.cse8 (+ 4 v_arrayElimCell_40))) (< (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse5 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| |ULTIMATE.start_l1_insert_#t~mem13#1.offset|)) v_arrayElimCell_39) .cse8) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse7 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| |ULTIMATE.start_l1_insert_#t~mem13#1.base|)) v_arrayElimCell_39) .cse8)))) (< v_arrayElimCell_40 0))))) (and (or .cse3 .cse1) (forall ((|ULTIMATE.start_l1_insert_#t~mem13#1.base| Int) (v_arrayElimCell_40 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.offset| Int)) (or (forall ((v_arrayElimCell_39 Int)) (or (< (+ (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimCell_39) .cse4) 3) (select |c_#length| (select (select |c_#memory_$Pointer$#2.base| v_arrayElimCell_39) .cse4))) (let ((.cse6 (+ 4 v_arrayElimCell_40))) (< (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse5 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| |ULTIMATE.start_l1_insert_#t~mem13#1.offset|)) v_arrayElimCell_39) .cse6) 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse7 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| |ULTIMATE.start_l1_insert_#t~mem13#1.base|)) v_arrayElimCell_39) .cse6)))))) (< v_arrayElimCell_40 0))) (or .cse0 .cse3)))) (or (not .cse1) (let ((.cse9 (select .cse5 .cse4))) (and (<= 0 .cse9) (<= (+ .cse9 4) (select |c_#length| (select .cse7 .cse4))))) (not .cse0)) (or .cse2 (let ((.cse10 (forall ((v_arrayElimCell_40 Int) (v_arrayElimCell_39 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.offset| Int)) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse5 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| |ULTIMATE.start_l1_insert_#t~mem13#1.offset|)) v_arrayElimCell_39) (+ 4 v_arrayElimCell_40)) 1)) (< v_arrayElimCell_40 0))))) (and (or .cse10 .cse1) (forall ((v_arrayElimCell_40 Int) (|ULTIMATE.start_l1_insert_#t~mem13#1.offset| Int)) (or (forall ((v_arrayElimCell_39 Int)) (or (< 0 (+ (select (select (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_l1_insert_~item~1#1.base| (store .cse5 |c_ULTIMATE.start_l1_insert_~item~1#1.offset| |ULTIMATE.start_l1_insert_#t~mem13#1.offset|)) v_arrayElimCell_39) (+ 4 v_arrayElimCell_40)) 1)) (< 0 (+ (select (select |c_#memory_$Pointer$#2.offset| v_arrayElimCell_39) .cse4) 1)))) (< v_arrayElimCell_40 0))) (or .cse0 .cse10)))))))) is different from false