./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/array-examples/relax-2-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version c7c6ca5d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/array-examples/relax-2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 56e9aa9f750ced23bf75100b2ff89e86c96f8abe4883dfab569153879bc59aef --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:32:04,312 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:32:04,393 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-09 07:32:04,398 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:32:04,400 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:32:04,422 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:32:04,423 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:32:04,423 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:32:04,424 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:32:04,425 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:32:04,425 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:32:04,425 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:32:04,426 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:32:04,426 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:32:04,428 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:32:04,429 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:32:04,429 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:32:04,429 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:32:04,429 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:32:04,429 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:32:04,430 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:32:04,430 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:32:04,430 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:32:04,430 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:32:04,430 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:32:04,431 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:32:04,431 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:32:04,431 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:32:04,431 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:32:04,431 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:32:04,431 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:32:04,432 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:32:04,432 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:32:04,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:32:04,432 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:32:04,432 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:32:04,432 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-09 07:32:04,432 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-09 07:32:04,432 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:32:04,433 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:32:04,433 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:32:04,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:32:04,434 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 -> 56e9aa9f750ced23bf75100b2ff89e86c96f8abe4883dfab569153879bc59aef [2024-11-09 07:32:04,642 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:32:04,663 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:32:04,667 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:32:04,668 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:32:04,668 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:32:04,669 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/relax-2-2.i [2024-11-09 07:32:05,937 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:32:06,129 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:32:06,130 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/relax-2-2.i [2024-11-09 07:32:06,141 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d87acd6d/a9316454999f40dcb72eeced97d7683d/FLAG3ae2b8e61 [2024-11-09 07:32:06,153 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3d87acd6d/a9316454999f40dcb72eeced97d7683d [2024-11-09 07:32:06,155 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:32:06,156 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:32:06,157 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:32:06,157 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:32:06,161 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:32:06,162 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:32:06" (1/1) ... [2024-11-09 07:32:06,162 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32334be6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:06, skipping insertion in model container [2024-11-09 07:32:06,163 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:32:06" (1/1) ... [2024-11-09 07:32:06,197 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:32:06,414 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:32:06,422 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:32:06,455 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:32:06,502 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:32:06,502 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:06 WrapperNode [2024-11-09 07:32:06,503 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:32:06,503 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:32:06,503 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:32:06,504 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:32:06,510 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:06" (1/1) ... [2024-11-09 07:32:06,523 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:06" (1/1) ... [2024-11-09 07:32:06,560 INFO L138 Inliner]: procedures = 120, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 148 [2024-11-09 07:32:06,561 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:32:06,561 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:32:06,561 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:32:06,561 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:32:06,569 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:06" (1/1) ... [2024-11-09 07:32:06,569 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:06" (1/1) ... [2024-11-09 07:32:06,572 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:06" (1/1) ... [2024-11-09 07:32:06,583 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 6, 6]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-09 07:32:06,583 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:06" (1/1) ... [2024-11-09 07:32:06,583 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:06" (1/1) ... [2024-11-09 07:32:06,588 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:06" (1/1) ... [2024-11-09 07:32:06,593 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:06" (1/1) ... [2024-11-09 07:32:06,598 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:06" (1/1) ... [2024-11-09 07:32:06,599 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:06" (1/1) ... [2024-11-09 07:32:06,605 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:32:06,605 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:32:06,605 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:32:06,605 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:32:06,606 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:06" (1/1) ... [2024-11-09 07:32:06,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:32:06,618 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:32:06,634 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:32:06,636 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:32:06,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-09 07:32:06,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-09 07:32:06,676 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2024-11-09 07:32:06,676 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 07:32:06,676 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 07:32:06,676 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-09 07:32:06,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-09 07:32:06,677 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2024-11-09 07:32:06,677 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 07:32:06,677 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 07:32:06,677 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:32:06,678 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:32:06,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-09 07:32:06,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-09 07:32:06,678 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2024-11-09 07:32:06,678 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:32:06,678 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:32:06,776 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:32:06,778 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:32:07,119 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2024-11-09 07:32:07,119 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:32:07,136 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:32:07,137 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-09 07:32:07,137 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:32:07 BoogieIcfgContainer [2024-11-09 07:32:07,137 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:32:07,140 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:32:07,140 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:32:07,144 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:32:07,144 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:32:06" (1/3) ... [2024-11-09 07:32:07,145 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b503588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:32:07, skipping insertion in model container [2024-11-09 07:32:07,145 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:06" (2/3) ... [2024-11-09 07:32:07,146 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b503588 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:32:07, skipping insertion in model container [2024-11-09 07:32:07,146 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:32:07" (3/3) ... [2024-11-09 07:32:07,148 INFO L112 eAbstractionObserver]: Analyzing ICFG relax-2-2.i [2024-11-09 07:32:07,163 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:32:07,164 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-11-09 07:32:07,204 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:32:07,209 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;@deb8dd9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:32:07,209 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-09 07:32:07,212 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 61 states have (on average 1.8360655737704918) internal successors, (112), 90 states have internal predecessors, (112), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 07:32:07,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:32:07,218 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:07,219 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:07,219 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:07,223 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:07,223 INFO L85 PathProgramCache]: Analyzing trace with hash 44061928, now seen corresponding path program 1 times [2024-11-09 07:32:07,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:32:07,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335925366] [2024-11-09 07:32:07,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:07,231 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:32:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:07,359 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:32:07,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:07,371 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 07:32:07,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:07,381 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:32:07,382 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:32:07,382 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335925366] [2024-11-09 07:32:07,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335925366] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:32:07,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:32:07,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:32:07,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1518550877] [2024-11-09 07:32:07,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:32:07,395 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 07:32:07,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:32:07,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 07:32:07,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:32:07,423 INFO L87 Difference]: Start difference. First operand has 97 states, 61 states have (on average 1.8360655737704918) internal successors, (112), 90 states have internal predecessors, (112), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:32:07,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:07,443 INFO L93 Difference]: Finished difference Result 96 states and 117 transitions. [2024-11-09 07:32:07,444 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 07:32:07,445 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-11-09 07:32:07,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:07,452 INFO L225 Difference]: With dead ends: 96 [2024-11-09 07:32:07,453 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 07:32:07,454 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 8 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-09 07:32:07,458 INFO L432 NwaCegarLoop]: 117 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, 117 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-09 07:32:07,459 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:32:07,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 07:32:07,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-09 07:32:07,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 59 states have (on average 1.7118644067796611) internal successors, (101), 87 states have internal predecessors, (101), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 07:32:07,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 115 transitions. [2024-11-09 07:32:07,496 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 115 transitions. Word has length 15 [2024-11-09 07:32:07,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:07,496 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 115 transitions. [2024-11-09 07:32:07,497 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:32:07,497 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2024-11-09 07:32:07,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:32:07,499 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:07,499 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:07,499 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-09 07:32:07,499 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:07,500 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:07,500 INFO L85 PathProgramCache]: Analyzing trace with hash 802384808, now seen corresponding path program 1 times [2024-11-09 07:32:07,500 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:32:07,500 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [978418223] [2024-11-09 07:32:07,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:07,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:32:07,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:07,653 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:32:07,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:07,661 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 07:32:07,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:07,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:32:07,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:32:07,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [978418223] [2024-11-09 07:32:07,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [978418223] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:32:07,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:32:07,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:32:07,678 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1334510390] [2024-11-09 07:32:07,678 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:32:07,679 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:32:07,679 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:32:07,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:32:07,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:32:07,680 INFO L87 Difference]: Start difference. First operand 94 states and 115 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-09 07:32:07,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:07,740 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2024-11-09 07:32:07,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:32:07,740 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 15 [2024-11-09 07:32:07,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:07,742 INFO L225 Difference]: With dead ends: 89 [2024-11-09 07:32:07,742 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 07:32:07,742 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:32:07,743 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 77 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:07,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 98 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:32:07,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 07:32:07,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 07:32:07,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 59 states have (on average 1.6271186440677967) internal successors, (96), 82 states have internal predecessors, (96), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 07:32:07,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2024-11-09 07:32:07,750 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 15 [2024-11-09 07:32:07,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:07,752 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2024-11-09 07:32:07,752 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-09 07:32:07,752 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2024-11-09 07:32:07,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:32:07,752 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:07,753 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:07,753 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-09 07:32:07,753 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:07,753 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:07,754 INFO L85 PathProgramCache]: Analyzing trace with hash 802384809, now seen corresponding path program 1 times [2024-11-09 07:32:07,754 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:32:07,754 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1115254555] [2024-11-09 07:32:07,754 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:07,754 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:32:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:08,227 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:32:08,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:08,276 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 07:32:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:08,290 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:32:08,291 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:32:08,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1115254555] [2024-11-09 07:32:08,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1115254555] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:32:08,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [504785131] [2024-11-09 07:32:08,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:08,292 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:32:08,293 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:32:08,294 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:32:08,296 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-09 07:32:08,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:08,364 INFO L255 TraceCheckSpWp]: Trace formula consists of 64 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 07:32:08,370 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:32:08,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-09 07:32:08,479 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:32:08,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2024-11-09 07:32:08,536 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:32:08,537 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:32:08,603 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:32:08,726 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:32:08,726 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [504785131] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:32:08,726 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:32:08,726 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2024-11-09 07:32:08,727 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285526146] [2024-11-09 07:32:08,727 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:32:08,727 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:32:08,727 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:32:08,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:32:08,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=100, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:32:08,728 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:32:09,155 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:09,156 INFO L93 Difference]: Finished difference Result 96 states and 119 transitions. [2024-11-09 07:32:09,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:32:09,156 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 15 [2024-11-09 07:32:09,156 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:09,157 INFO L225 Difference]: With dead ends: 96 [2024-11-09 07:32:09,157 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 07:32:09,157 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 26 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:32:09,159 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 94 mSDsluCounter, 414 mSDsCounter, 0 mSdLazyCounter, 288 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 503 SdHoareTripleChecker+Invalid, 291 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 288 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:09,159 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 503 Invalid, 291 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 288 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:32:09,164 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 07:32:09,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-09 07:32:09,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 65 states have (on average 1.6) internal successors, (104), 88 states have internal predecessors, (104), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 07:32:09,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 118 transitions. [2024-11-09 07:32:09,175 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 118 transitions. Word has length 15 [2024-11-09 07:32:09,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:09,175 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 118 transitions. [2024-11-09 07:32:09,175 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 1.6363636363636365) internal successors, (18), 10 states have internal predecessors, (18), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:32:09,175 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 118 transitions. [2024-11-09 07:32:09,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:32:09,176 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:09,176 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:09,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-09 07:32:09,376 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-09 07:32:09,377 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:09,377 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:09,377 INFO L85 PathProgramCache]: Analyzing trace with hash -2002363436, now seen corresponding path program 1 times [2024-11-09 07:32:09,377 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:32:09,378 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780504001] [2024-11-09 07:32:09,378 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:09,378 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:32:09,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:09,428 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:32:09,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:09,431 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 07:32:09,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:09,438 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:32:09,439 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:32:09,440 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780504001] [2024-11-09 07:32:09,440 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780504001] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:32:09,440 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:32:09,440 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:32:09,440 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864654742] [2024-11-09 07:32:09,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:32:09,440 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:32:09,442 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:32:09,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:32:09,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:32:09,443 INFO L87 Difference]: Start difference. First operand 95 states and 118 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-09 07:32:09,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:09,490 INFO L93 Difference]: Finished difference Result 90 states and 113 transitions. [2024-11-09 07:32:09,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:32:09,491 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 17 [2024-11-09 07:32:09,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:09,491 INFO L225 Difference]: With dead ends: 90 [2024-11-09 07:32:09,493 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 07:32:09,493 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:32:09,494 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 70 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:09,494 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 98 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:32:09,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 07:32:09,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-09 07:32:09,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 65 states have (on average 1.523076923076923) internal successors, (99), 83 states have internal predecessors, (99), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 07:32:09,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2024-11-09 07:32:09,506 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 17 [2024-11-09 07:32:09,506 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:09,506 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2024-11-09 07:32:09,507 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-09 07:32:09,507 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2024-11-09 07:32:09,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:32:09,507 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:09,507 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:09,507 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-09 07:32:09,507 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:09,508 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:09,508 INFO L85 PathProgramCache]: Analyzing trace with hash -2002363435, now seen corresponding path program 1 times [2024-11-09 07:32:09,508 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:32:09,508 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477350824] [2024-11-09 07:32:09,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:09,508 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:32:09,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:09,698 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:32:09,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:09,703 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 07:32:09,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:09,740 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:32:09,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:32:09,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477350824] [2024-11-09 07:32:09,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477350824] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:32:09,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:32:09,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:32:09,742 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900537069] [2024-11-09 07:32:09,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:32:09,742 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:32:09,743 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:32:09,743 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:32:09,744 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:32:09,744 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:32:09,931 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:09,932 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2024-11-09 07:32:09,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:32:09,932 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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 17 [2024-11-09 07:32:09,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:09,933 INFO L225 Difference]: With dead ends: 94 [2024-11-09 07:32:09,933 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 07:32:09,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:32:09,934 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 146 mSDsluCounter, 220 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 281 SdHoareTripleChecker+Invalid, 244 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:09,934 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 281 Invalid, 244 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:32:09,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 07:32:09,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2024-11-09 07:32:09,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 85 states have internal predecessors, (102), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 07:32:09,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 116 transitions. [2024-11-09 07:32:09,939 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 116 transitions. Word has length 17 [2024-11-09 07:32:09,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:09,939 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 116 transitions. [2024-11-09 07:32:09,939 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:32:09,940 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 116 transitions. [2024-11-09 07:32:09,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:32:09,940 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:09,940 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:09,940 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-09 07:32:09,940 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:09,941 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:09,941 INFO L85 PathProgramCache]: Analyzing trace with hash 390097434, now seen corresponding path program 1 times [2024-11-09 07:32:09,941 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:32:09,941 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005287856] [2024-11-09 07:32:09,941 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:09,941 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:32:09,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:10,014 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:32:10,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:10,017 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 07:32:10,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:10,019 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:32:10,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:32:10,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005287856] [2024-11-09 07:32:10,020 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1005287856] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:32:10,020 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:32:10,020 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:32:10,020 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1385595242] [2024-11-09 07:32:10,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:32:10,020 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:32:10,021 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:32:10,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:32:10,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:32:10,021 INFO L87 Difference]: Start difference. First operand 92 states and 116 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-09 07:32:10,092 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:10,092 INFO L93 Difference]: Finished difference Result 91 states and 115 transitions. [2024-11-09 07:32:10,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:32:10,092 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 20 [2024-11-09 07:32:10,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:10,093 INFO L225 Difference]: With dead ends: 91 [2024-11-09 07:32:10,093 INFO L226 Difference]: Without dead ends: 91 [2024-11-09 07:32:10,093 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-09 07:32:10,094 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 78 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 143 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:10,095 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 143 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:32:10,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2024-11-09 07:32:10,099 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2024-11-09 07:32:10,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 67 states have (on average 1.507462686567164) internal successors, (101), 84 states have internal predecessors, (101), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 07:32:10,100 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 115 transitions. [2024-11-09 07:32:10,100 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 115 transitions. Word has length 20 [2024-11-09 07:32:10,100 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:10,100 INFO L471 AbstractCegarLoop]: Abstraction has 91 states and 115 transitions. [2024-11-09 07:32:10,100 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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-09 07:32:10,101 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 115 transitions. [2024-11-09 07:32:10,101 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:32:10,101 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:10,101 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:10,101 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-09 07:32:10,101 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:10,102 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:10,102 INFO L85 PathProgramCache]: Analyzing trace with hash 390097435, now seen corresponding path program 1 times [2024-11-09 07:32:10,102 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:32:10,102 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1541061368] [2024-11-09 07:32:10,102 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:10,102 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:32:10,114 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:10,176 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:32:10,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:10,180 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 07:32:10,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:10,183 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:32:10,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:32:10,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1541061368] [2024-11-09 07:32:10,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1541061368] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:32:10,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:32:10,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-09 07:32:10,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1906011290] [2024-11-09 07:32:10,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:32:10,184 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:32:10,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:32:10,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:32:10,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-11-09 07:32:10,185 INFO L87 Difference]: Start difference. First operand 91 states and 115 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-09 07:32:10,244 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:10,244 INFO L93 Difference]: Finished difference Result 109 states and 140 transitions. [2024-11-09 07:32:10,245 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:32:10,245 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 20 [2024-11-09 07:32:10,246 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:10,247 INFO L225 Difference]: With dead ends: 109 [2024-11-09 07:32:10,247 INFO L226 Difference]: Without dead ends: 109 [2024-11-09 07:32:10,247 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 7 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-09 07:32:10,247 INFO L432 NwaCegarLoop]: 86 mSDtfsCounter, 22 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:10,248 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [23 Valid, 340 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:32:10,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-09 07:32:10,255 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 105. [2024-11-09 07:32:10,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 80 states have (on average 1.4875) internal successors, (119), 97 states have internal predecessors, (119), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:32:10,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 135 transitions. [2024-11-09 07:32:10,256 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 135 transitions. Word has length 20 [2024-11-09 07:32:10,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:10,257 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 135 transitions. [2024-11-09 07:32:10,257 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-09 07:32:10,260 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 135 transitions. [2024-11-09 07:32:10,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:32:10,261 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:10,261 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:10,261 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-09 07:32:10,261 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:10,261 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:10,261 INFO L85 PathProgramCache]: Analyzing trace with hash -743279592, now seen corresponding path program 1 times [2024-11-09 07:32:10,261 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:32:10,261 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [936608315] [2024-11-09 07:32:10,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:10,262 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:32:10,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:10,538 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:32:10,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:10,540 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 07:32:10,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:10,564 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:32:10,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:32:10,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [936608315] [2024-11-09 07:32:10,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [936608315] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:32:10,565 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2137794575] [2024-11-09 07:32:10,565 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:10,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:32:10,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:32:10,567 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:32:10,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-09 07:32:10,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:10,630 INFO L255 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 17 conjuncts are in the unsatisfiable core [2024-11-09 07:32:10,631 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:32:10,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-11-09 07:32:10,675 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:32:10,676 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 1 [2024-11-09 07:32:10,885 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:32:10,885 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:32:11,168 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:32:11,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2137794575] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:32:11,169 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:32:11,169 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2024-11-09 07:32:11,169 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [116212974] [2024-11-09 07:32:11,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:32:11,169 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 07:32:11,170 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:32:11,170 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 07:32:11,170 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=265, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:32:11,170 INFO L87 Difference]: Start difference. First operand 105 states and 135 transitions. Second operand has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:32:11,668 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:11,668 INFO L93 Difference]: Finished difference Result 110 states and 141 transitions. [2024-11-09 07:32:11,668 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-09 07:32:11,669 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2024-11-09 07:32:11,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:11,669 INFO L225 Difference]: With dead ends: 110 [2024-11-09 07:32:11,669 INFO L226 Difference]: Without dead ends: 110 [2024-11-09 07:32:11,670 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 34 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 92 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=132, Invalid=374, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:32:11,670 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 224 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 228 SdHoareTripleChecker+Valid, 572 SdHoareTripleChecker+Invalid, 561 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:11,671 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [228 Valid, 572 Invalid, 561 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:32:11,671 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-09 07:32:11,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 103. [2024-11-09 07:32:11,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 79 states have (on average 1.481012658227848) internal successors, (117), 95 states have internal predecessors, (117), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:32:11,674 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 133 transitions. [2024-11-09 07:32:11,674 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 133 transitions. Word has length 21 [2024-11-09 07:32:11,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:11,675 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 133 transitions. [2024-11-09 07:32:11,675 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 1.8333333333333333) internal successors, (33), 17 states have internal predecessors, (33), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:32:11,675 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 133 transitions. [2024-11-09 07:32:11,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:32:11,676 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:11,676 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:11,689 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-09 07:32:11,879 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2024-11-09 07:32:11,880 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:11,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:11,880 INFO L85 PathProgramCache]: Analyzing trace with hash -815465874, now seen corresponding path program 1 times [2024-11-09 07:32:11,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:32:11,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080938030] [2024-11-09 07:32:11,881 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:11,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:32:11,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:11,926 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:32:11,928 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:11,930 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 07:32:11,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:11,933 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:32:11,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:32:11,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080938030] [2024-11-09 07:32:11,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080938030] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:32:11,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:32:11,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:32:11,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891137337] [2024-11-09 07:32:11,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:32:11,936 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:32:11,936 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:32:11,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:32:11,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:32:11,936 INFO L87 Difference]: Start difference. First operand 103 states and 133 transitions. Second operand has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-09 07:32:11,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:11,989 INFO L93 Difference]: Finished difference Result 147 states and 190 transitions. [2024-11-09 07:32:11,989 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:32:11,990 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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 23 [2024-11-09 07:32:11,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:11,991 INFO L225 Difference]: With dead ends: 147 [2024-11-09 07:32:11,991 INFO L226 Difference]: Without dead ends: 147 [2024-11-09 07:32:11,991 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:32:11,992 INFO L432 NwaCegarLoop]: 93 mSDtfsCounter, 30 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:11,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 268 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:32:11,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-09 07:32:11,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 131. [2024-11-09 07:32:12,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 106 states have (on average 1.471698113207547) internal successors, (156), 122 states have internal predecessors, (156), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 07:32:12,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 174 transitions. [2024-11-09 07:32:12,001 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 174 transitions. Word has length 23 [2024-11-09 07:32:12,001 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:12,001 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 174 transitions. [2024-11-09 07:32:12,001 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.0) internal successors, (16), 4 states have internal predecessors, (16), 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-09 07:32:12,001 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 174 transitions. [2024-11-09 07:32:12,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:32:12,001 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:12,001 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:12,001 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2024-11-09 07:32:12,002 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:12,002 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:12,002 INFO L85 PathProgramCache]: Analyzing trace with hash -566622801, now seen corresponding path program 1 times [2024-11-09 07:32:12,002 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:32:12,002 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984788057] [2024-11-09 07:32:12,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:12,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:32:12,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:12,269 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:32:12,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:12,293 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 07:32:12,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:12,297 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:32:12,298 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:32:12,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984788057] [2024-11-09 07:32:12,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984788057] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:32:12,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [859130367] [2024-11-09 07:32:12,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:12,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:32:12,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:32:12,300 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:32:12,301 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-09 07:32:12,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:12,357 INFO L255 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 23 conjuncts are in the unsatisfiable core [2024-11-09 07:32:12,358 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:32:12,378 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:32:12,379 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 9 [2024-11-09 07:32:12,385 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 07:32:12,571 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:32:12,571 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:32:12,819 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:32:12,903 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:32:12,903 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [859130367] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:32:12,903 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:32:12,903 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 9] total 18 [2024-11-09 07:32:12,903 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934818892] [2024-11-09 07:32:12,903 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:32:12,904 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-11-09 07:32:12,904 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:32:12,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-11-09 07:32:12,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=268, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:32:12,904 INFO L87 Difference]: Start difference. First operand 131 states and 174 transitions. Second operand has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:32:13,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:13,402 INFO L93 Difference]: Finished difference Result 136 states and 180 transitions. [2024-11-09 07:32:13,402 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-11-09 07:32:13,403 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2024-11-09 07:32:13,403 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:13,404 INFO L225 Difference]: With dead ends: 136 [2024-11-09 07:32:13,404 INFO L226 Difference]: Without dead ends: 136 [2024-11-09 07:32:13,405 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 37 SyntacticMatches, 2 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 94 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=137, Invalid=415, Unknown=0, NotChecked=0, Total=552 [2024-11-09 07:32:13,405 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 169 mSDsluCounter, 330 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 413 SdHoareTripleChecker+Invalid, 309 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:13,405 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [173 Valid, 413 Invalid, 309 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:32:13,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-09 07:32:13,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 125. [2024-11-09 07:32:13,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.4752475247524752) internal successors, (149), 116 states have internal predecessors, (149), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 07:32:13,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 167 transitions. [2024-11-09 07:32:13,412 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 167 transitions. Word has length 23 [2024-11-09 07:32:13,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:13,412 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 167 transitions. [2024-11-09 07:32:13,413 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.0555555555555554) internal successors, (37), 17 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:32:13,414 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 167 transitions. [2024-11-09 07:32:13,414 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:32:13,414 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:13,414 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:13,428 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-09 07:32:13,614 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:32:13,615 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:13,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:13,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1807468280, now seen corresponding path program 1 times [2024-11-09 07:32:13,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:32:13,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1523392685] [2024-11-09 07:32:13,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:13,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:32:13,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:17,837 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:32:17,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:17,839 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 07:32:17,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:17,842 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:32:17,842 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:32:17,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1523392685] [2024-11-09 07:32:17,842 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1523392685] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:32:17,842 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [685005432] [2024-11-09 07:32:17,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:17,843 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:32:17,843 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:32:17,844 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:32:17,861 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-09 07:32:17,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:17,916 INFO L255 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 07:32:17,918 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:32:17,950 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 07:32:17,951 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:32:17,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [685005432] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:32:17,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:32:17,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 11 [2024-11-09 07:32:17,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320002961] [2024-11-09 07:32:17,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:32:17,951 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:32:17,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:32:17,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:32:17,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=83, Unknown=1, NotChecked=0, Total=110 [2024-11-09 07:32:17,952 INFO L87 Difference]: Start difference. First operand 125 states and 167 transitions. Second operand has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-09 07:32:18,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:18,025 INFO L93 Difference]: Finished difference Result 125 states and 158 transitions. [2024-11-09 07:32:18,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:32:18,026 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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 24 [2024-11-09 07:32:18,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:18,027 INFO L225 Difference]: With dead ends: 125 [2024-11-09 07:32:18,027 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 07:32:18,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 4.1s TimeCoverageRelationStatistics Valid=38, Invalid=117, Unknown=1, NotChecked=0, Total=156 [2024-11-09 07:32:18,028 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 19 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 345 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:18,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 345 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:32:18,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 07:32:18,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 116. [2024-11-09 07:32:18,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 92 states have (on average 1.4130434782608696) internal successors, (130), 107 states have internal predecessors, (130), 9 states have call successors, (9), 2 states have call predecessors, (9), 2 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 07:32:18,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 148 transitions. [2024-11-09 07:32:18,034 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 148 transitions. Word has length 24 [2024-11-09 07:32:18,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:18,034 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 148 transitions. [2024-11-09 07:32:18,034 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.8333333333333335) internal successors, (17), 6 states have internal predecessors, (17), 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-09 07:32:18,034 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 148 transitions. [2024-11-09 07:32:18,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:32:18,035 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:18,035 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:18,050 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-11-09 07:32:18,240 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:32:18,241 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:18,241 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:18,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1919689009, now seen corresponding path program 1 times [2024-11-09 07:32:18,241 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:32:18,241 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1219677414] [2024-11-09 07:32:18,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:18,241 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:32:18,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:18,388 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:32:18,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:18,391 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 07:32:18,393 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:18,394 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:32:18,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:32:18,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1219677414] [2024-11-09 07:32:18,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1219677414] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:32:18,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [317296527] [2024-11-09 07:32:18,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:18,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:32:18,395 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:32:18,397 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:32:18,398 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-09 07:32:18,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:18,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 10 conjuncts are in the unsatisfiable core [2024-11-09 07:32:18,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:32:18,585 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:32:18,586 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:32:18,784 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:32:18,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [317296527] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:32:18,784 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:32:18,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 17 [2024-11-09 07:32:18,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527019684] [2024-11-09 07:32:18,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:32:18,785 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 07:32:18,785 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:32:18,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 07:32:18,786 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=203, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:32:18,786 INFO L87 Difference]: Start difference. First operand 116 states and 148 transitions. Second operand has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 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-09 07:32:19,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:19,131 INFO L93 Difference]: Finished difference Result 270 states and 353 transitions. [2024-11-09 07:32:19,131 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-09 07:32:19,132 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 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 27 [2024-11-09 07:32:19,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:19,137 INFO L225 Difference]: With dead ends: 270 [2024-11-09 07:32:19,137 INFO L226 Difference]: Without dead ends: 270 [2024-11-09 07:32:19,137 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 100 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=116, Invalid=346, Unknown=0, NotChecked=0, Total=462 [2024-11-09 07:32:19,137 INFO L432 NwaCegarLoop]: 128 mSDtfsCounter, 644 mSDsluCounter, 804 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 652 SdHoareTripleChecker+Valid, 932 SdHoareTripleChecker+Invalid, 338 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:19,137 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [652 Valid, 932 Invalid, 338 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:32:19,138 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 270 states. [2024-11-09 07:32:19,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 270 to 172. [2024-11-09 07:32:19,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 146 states have (on average 1.4383561643835616) internal successors, (210), 161 states have internal predecessors, (210), 11 states have call successors, (11), 2 states have call predecessors, (11), 2 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 07:32:19,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 232 transitions. [2024-11-09 07:32:19,144 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 232 transitions. Word has length 27 [2024-11-09 07:32:19,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:19,144 INFO L471 AbstractCegarLoop]: Abstraction has 172 states and 232 transitions. [2024-11-09 07:32:19,144 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.3529411764705883) internal successors, (40), 17 states have internal predecessors, (40), 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-09 07:32:19,144 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 232 transitions. [2024-11-09 07:32:19,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:32:19,145 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:19,145 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:19,158 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-11-09 07:32:19,345 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2024-11-09 07:32:19,346 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:19,346 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:19,346 INFO L85 PathProgramCache]: Analyzing trace with hash -916311144, now seen corresponding path program 1 times [2024-11-09 07:32:19,346 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:32:19,346 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [69329928] [2024-11-09 07:32:19,346 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:19,346 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:32:19,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:19,432 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:32:19,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:19,435 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 07:32:19,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:19,437 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:32:19,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:32:19,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [69329928] [2024-11-09 07:32:19,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [69329928] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:32:19,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:32:19,437 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-09 07:32:19,437 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300269948] [2024-11-09 07:32:19,437 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:32:19,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:32:19,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:32:19,438 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:32:19,438 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-09 07:32:19,438 INFO L87 Difference]: Start difference. First operand 172 states and 232 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:32:19,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:19,495 INFO L93 Difference]: Finished difference Result 178 states and 237 transitions. [2024-11-09 07:32:19,495 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:32:19,496 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-11-09 07:32:19,496 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:19,497 INFO L225 Difference]: With dead ends: 178 [2024-11-09 07:32:19,497 INFO L226 Difference]: Without dead ends: 178 [2024-11-09 07:32:19,497 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-09 07:32:19,497 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 17 mSDsluCounter, 344 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 433 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:19,498 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 433 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:32:19,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178 states. [2024-11-09 07:32:19,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178 to 176. [2024-11-09 07:32:19,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 149 states have (on average 1.429530201342282) internal successors, (213), 164 states have internal predecessors, (213), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 07:32:19,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 235 transitions. [2024-11-09 07:32:19,503 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 235 transitions. Word has length 29 [2024-11-09 07:32:19,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:19,503 INFO L471 AbstractCegarLoop]: Abstraction has 176 states and 235 transitions. [2024-11-09 07:32:19,503 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:32:19,504 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 235 transitions. [2024-11-09 07:32:19,508 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-09 07:32:19,509 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:19,509 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:19,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-11-09 07:32:19,509 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:19,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:19,509 INFO L85 PathProgramCache]: Analyzing trace with hash 697923733, now seen corresponding path program 1 times [2024-11-09 07:32:19,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:32:19,509 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625441042] [2024-11-09 07:32:19,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:19,509 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:32:19,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:19,624 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:32:19,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:19,626 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 07:32:19,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:19,628 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 07:32:19,629 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:32:19,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625441042] [2024-11-09 07:32:19,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1625441042] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:32:19,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1501184494] [2024-11-09 07:32:19,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:19,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:32:19,629 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:32:19,631 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:32:19,632 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-09 07:32:19,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:19,694 INFO L255 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 07:32:19,695 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:32:19,770 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 07:32:19,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:32:19,825 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-09 07:32:19,836 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 07:32:19,837 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1501184494] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:32:19,837 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:32:19,837 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2024-11-09 07:32:19,837 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212694030] [2024-11-09 07:32:19,837 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:32:19,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-09 07:32:19,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:32:19,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-09 07:32:19,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:32:19,838 INFO L87 Difference]: Start difference. First operand 176 states and 235 transitions. Second operand has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 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-09 07:32:20,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:20,065 INFO L93 Difference]: Finished difference Result 209 states and 282 transitions. [2024-11-09 07:32:20,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:32:20,066 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 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 28 [2024-11-09 07:32:20,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:20,067 INFO L225 Difference]: With dead ends: 209 [2024-11-09 07:32:20,067 INFO L226 Difference]: Without dead ends: 209 [2024-11-09 07:32:20,067 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 40 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=65, Invalid=175, Unknown=0, NotChecked=0, Total=240 [2024-11-09 07:32:20,067 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 194 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 544 SdHoareTripleChecker+Invalid, 282 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:20,068 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [199 Valid, 544 Invalid, 282 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:32:20,068 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2024-11-09 07:32:20,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 182. [2024-11-09 07:32:20,073 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 155 states have (on average 1.4322580645161291) internal successors, (222), 170 states have internal predecessors, (222), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 07:32:20,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 244 transitions. [2024-11-09 07:32:20,073 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 244 transitions. Word has length 28 [2024-11-09 07:32:20,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:20,074 INFO L471 AbstractCegarLoop]: Abstraction has 182 states and 244 transitions. [2024-11-09 07:32:20,074 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 3.6363636363636362) internal successors, (40), 12 states have internal predecessors, (40), 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-09 07:32:20,074 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 244 transitions. [2024-11-09 07:32:20,074 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-11-09 07:32:20,074 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:20,075 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:20,088 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-11-09 07:32:20,279 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:32:20,280 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:20,280 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:20,280 INFO L85 PathProgramCache]: Analyzing trace with hash 231479490, now seen corresponding path program 1 times [2024-11-09 07:32:20,280 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:32:20,280 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [422390236] [2024-11-09 07:32:20,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:20,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:32:20,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:20,338 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:32:20,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:20,341 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 07:32:20,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:20,343 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 07:32:20,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:32:20,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [422390236] [2024-11-09 07:32:20,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [422390236] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:32:20,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:32:20,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-09 07:32:20,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592778288] [2024-11-09 07:32:20,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:32:20,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:32:20,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:32:20,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:32:20,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:32:20,345 INFO L87 Difference]: Start difference. First operand 182 states and 244 transitions. Second operand has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:32:20,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:20,359 INFO L93 Difference]: Finished difference Result 192 states and 254 transitions. [2024-11-09 07:32:20,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:32:20,360 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 30 [2024-11-09 07:32:20,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:20,361 INFO L225 Difference]: With dead ends: 192 [2024-11-09 07:32:20,361 INFO L226 Difference]: Without dead ends: 192 [2024-11-09 07:32:20,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:32:20,362 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 0 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 14 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:20,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 296 Invalid, 14 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:32:20,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2024-11-09 07:32:20,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 190. [2024-11-09 07:32:20,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 190 states, 163 states have (on average 1.4110429447852761) internal successors, (230), 178 states have internal predecessors, (230), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 07:32:20,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 190 states to 190 states and 252 transitions. [2024-11-09 07:32:20,368 INFO L78 Accepts]: Start accepts. Automaton has 190 states and 252 transitions. Word has length 30 [2024-11-09 07:32:20,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:20,368 INFO L471 AbstractCegarLoop]: Abstraction has 190 states and 252 transitions. [2024-11-09 07:32:20,369 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.5) internal successors, (22), 4 states have internal predecessors, (22), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:32:20,369 INFO L276 IsEmpty]: Start isEmpty. Operand 190 states and 252 transitions. [2024-11-09 07:32:20,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:32:20,369 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:20,369 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:20,369 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-09 07:32:20,369 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:20,370 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:20,370 INFO L85 PathProgramCache]: Analyzing trace with hash 160799248, now seen corresponding path program 1 times [2024-11-09 07:32:20,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:32:20,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [92038307] [2024-11-09 07:32:20,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:20,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:32:20,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:20,404 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:32:20,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:20,407 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 07:32:20,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:20,408 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 07:32:20,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:32:20,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [92038307] [2024-11-09 07:32:20,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [92038307] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:32:20,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:32:20,409 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:32:20,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1535942516] [2024-11-09 07:32:20,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:32:20,409 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:32:20,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:32:20,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:32:20,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:32:20,410 INFO L87 Difference]: Start difference. First operand 190 states and 252 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-09 07:32:20,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:20,462 INFO L93 Difference]: Finished difference Result 189 states and 249 transitions. [2024-11-09 07:32:20,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:32:20,462 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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 29 [2024-11-09 07:32:20,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:20,463 INFO L225 Difference]: With dead ends: 189 [2024-11-09 07:32:20,463 INFO L226 Difference]: Without dead ends: 189 [2024-11-09 07:32:20,463 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 5 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-09 07:32:20,464 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 78 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:20,464 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [83 Valid, 151 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:32:20,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2024-11-09 07:32:20,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 189. [2024-11-09 07:32:20,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 189 states, 163 states have (on average 1.392638036809816) internal successors, (227), 177 states have internal predecessors, (227), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 07:32:20,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 249 transitions. [2024-11-09 07:32:20,469 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 249 transitions. Word has length 29 [2024-11-09 07:32:20,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:20,470 INFO L471 AbstractCegarLoop]: Abstraction has 189 states and 249 transitions. [2024-11-09 07:32:20,470 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 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-09 07:32:20,470 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 249 transitions. [2024-11-09 07:32:20,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:32:20,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:20,470 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:20,471 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-11-09 07:32:20,471 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:20,471 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:20,471 INFO L85 PathProgramCache]: Analyzing trace with hash 160799249, now seen corresponding path program 1 times [2024-11-09 07:32:20,471 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:32:20,471 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967404008] [2024-11-09 07:32:20,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:20,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:32:20,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:20,615 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:32:20,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:20,618 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 07:32:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:20,619 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 07:32:20,620 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:32:20,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967404008] [2024-11-09 07:32:20,620 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967404008] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:32:20,620 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [692269896] [2024-11-09 07:32:20,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:20,620 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:32:20,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:32:20,622 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:32:20,624 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-09 07:32:20,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:20,683 INFO L255 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 07:32:20,685 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:32:20,769 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 07:32:20,770 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:32:20,810 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-09 07:32:20,835 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 07:32:20,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [692269896] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:32:20,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:32:20,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6, 6] total 13 [2024-11-09 07:32:20,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [633777146] [2024-11-09 07:32:20,836 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:32:20,837 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2024-11-09 07:32:20,837 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:32:20,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2024-11-09 07:32:20,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=135, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:32:20,838 INFO L87 Difference]: Start difference. First operand 189 states and 249 transitions. Second operand has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 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-09 07:32:21,105 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:21,106 INFO L93 Difference]: Finished difference Result 235 states and 302 transitions. [2024-11-09 07:32:21,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-09 07:32:21,106 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 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 29 [2024-11-09 07:32:21,106 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:21,107 INFO L225 Difference]: With dead ends: 235 [2024-11-09 07:32:21,107 INFO L226 Difference]: Without dead ends: 235 [2024-11-09 07:32:21,107 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:32:21,108 INFO L432 NwaCegarLoop]: 99 mSDtfsCounter, 164 mSDsluCounter, 567 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 666 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:21,108 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 666 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 365 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-09 07:32:21,108 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 235 states. [2024-11-09 07:32:21,111 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 235 to 198. [2024-11-09 07:32:21,111 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 172 states have (on average 1.3895348837209303) internal successors, (239), 186 states have internal predecessors, (239), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 07:32:21,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 261 transitions. [2024-11-09 07:32:21,112 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 261 transitions. Word has length 29 [2024-11-09 07:32:21,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:21,112 INFO L471 AbstractCegarLoop]: Abstraction has 198 states and 261 transitions. [2024-11-09 07:32:21,112 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 3.3076923076923075) internal successors, (43), 14 states have internal predecessors, (43), 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-09 07:32:21,112 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 261 transitions. [2024-11-09 07:32:21,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:32:21,113 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:21,113 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:21,126 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-09 07:32:21,315 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:32:21,316 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:21,316 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:21,317 INFO L85 PathProgramCache]: Analyzing trace with hash -117433678, now seen corresponding path program 1 times [2024-11-09 07:32:21,317 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:32:21,317 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1029005994] [2024-11-09 07:32:21,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:21,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:32:21,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:21,394 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2024-11-09 07:32:21,395 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:21,396 INFO L368 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 7 [2024-11-09 07:32:21,396 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:21,397 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 07:32:21,398 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-09 07:32:21,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1029005994] [2024-11-09 07:32:21,398 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1029005994] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-09 07:32:21,398 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1263789297] [2024-11-09 07:32:21,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:21,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-09 07:32:21,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:32:21,400 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-09 07:32:21,401 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-09 07:32:21,461 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:21,462 INFO L255 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 6 conjuncts are in the unsatisfiable core [2024-11-09 07:32:21,463 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:32:21,532 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 07:32:21,532 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:32:21,591 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 18 [2024-11-09 07:32:21,603 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 07:32:21,603 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1263789297] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:32:21,603 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-09 07:32:21,603 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 9 [2024-11-09 07:32:21,604 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [857469573] [2024-11-09 07:32:21,604 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-09 07:32:21,604 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:32:21,604 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-09 07:32:21,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:32:21,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=61, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:32:21,604 INFO L87 Difference]: Start difference. First operand 198 states and 261 transitions. Second operand has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 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-09 07:32:21,749 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:21,749 INFO L93 Difference]: Finished difference Result 211 states and 277 transitions. [2024-11-09 07:32:21,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:32:21,750 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 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 31 [2024-11-09 07:32:21,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:21,752 INFO L225 Difference]: With dead ends: 211 [2024-11-09 07:32:21,752 INFO L226 Difference]: Without dead ends: 211 [2024-11-09 07:32:21,752 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 61 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:32:21,753 INFO L432 NwaCegarLoop]: 100 mSDtfsCounter, 136 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 187 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 187 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:21,754 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [141 Valid, 390 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 187 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:32:21,754 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211 states. [2024-11-09 07:32:21,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211 to 200. [2024-11-09 07:32:21,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 200 states, 174 states have (on average 1.3908045977011494) internal successors, (242), 188 states have internal predecessors, (242), 11 states have call successors, (11), 3 states have call predecessors, (11), 3 states have return successors, (11), 9 states have call predecessors, (11), 11 states have call successors, (11) [2024-11-09 07:32:21,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 200 states to 200 states and 264 transitions. [2024-11-09 07:32:21,758 INFO L78 Accepts]: Start accepts. Automaton has 200 states and 264 transitions. Word has length 31 [2024-11-09 07:32:21,758 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:21,758 INFO L471 AbstractCegarLoop]: Abstraction has 200 states and 264 transitions. [2024-11-09 07:32:21,758 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.111111111111111) internal successors, (46), 10 states have internal predecessors, (46), 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-09 07:32:21,758 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 264 transitions. [2024-11-09 07:32:21,759 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:32:21,759 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:21,759 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:21,774 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-11-09 07:32:21,961 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,SelfDestructingSolverStorable17 [2024-11-09 07:32:21,961 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:21,961 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:21,961 INFO L85 PathProgramCache]: Analyzing trace with hash 1546399348, now seen corresponding path program 2 times [2024-11-09 07:32:21,962 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-09 07:32:21,962 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651960605] [2024-11-09 07:32:21,962 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:21,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-09 07:32:21,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:32:21,978 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 07:32:21,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:32:22,009 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2024-11-09 07:32:22,011 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 07:32:22,012 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2024-11-09 07:32:22,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2024-11-09 07:32:22,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2024-11-09 07:32:22,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2024-11-09 07:32:22,015 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2024-11-09 07:32:22,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2024-11-09 07:32:22,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2024-11-09 07:32:22,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2024-11-09 07:32:22,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2024-11-09 07:32:22,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2024-11-09 07:32:22,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2024-11-09 07:32:22,016 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2024-11-09 07:32:22,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2024-11-09 07:32:22,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2024-11-09 07:32:22,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2024-11-09 07:32:22,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2024-11-09 07:32:22,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2024-11-09 07:32:22,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 26 remaining) [2024-11-09 07:32:22,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 26 remaining) [2024-11-09 07:32:22,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 26 remaining) [2024-11-09 07:32:22,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2024-11-09 07:32:22,017 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2024-11-09 07:32:22,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2024-11-09 07:32:22,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2024-11-09 07:32:22,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2024-11-09 07:32:22,018 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 26 remaining) [2024-11-09 07:32:22,018 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-09 07:32:22,021 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:22,044 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:32:22,048 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:32:22 BoogieIcfgContainer [2024-11-09 07:32:22,048 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:32:22,049 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:32:22,049 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:32:22,049 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:32:22,050 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:32:07" (3/4) ... [2024-11-09 07:32:22,052 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 07:32:22,053 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:32:22,054 INFO L158 Benchmark]: Toolchain (without parser) took 15896.93ms. Allocated memory was 174.1MB in the beginning and 255.9MB in the end (delta: 81.8MB). Free memory was 104.3MB in the beginning and 123.1MB in the end (delta: -18.8MB). Peak memory consumption was 65.0MB. Max. memory is 16.1GB. [2024-11-09 07:32:22,054 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 104.9MB. Free memory is still 69.7MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:32:22,054 INFO L158 Benchmark]: CACSL2BoogieTranslator took 345.89ms. Allocated memory is still 174.1MB. Free memory was 104.1MB in the beginning and 143.6MB in the end (delta: -39.5MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. [2024-11-09 07:32:22,054 INFO L158 Benchmark]: Boogie Procedure Inliner took 57.54ms. Allocated memory is still 174.1MB. Free memory was 143.6MB in the beginning and 140.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2024-11-09 07:32:22,054 INFO L158 Benchmark]: Boogie Preprocessor took 43.56ms. Allocated memory is still 174.1MB. Free memory was 140.9MB in the beginning and 138.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:32:22,055 INFO L158 Benchmark]: RCFGBuilder took 532.24ms. Allocated memory is still 174.1MB. Free memory was 138.8MB in the beginning and 113.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. [2024-11-09 07:32:22,055 INFO L158 Benchmark]: TraceAbstraction took 14908.08ms. Allocated memory was 174.1MB in the beginning and 255.9MB in the end (delta: 81.8MB). Free memory was 113.0MB in the beginning and 123.1MB in the end (delta: -10.1MB). Peak memory consumption was 76.9MB. Max. memory is 16.1GB. [2024-11-09 07:32:22,055 INFO L158 Benchmark]: Witness Printer took 3.54ms. Allocated memory is still 255.9MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:32:22,057 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.10ms. Allocated memory is still 104.9MB. Free memory is still 69.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 345.89ms. Allocated memory is still 174.1MB. Free memory was 104.1MB in the beginning and 143.6MB in the end (delta: -39.5MB). Peak memory consumption was 28.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 57.54ms. Allocated memory is still 174.1MB. Free memory was 143.6MB in the beginning and 140.9MB in the end (delta: 2.7MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 43.56ms. Allocated memory is still 174.1MB. Free memory was 140.9MB in the beginning and 138.8MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 532.24ms. Allocated memory is still 174.1MB. Free memory was 138.8MB in the beginning and 113.6MB in the end (delta: 25.2MB). Peak memory consumption was 25.2MB. Max. memory is 16.1GB. * TraceAbstraction took 14908.08ms. Allocated memory was 174.1MB in the beginning and 255.9MB in the end (delta: 81.8MB). Free memory was 113.0MB in the beginning and 123.1MB in the end (delta: -10.1MB). Peak memory consumption was 76.9MB. Max. memory is 16.1GB. * Witness Printer took 3.54ms. Allocated memory is still 255.9MB. Free memory is still 123.1MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1128]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1128. Possible FailurePath: [L1130] unsigned long pat_len = __VERIFIER_nondet_ulong(), a_len = __VERIFIER_nondet_ulong(); [L1130] unsigned long pat_len = __VERIFIER_nondet_ulong(), a_len = __VERIFIER_nondet_ulong(); [L1132] CALL assume_abort_if_not(pat_len < 4294967296 / sizeof(int)) VAL [\old(cond)=1] [L5] COND FALSE !(!cond) VAL [\old(cond)=1] [L1132] RET assume_abort_if_not(pat_len < 4294967296 / sizeof(int)) VAL [pat_len=-4294967294] [L1133] CALL assume_abort_if_not(a_len < 4294967296 / sizeof(int)) VAL [\old(cond)=1] [L5] COND FALSE !(!cond) VAL [\old(cond)=1] [L1133] RET assume_abort_if_not(a_len < 4294967296 / sizeof(int)) VAL [a_len=0, pat_len=-4294967294] [L1134] int *pat=malloc(sizeof(int)*pat_len); [L1135] int *a=malloc(sizeof(int)*a_len); [L1139] int j = 0; VAL [a={-2:0}, a_len=0, j=0, pat={-1:0}, pat_len=-4294967294] [L1139] COND TRUE j < pat_len [L1140] pat[j] = __VERIFIER_nondet_int() [L1139] j++ VAL [a={-2:0}, a_len=0, j=1, pat={-1:0}, pat_len=-4294967294] [L1139] COND TRUE j < pat_len [L1140] pat[j] = __VERIFIER_nondet_int() [L1139] j++ VAL [a={-2:0}, a_len=0, j=2, pat={-1:0}, pat_len=-4294967294] [L1139] COND FALSE !(j < pat_len) VAL [a={-2:0}, a_len=0, pat={-1:0}, pat_len=-4294967294] [L1142] int j = 0; VAL [a={-2:0}, a_len=0, j=0, pat={-1:0}, pat_len=-4294967294] [L1142] COND FALSE !(j < a_len) VAL [a={-2:0}, a_len=0, pat={-1:0}, pat_len=-4294967294] [L1147] CALL is_relaxed_prefix(pat, pat_len, a, a_len) [L1106] COND TRUE pat_length>a_length+1 [L1107] return 0; VAL [\result=0, a={-2:0}, pat={-1:0}] [L1147] RET is_relaxed_prefix(pat, pat_len, a, a_len) [L1147] COND FALSE !(is_relaxed_prefix(pat, pat_len, a, a_len)) [L1163] COND FALSE !(pat_len<=a_len+1) [L1176] return 0; VAL [\result=0, a={-2:0}, pat={-1:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 97 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 14.8s, OverallIterations: 19, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 3.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 2227 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 2162 mSDsluCounter, 6590 SdHoareTripleChecker+Invalid, 1.9s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4965 mSDsCounter, 120 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2968 IncrementalHoareTripleChecker+Invalid, 3088 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 120 mSolverCounterUnsat, 1625 mSDtfsCounter, 2968 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 566 GetRequests, 404 SyntacticMatches, 6 SemanticMatches, 156 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 475 ImplicationChecksByTransitivity, 5.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=200occurred in iteration=18, InterpolantAutomatonStates: 128, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 18 MinimizatonAttempts, 227 StatesRemovedByMinimization, 13 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 8.7s InterpolantComputationTime, 642 NumberOfCodeBlocks, 642 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 752 ConstructedInterpolants, 2 QuantifiedInterpolants, 4991 SizeOfPredicates, 30 NumberOfNonLiveVariables, 845 ConjunctsInSsa, 114 ConjunctsInUnsatCore, 33 InterpolantComputations, 11 PerfectInterpolantSequences, 127/188 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 07:32:22,084 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/array-examples/relax-2-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.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 56e9aa9f750ced23bf75100b2ff89e86c96f8abe4883dfab569153879bc59aef --- Real Ultimate output --- This is Ultimate 0.2.5-?-c7c6ca5-m [2024-11-09 07:32:23,955 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-09 07:32:24,024 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2024-11-09 07:32:24,039 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-09 07:32:24,039 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-09 07:32:24,063 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-09 07:32:24,064 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-09 07:32:24,064 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-09 07:32:24,065 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-09 07:32:24,065 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-09 07:32:24,065 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-09 07:32:24,066 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-09 07:32:24,066 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-09 07:32:24,066 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-09 07:32:24,066 INFO L153 SettingsManager]: * Use SBE=true [2024-11-09 07:32:24,067 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-09 07:32:24,067 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-09 07:32:24,067 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-09 07:32:24,067 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-09 07:32:24,067 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-09 07:32:24,068 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-09 07:32:24,071 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-09 07:32:24,072 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-09 07:32:24,072 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-09 07:32:24,072 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-09 07:32:24,072 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2024-11-09 07:32:24,072 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-09 07:32:24,073 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2024-11-09 07:32:24,073 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-09 07:32:24,073 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-09 07:32:24,073 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-09 07:32:24,073 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-09 07:32:24,073 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-09 07:32:24,074 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-09 07:32:24,074 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-09 07:32:24,074 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:32:24,074 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-09 07:32:24,074 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-09 07:32:24,078 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2024-11-09 07:32:24,078 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2024-11-09 07:32:24,078 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-09 07:32:24,079 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-09 07:32:24,079 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-09 07:32:24,079 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-09 07:32:24,079 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 -> 56e9aa9f750ced23bf75100b2ff89e86c96f8abe4883dfab569153879bc59aef [2024-11-09 07:32:24,358 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-09 07:32:24,381 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-09 07:32:24,385 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-09 07:32:24,386 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-09 07:32:24,386 INFO L274 PluginConnector]: CDTParser initialized [2024-11-09 07:32:24,387 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-examples/relax-2-2.i [2024-11-09 07:32:25,778 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-09 07:32:25,998 INFO L384 CDTParser]: Found 1 translation units. [2024-11-09 07:32:25,999 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-examples/relax-2-2.i [2024-11-09 07:32:26,025 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/673c47864/6764ef4907f442ab8d8ecd3e3f506608/FLAGf7411f301 [2024-11-09 07:32:26,041 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/673c47864/6764ef4907f442ab8d8ecd3e3f506608 [2024-11-09 07:32:26,044 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-09 07:32:26,045 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-09 07:32:26,047 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-09 07:32:26,047 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-09 07:32:26,052 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-09 07:32:26,052 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:32:26" (1/1) ... [2024-11-09 07:32:26,053 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600bd995 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:26, skipping insertion in model container [2024-11-09 07:32:26,053 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.11 07:32:26" (1/1) ... [2024-11-09 07:32:26,096 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-09 07:32:26,371 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:32:26,384 INFO L200 MainTranslator]: Completed pre-run [2024-11-09 07:32:26,430 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-09 07:32:26,466 INFO L204 MainTranslator]: Completed translation [2024-11-09 07:32:26,466 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:26 WrapperNode [2024-11-09 07:32:26,466 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-09 07:32:26,467 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-09 07:32:26,467 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-09 07:32:26,467 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-09 07:32:26,473 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:26" (1/1) ... [2024-11-09 07:32:26,490 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:26" (1/1) ... [2024-11-09 07:32:26,511 INFO L138 Inliner]: procedures = 123, calls = 29, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 147 [2024-11-09 07:32:26,511 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-09 07:32:26,512 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-09 07:32:26,512 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-09 07:32:26,512 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-09 07:32:26,521 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:26" (1/1) ... [2024-11-09 07:32:26,522 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:26" (1/1) ... [2024-11-09 07:32:26,525 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:26" (1/1) ... [2024-11-09 07:32:26,538 INFO L175 MemorySlicer]: Split 14 memory accesses to 3 slices as follows [2, 6, 6]. 43 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 2 writes are split as follows [0, 1, 1]. [2024-11-09 07:32:26,542 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:26" (1/1) ... [2024-11-09 07:32:26,542 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:26" (1/1) ... [2024-11-09 07:32:26,548 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:26" (1/1) ... [2024-11-09 07:32:26,552 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:26" (1/1) ... [2024-11-09 07:32:26,558 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:26" (1/1) ... [2024-11-09 07:32:26,559 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:26" (1/1) ... [2024-11-09 07:32:26,563 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-09 07:32:26,564 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-09 07:32:26,564 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-09 07:32:26,564 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-09 07:32:26,565 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:26" (1/1) ... [2024-11-09 07:32:26,569 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-09 07:32:26,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-09 07:32:26,593 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-09 07:32:26,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-09 07:32:26,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2024-11-09 07:32:26,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2024-11-09 07:32:26,628 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2024-11-09 07:32:26,628 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2024-11-09 07:32:26,628 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2024-11-09 07:32:26,628 INFO L130 BoogieDeclarations]: Found specification of procedure assume_abort_if_not [2024-11-09 07:32:26,628 INFO L138 BoogieDeclarations]: Found implementation of procedure assume_abort_if_not [2024-11-09 07:32:26,628 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-09 07:32:26,629 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-09 07:32:26,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2024-11-09 07:32:26,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2024-11-09 07:32:26,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2024-11-09 07:32:26,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2024-11-09 07:32:26,629 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2024-11-09 07:32:26,631 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2024-11-09 07:32:26,631 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-09 07:32:26,631 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-09 07:32:26,747 INFO L238 CfgBuilder]: Building ICFG [2024-11-09 07:32:26,750 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-09 07:32:27,162 INFO L? ?]: Removed 90 outVars from TransFormulas that were not future-live. [2024-11-09 07:32:27,162 INFO L287 CfgBuilder]: Performing block encoding [2024-11-09 07:32:27,175 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-09 07:32:27,175 INFO L316 CfgBuilder]: Removed 5 assume(true) statements. [2024-11-09 07:32:27,176 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:32:27 BoogieIcfgContainer [2024-11-09 07:32:27,176 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-09 07:32:27,177 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-09 07:32:27,177 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-09 07:32:27,179 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-09 07:32:27,180 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.11 07:32:26" (1/3) ... [2024-11-09 07:32:27,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5c59b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:32:27, skipping insertion in model container [2024-11-09 07:32:27,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.11 07:32:26" (2/3) ... [2024-11-09 07:32:27,181 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4c5c59b9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.11 07:32:27, skipping insertion in model container [2024-11-09 07:32:27,181 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:32:27" (3/3) ... [2024-11-09 07:32:27,182 INFO L112 eAbstractionObserver]: Analyzing ICFG relax-2-2.i [2024-11-09 07:32:27,196 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-09 07:32:27,196 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 26 error locations. [2024-11-09 07:32:27,235 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-09 07:32:27,242 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;@d4542d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-09 07:32:27,243 INFO L334 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2024-11-09 07:32:27,247 INFO L276 IsEmpty]: Start isEmpty. Operand has 97 states, 61 states have (on average 1.8360655737704918) internal successors, (112), 90 states have internal predecessors, (112), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 07:32:27,254 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:32:27,255 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:27,256 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:27,256 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:27,260 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:27,261 INFO L85 PathProgramCache]: Analyzing trace with hash 44061928, now seen corresponding path program 1 times [2024-11-09 07:32:27,270 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:32:27,271 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [965237310] [2024-11-09 07:32:27,271 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:27,271 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:27,272 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:32:27,274 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:32:27,275 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2024-11-09 07:32:27,354 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:27,356 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 1 conjuncts are in the unsatisfiable core [2024-11-09 07:32:27,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:32:27,376 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:32:27,376 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:32:27,376 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:32:27,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [965237310] [2024-11-09 07:32:27,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [965237310] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:32:27,377 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:32:27,377 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:32:27,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [491432641] [2024-11-09 07:32:27,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:32:27,382 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-09 07:32:27,382 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:32:27,400 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-09 07:32:27,400 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-09 07:32:27,402 INFO L87 Difference]: Start difference. First operand has 97 states, 61 states have (on average 1.8360655737704918) internal successors, (112), 90 states have internal predecessors, (112), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) Second operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:32:27,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:27,428 INFO L93 Difference]: Finished difference Result 96 states and 117 transitions. [2024-11-09 07:32:27,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-09 07:32:27,430 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Word has length 15 [2024-11-09 07:32:27,430 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:27,435 INFO L225 Difference]: With dead ends: 96 [2024-11-09 07:32:27,435 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 07:32:27,437 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 14 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-09 07:32:27,439 INFO L432 NwaCegarLoop]: 117 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, 117 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-09 07:32:27,439 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-09 07:32:27,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 07:32:27,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2024-11-09 07:32:27,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 59 states have (on average 1.7118644067796611) internal successors, (101), 87 states have internal predecessors, (101), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 07:32:27,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 115 transitions. [2024-11-09 07:32:27,468 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 115 transitions. Word has length 15 [2024-11-09 07:32:27,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:27,468 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 115 transitions. [2024-11-09 07:32:27,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 2 states have call successors, (2), 2 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2024-11-09 07:32:27,469 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 115 transitions. [2024-11-09 07:32:27,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:32:27,470 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:27,470 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:27,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2024-11-09 07:32:27,670 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:27,671 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:27,671 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:27,671 INFO L85 PathProgramCache]: Analyzing trace with hash 802384808, now seen corresponding path program 1 times [2024-11-09 07:32:27,672 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:32:27,672 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [812076592] [2024-11-09 07:32:27,672 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:27,672 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:27,672 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:32:27,675 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:32:27,676 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2024-11-09 07:32:27,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:27,750 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:32:27,754 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:32:27,863 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2024-11-09 07:32:27,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2024-11-09 07:32:27,901 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:32:27,901 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:32:27,902 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:32:27,902 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [812076592] [2024-11-09 07:32:27,902 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [812076592] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:32:27,902 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:32:27,902 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:32:27,902 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1379597212] [2024-11-09 07:32:27,902 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:32:27,903 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:32:27,903 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:32:27,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:32:27,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:32:27,904 INFO L87 Difference]: Start difference. First operand 94 states and 115 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-09 07:32:28,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:28,035 INFO L93 Difference]: Finished difference Result 89 states and 110 transitions. [2024-11-09 07:32:28,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:32:28,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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 15 [2024-11-09 07:32:28,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:28,037 INFO L225 Difference]: With dead ends: 89 [2024-11-09 07:32:28,037 INFO L226 Difference]: Without dead ends: 89 [2024-11-09 07:32:28,037 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:32:28,038 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 77 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:28,039 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 98 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:32:28,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-11-09 07:32:28,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-11-09 07:32:28,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 59 states have (on average 1.6271186440677967) internal successors, (96), 82 states have internal predecessors, (96), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 07:32:28,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 110 transitions. [2024-11-09 07:32:28,047 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 110 transitions. Word has length 15 [2024-11-09 07:32:28,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:28,048 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 110 transitions. [2024-11-09 07:32:28,048 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 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-09 07:32:28,048 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 110 transitions. [2024-11-09 07:32:28,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2024-11-09 07:32:28,053 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:28,053 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:28,056 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2024-11-09 07:32:28,253 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:28,254 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:28,254 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:28,254 INFO L85 PathProgramCache]: Analyzing trace with hash 802384809, now seen corresponding path program 1 times [2024-11-09 07:32:28,255 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:32:28,255 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1979105600] [2024-11-09 07:32:28,255 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:28,255 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:28,255 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:32:28,256 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:32:28,257 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2024-11-09 07:32:28,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:28,297 INFO L255 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 07:32:28,299 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:32:28,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:32:28,371 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-11-09 07:32:28,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 07:32:28,483 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:32:28,483 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:32:28,630 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:32:28,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:32:28,748 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:32:28,748 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1979105600] [2024-11-09 07:32:28,748 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1979105600] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:32:28,748 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:32:28,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2024-11-09 07:32:28,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [36667972] [2024-11-09 07:32:28,749 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:32:28,750 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-09 07:32:28,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:32:28,751 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-09 07:32:28,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2024-11-09 07:32:28,752 INFO L87 Difference]: Start difference. First operand 89 states and 110 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:32:29,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:29,357 INFO L93 Difference]: Finished difference Result 96 states and 119 transitions. [2024-11-09 07:32:29,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:32:29,358 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 15 [2024-11-09 07:32:29,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:29,359 INFO L225 Difference]: With dead ends: 96 [2024-11-09 07:32:29,360 INFO L226 Difference]: Without dead ends: 96 [2024-11-09 07:32:29,360 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2024-11-09 07:32:29,361 INFO L432 NwaCegarLoop]: 89 mSDtfsCounter, 93 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 219 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 463 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 219 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:29,361 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 463 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 219 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:32:29,363 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2024-11-09 07:32:29,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 95. [2024-11-09 07:32:29,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 65 states have (on average 1.6) internal successors, (104), 88 states have internal predecessors, (104), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 07:32:29,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 118 transitions. [2024-11-09 07:32:29,369 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 118 transitions. Word has length 15 [2024-11-09 07:32:29,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:29,370 INFO L471 AbstractCegarLoop]: Abstraction has 95 states and 118 transitions. [2024-11-09 07:32:29,370 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 9 states have internal predecessors, (16), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:32:29,370 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 118 transitions. [2024-11-09 07:32:29,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:32:29,370 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:29,370 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:29,374 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2024-11-09 07:32:29,571 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:29,571 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:29,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:29,572 INFO L85 PathProgramCache]: Analyzing trace with hash -2002363436, now seen corresponding path program 1 times [2024-11-09 07:32:29,572 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:32:29,572 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776064855] [2024-11-09 07:32:29,572 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:29,573 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:29,573 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:32:29,575 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:32:29,576 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2024-11-09 07:32:29,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:29,611 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-11-09 07:32:29,612 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:32:29,618 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 7 [2024-11-09 07:32:29,627 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:32:29,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-11-09 07:32:29,639 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:32:29,639 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:32:29,639 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:32:29,639 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776064855] [2024-11-09 07:32:29,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1776064855] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:32:29,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:32:29,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-09 07:32:29,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [31593000] [2024-11-09 07:32:29,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:32:29,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-09 07:32:29,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:32:29,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-09 07:32:29,640 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:32:29,641 INFO L87 Difference]: Start difference. First operand 95 states and 118 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-09 07:32:29,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:29,716 INFO L93 Difference]: Finished difference Result 90 states and 113 transitions. [2024-11-09 07:32:29,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-09 07:32:29,717 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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 17 [2024-11-09 07:32:29,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:29,717 INFO L225 Difference]: With dead ends: 90 [2024-11-09 07:32:29,717 INFO L226 Difference]: Without dead ends: 90 [2024-11-09 07:32:29,717 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-09 07:32:29,718 INFO L432 NwaCegarLoop]: 84 mSDtfsCounter, 70 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 98 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:29,718 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 98 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:32:29,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2024-11-09 07:32:29,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2024-11-09 07:32:29,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 65 states have (on average 1.523076923076923) internal successors, (99), 83 states have internal predecessors, (99), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 07:32:29,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2024-11-09 07:32:29,730 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 17 [2024-11-09 07:32:29,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:29,730 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2024-11-09 07:32:29,730 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 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-09 07:32:29,730 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2024-11-09 07:32:29,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-09 07:32:29,731 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:29,731 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:29,735 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Ended with exit code 0 [2024-11-09 07:32:29,931 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:29,932 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:29,932 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:29,932 INFO L85 PathProgramCache]: Analyzing trace with hash -2002363435, now seen corresponding path program 1 times [2024-11-09 07:32:29,933 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:32:29,933 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1290734992] [2024-11-09 07:32:29,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:29,933 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:29,933 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:32:29,935 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:32:29,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2024-11-09 07:32:29,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:29,974 INFO L255 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:32:29,975 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:32:30,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-09 07:32:30,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:32:30,022 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-09 07:32:30,136 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:32:30,136 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:32:30,137 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:32:30,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1290734992] [2024-11-09 07:32:30,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1290734992] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:32:30,137 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:32:30,137 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2024-11-09 07:32:30,137 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329145822] [2024-11-09 07:32:30,137 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:32:30,138 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:32:30,138 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:32:30,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:32:30,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:32:30,139 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:32:30,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:30,477 INFO L93 Difference]: Finished difference Result 94 states and 118 transitions. [2024-11-09 07:32:30,479 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:32:30,480 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 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 17 [2024-11-09 07:32:30,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:30,480 INFO L225 Difference]: With dead ends: 94 [2024-11-09 07:32:30,480 INFO L226 Difference]: Without dead ends: 94 [2024-11-09 07:32:30,481 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:32:30,481 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 78 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:30,482 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 298 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-09 07:32:30,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2024-11-09 07:32:30,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 92. [2024-11-09 07:32:30,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 67 states have (on average 1.5223880597014925) internal successors, (102), 85 states have internal predecessors, (102), 7 states have call successors, (7), 2 states have call predecessors, (7), 2 states have return successors, (7), 5 states have call predecessors, (7), 7 states have call successors, (7) [2024-11-09 07:32:30,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 116 transitions. [2024-11-09 07:32:30,486 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 116 transitions. Word has length 17 [2024-11-09 07:32:30,486 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:30,486 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 116 transitions. [2024-11-09 07:32:30,486 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 1.8571428571428572) internal successors, (13), 7 states have internal predecessors, (13), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:32:30,486 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 116 transitions. [2024-11-09 07:32:30,487 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-11-09 07:32:30,487 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:30,487 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:30,494 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2024-11-09 07:32:30,689 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:30,690 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:30,690 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:30,690 INFO L85 PathProgramCache]: Analyzing trace with hash 390097434, now seen corresponding path program 1 times [2024-11-09 07:32:30,690 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:32:30,690 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1884465484] [2024-11-09 07:32:30,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:30,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:30,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:32:30,692 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:32:30,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2024-11-09 07:32:30,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:30,741 INFO L255 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 07:32:30,742 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:32:30,796 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:32:30,796 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:32:30,838 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:32:30,838 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:32:30,838 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1884465484] [2024-11-09 07:32:30,843 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1884465484] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 07:32:30,843 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:32:30,843 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [8] total 9 [2024-11-09 07:32:30,843 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [925340191] [2024-11-09 07:32:30,844 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:32:30,844 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-09 07:32:30,844 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:32:30,844 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-09 07:32:30,844 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:32:30,845 INFO L87 Difference]: Start difference. First operand 92 states and 116 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-09 07:32:30,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:30,930 INFO L93 Difference]: Finished difference Result 116 states and 144 transitions. [2024-11-09 07:32:30,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-09 07:32:30,932 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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 20 [2024-11-09 07:32:30,932 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:30,932 INFO L225 Difference]: With dead ends: 116 [2024-11-09 07:32:30,932 INFO L226 Difference]: Without dead ends: 116 [2024-11-09 07:32:30,933 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:32:30,933 INFO L432 NwaCegarLoop]: 91 mSDtfsCounter, 24 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 350 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:30,933 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [25 Valid, 350 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:32:30,934 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-11-09 07:32:30,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 115. [2024-11-09 07:32:30,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 89 states have (on average 1.4382022471910112) internal successors, (128), 107 states have internal predecessors, (128), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:32:30,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 144 transitions. [2024-11-09 07:32:30,947 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 144 transitions. Word has length 20 [2024-11-09 07:32:30,947 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:30,947 INFO L471 AbstractCegarLoop]: Abstraction has 115 states and 144 transitions. [2024-11-09 07:32:30,947 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 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-09 07:32:30,948 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 144 transitions. [2024-11-09 07:32:30,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-11-09 07:32:30,948 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:30,948 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:30,954 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Ended with exit code 0 [2024-11-09 07:32:31,148 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:31,149 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:31,149 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:31,149 INFO L85 PathProgramCache]: Analyzing trace with hash -743279592, now seen corresponding path program 1 times [2024-11-09 07:32:31,150 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:32:31,150 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [466071955] [2024-11-09 07:32:31,150 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:31,150 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:31,150 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:32:31,151 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:32:31,152 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2024-11-09 07:32:31,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:31,188 INFO L255 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 11 conjuncts are in the unsatisfiable core [2024-11-09 07:32:31,189 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:32:31,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-11-09 07:32:31,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:32:31,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2024-11-09 07:32:31,430 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:32:31,430 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:32:31,893 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:32:31,894 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:32:31,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [466071955] [2024-11-09 07:32:31,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [466071955] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:32:31,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:32:31,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-09 07:32:31,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1765031329] [2024-11-09 07:32:31,894 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:32:31,894 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 07:32:31,894 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:32:31,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 07:32:31,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:32:31,895 INFO L87 Difference]: Start difference. First operand 115 states and 144 transitions. Second operand has 17 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:32:32,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:32,595 INFO L93 Difference]: Finished difference Result 126 states and 156 transitions. [2024-11-09 07:32:32,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-11-09 07:32:32,596 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) Word has length 21 [2024-11-09 07:32:32,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:32,596 INFO L225 Difference]: With dead ends: 126 [2024-11-09 07:32:32,597 INFO L226 Difference]: Without dead ends: 126 [2024-11-09 07:32:32,597 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 25 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2024-11-09 07:32:32,597 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 208 mSDsluCounter, 342 mSDsCounter, 0 mSdLazyCounter, 359 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 359 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:32,598 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 404 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 359 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2024-11-09 07:32:32,602 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-09 07:32:32,605 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 110. [2024-11-09 07:32:32,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 85 states have (on average 1.411764705882353) internal successors, (120), 102 states have internal predecessors, (120), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:32:32,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 136 transitions. [2024-11-09 07:32:32,606 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 136 transitions. Word has length 21 [2024-11-09 07:32:32,607 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:32,607 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 136 transitions. [2024-11-09 07:32:32,607 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 1.75) internal successors, (28), 15 states have internal predecessors, (28), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 1 states have call successors, (3) [2024-11-09 07:32:32,607 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 136 transitions. [2024-11-09 07:32:32,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2024-11-09 07:32:32,612 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:32,612 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:32,618 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Ended with exit code 0 [2024-11-09 07:32:32,812 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:32,813 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:32,813 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:32,813 INFO L85 PathProgramCache]: Analyzing trace with hash -566622801, now seen corresponding path program 1 times [2024-11-09 07:32:32,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:32:32,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2144173592] [2024-11-09 07:32:32,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:32,814 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:32,814 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:32:32,815 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:32:32,816 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2024-11-09 07:32:32,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:32,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 14 conjuncts are in the unsatisfiable core [2024-11-09 07:32:32,860 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:32:32,889 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:32:32,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 7 [2024-11-09 07:32:32,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2024-11-09 07:32:33,108 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:32:33,108 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:32:33,562 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-09 07:32:33,670 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:32:33,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:32:33,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2144173592] [2024-11-09 07:32:33,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2144173592] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:32:33,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:32:33,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2024-11-09 07:32:33,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840322610] [2024-11-09 07:32:33,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:32:33,671 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2024-11-09 07:32:33,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:32:33,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2024-11-09 07:32:33,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=208, Unknown=0, NotChecked=0, Total=272 [2024-11-09 07:32:33,672 INFO L87 Difference]: Start difference. First operand 110 states and 136 transitions. Second operand has 17 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:32:35,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:35,368 INFO L93 Difference]: Finished difference Result 127 states and 157 transitions. [2024-11-09 07:32:35,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-11-09 07:32:35,369 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) Word has length 23 [2024-11-09 07:32:35,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:35,370 INFO L225 Difference]: With dead ends: 127 [2024-11-09 07:32:35,370 INFO L226 Difference]: Without dead ends: 127 [2024-11-09 07:32:35,370 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 98 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=166, Invalid=434, Unknown=0, NotChecked=0, Total=600 [2024-11-09 07:32:35,370 INFO L432 NwaCegarLoop]: 85 mSDtfsCounter, 194 mSDsluCounter, 659 mSDsCounter, 0 mSdLazyCounter, 503 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 744 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 503 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:35,371 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [198 Valid, 744 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 503 Invalid, 0 Unknown, 0 Unchecked, 1.2s Time] [2024-11-09 07:32:35,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2024-11-09 07:32:35,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 126. [2024-11-09 07:32:35,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 101 states have (on average 1.386138613861386) internal successors, (140), 118 states have internal predecessors, (140), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:32:35,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 156 transitions. [2024-11-09 07:32:35,382 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 156 transitions. Word has length 23 [2024-11-09 07:32:35,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:35,382 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 156 transitions. [2024-11-09 07:32:35,383 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 15 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 2 states have call predecessors, (4), 3 states have call successors, (4) [2024-11-09 07:32:35,383 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 156 transitions. [2024-11-09 07:32:35,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:32:35,383 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:35,383 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:35,389 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2024-11-09 07:32:35,584 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:35,585 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:35,585 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:35,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1891012041, now seen corresponding path program 1 times [2024-11-09 07:32:35,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:32:35,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1911225664] [2024-11-09 07:32:35,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:35,586 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:35,586 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:32:35,588 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:32:35,590 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2024-11-09 07:32:35,633 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:35,635 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 4 conjuncts are in the unsatisfiable core [2024-11-09 07:32:35,636 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:32:35,658 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:32:35,659 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:32:35,659 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:32:35,659 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1911225664] [2024-11-09 07:32:35,659 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1911225664] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:32:35,659 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:32:35,659 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:32:35,659 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2074822418] [2024-11-09 07:32:35,659 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:32:35,660 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:32:35,660 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:32:35,660 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:32:35,661 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:32:35,661 INFO L87 Difference]: Start difference. First operand 126 states and 156 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-09 07:32:35,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:35,791 INFO L93 Difference]: Finished difference Result 125 states and 155 transitions. [2024-11-09 07:32:35,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:32:35,792 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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 24 [2024-11-09 07:32:35,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:35,793 INFO L225 Difference]: With dead ends: 125 [2024-11-09 07:32:35,793 INFO L226 Difference]: Without dead ends: 125 [2024-11-09 07:32:35,793 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 21 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-09 07:32:35,794 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 79 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 65 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:35,794 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 151 Invalid, 65 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:32:35,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 125 states. [2024-11-09 07:32:35,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 125 to 125. [2024-11-09 07:32:35,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 101 states have (on average 1.3762376237623761) internal successors, (139), 117 states have internal predecessors, (139), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:32:35,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 155 transitions. [2024-11-09 07:32:35,800 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 155 transitions. Word has length 24 [2024-11-09 07:32:35,801 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:35,801 INFO L471 AbstractCegarLoop]: Abstraction has 125 states and 155 transitions. [2024-11-09 07:32:35,801 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 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-09 07:32:35,801 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 155 transitions. [2024-11-09 07:32:35,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2024-11-09 07:32:35,807 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:35,807 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:35,810 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Ended with exit code 0 [2024-11-09 07:32:36,007 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:36,007 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:36,008 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:36,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1891012040, now seen corresponding path program 1 times [2024-11-09 07:32:36,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:32:36,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [531489371] [2024-11-09 07:32:36,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:36,008 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:36,008 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:32:36,010 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:32:36,011 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2024-11-09 07:32:36,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:36,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-09 07:32:36,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:32:36,131 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:32:36,131 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:32:36,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 21 [2024-11-09 07:32:36,296 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:32:36,296 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:32:36,296 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [531489371] [2024-11-09 07:32:36,297 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [531489371] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:32:36,297 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:32:36,297 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 9 [2024-11-09 07:32:36,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [85253370] [2024-11-09 07:32:36,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:32:36,297 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2024-11-09 07:32:36,297 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:32:36,297 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2024-11-09 07:32:36,298 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2024-11-09 07:32:36,298 INFO L87 Difference]: Start difference. First operand 125 states and 155 transitions. Second operand has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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-09 07:32:36,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:36,895 INFO L93 Difference]: Finished difference Result 140 states and 174 transitions. [2024-11-09 07:32:36,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:32:36,895 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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 24 [2024-11-09 07:32:36,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:36,896 INFO L225 Difference]: With dead ends: 140 [2024-11-09 07:32:36,896 INFO L226 Difference]: Without dead ends: 140 [2024-11-09 07:32:36,896 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2024-11-09 07:32:36,897 INFO L432 NwaCegarLoop]: 102 mSDtfsCounter, 114 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 338 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 674 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 338 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:36,897 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 674 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 338 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-11-09 07:32:36,897 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2024-11-09 07:32:36,901 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 127. [2024-11-09 07:32:36,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 103 states have (on average 1.3786407766990292) internal successors, (142), 119 states have internal predecessors, (142), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:32:36,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 158 transitions. [2024-11-09 07:32:36,903 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 158 transitions. Word has length 24 [2024-11-09 07:32:36,903 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:36,903 INFO L471 AbstractCegarLoop]: Abstraction has 127 states and 158 transitions. [2024-11-09 07:32:36,903 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.2222222222222223) internal successors, (29), 10 states have internal predecessors, (29), 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-09 07:32:36,903 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 158 transitions. [2024-11-09 07:32:36,904 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:32:36,904 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:36,904 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:36,908 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Ended with exit code 0 [2024-11-09 07:32:37,107 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:37,107 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:37,108 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:37,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1508168909, now seen corresponding path program 1 times [2024-11-09 07:32:37,108 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:32:37,108 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [62246989] [2024-11-09 07:32:37,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:37,108 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:37,108 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:32:37,111 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:32:37,111 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2024-11-09 07:32:37,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:37,155 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-09 07:32:37,157 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:32:37,167 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2024-11-09 07:32:37,173 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:32:37,174 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2024-11-09 07:32:37,196 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-09 07:32:37,196 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:32:37,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:32:37,196 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [62246989] [2024-11-09 07:32:37,196 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [62246989] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:32:37,196 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:32:37,196 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-09 07:32:37,196 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387265935] [2024-11-09 07:32:37,196 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:32:37,197 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-09 07:32:37,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:32:37,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-09 07:32:37,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-09 07:32:37,197 INFO L87 Difference]: Start difference. First operand 127 states and 158 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-09 07:32:37,298 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:37,298 INFO L93 Difference]: Finished difference Result 126 states and 157 transitions. [2024-11-09 07:32:37,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-09 07:32:37,299 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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 25 [2024-11-09 07:32:37,299 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:37,300 INFO L225 Difference]: With dead ends: 126 [2024-11-09 07:32:37,300 INFO L226 Difference]: Without dead ends: 126 [2024-11-09 07:32:37,300 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 22 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-09 07:32:37,300 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 76 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 60 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 60 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 60 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:37,300 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 153 Invalid, 60 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 60 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:32:37,301 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-09 07:32:37,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-09 07:32:37,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 103 states have (on average 1.3689320388349515) internal successors, (141), 118 states have internal predecessors, (141), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:32:37,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 157 transitions. [2024-11-09 07:32:37,306 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 157 transitions. Word has length 25 [2024-11-09 07:32:37,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:37,307 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 157 transitions. [2024-11-09 07:32:37,307 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 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-09 07:32:37,307 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 157 transitions. [2024-11-09 07:32:37,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-09 07:32:37,308 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:37,308 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:37,315 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2024-11-09 07:32:37,509 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:37,509 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:37,509 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:37,509 INFO L85 PathProgramCache]: Analyzing trace with hash 1508168910, now seen corresponding path program 1 times [2024-11-09 07:32:37,509 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:32:37,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1907597309] [2024-11-09 07:32:37,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:37,510 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:37,510 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:32:37,511 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:32:37,512 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2024-11-09 07:32:37,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:37,561 INFO L255 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 16 conjuncts are in the unsatisfiable core [2024-11-09 07:32:37,562 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:32:37,583 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2024-11-09 07:32:37,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-09 07:32:37,592 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-09 07:32:37,752 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-09 07:32:37,752 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:32:37,752 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:32:37,752 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1907597309] [2024-11-09 07:32:37,752 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1907597309] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:32:37,752 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:32:37,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:32:37,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [798449876] [2024-11-09 07:32:37,753 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:32:37,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-11-09 07:32:37,753 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:32:37,753 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-11-09 07:32:37,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:32:37,754 INFO L87 Difference]: Start difference. First operand 126 states and 157 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:32:38,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:38,195 INFO L93 Difference]: Finished difference Result 131 states and 163 transitions. [2024-11-09 07:32:38,196 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2024-11-09 07:32:38,196 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 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 25 [2024-11-09 07:32:38,196 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:38,196 INFO L225 Difference]: With dead ends: 131 [2024-11-09 07:32:38,196 INFO L226 Difference]: Without dead ends: 131 [2024-11-09 07:32:38,197 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=38, Invalid=94, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:32:38,197 INFO L432 NwaCegarLoop]: 53 mSDtfsCounter, 154 mSDsluCounter, 241 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 346 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:38,197 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 294 Invalid, 346 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:32:38,198 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2024-11-09 07:32:38,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 129. [2024-11-09 07:32:38,200 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 106 states have (on average 1.3679245283018868) internal successors, (145), 121 states have internal predecessors, (145), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:32:38,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 161 transitions. [2024-11-09 07:32:38,200 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 161 transitions. Word has length 25 [2024-11-09 07:32:38,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:38,200 INFO L471 AbstractCegarLoop]: Abstraction has 129 states and 161 transitions. [2024-11-09 07:32:38,200 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 states have internal predecessors, (21), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:32:38,200 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 161 transitions. [2024-11-09 07:32:38,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2024-11-09 07:32:38,201 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:38,201 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:38,205 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Ended with exit code 0 [2024-11-09 07:32:38,404 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:38,404 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:38,405 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:38,405 INFO L85 PathProgramCache]: Analyzing trace with hash 1919689009, now seen corresponding path program 1 times [2024-11-09 07:32:38,405 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:32:38,405 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [218989595] [2024-11-09 07:32:38,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:38,405 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:38,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:32:38,406 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:32:38,407 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2024-11-09 07:32:38,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:38,454 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 15 conjuncts are in the unsatisfiable core [2024-11-09 07:32:38,458 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:32:38,622 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:32:38,622 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:32:38,835 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:32:38,836 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:32:38,836 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [218989595] [2024-11-09 07:32:38,836 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [218989595] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-09 07:32:38,836 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2024-11-09 07:32:38,836 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 18 [2024-11-09 07:32:38,836 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654615146] [2024-11-09 07:32:38,836 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2024-11-09 07:32:38,836 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2024-11-09 07:32:38,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:32:38,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2024-11-09 07:32:38,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=239, Unknown=0, NotChecked=0, Total=306 [2024-11-09 07:32:38,837 INFO L87 Difference]: Start difference. First operand 129 states and 161 transitions. Second operand has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:32:39,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:39,340 INFO L93 Difference]: Finished difference Result 210 states and 269 transitions. [2024-11-09 07:32:39,340 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-09 07:32:39,340 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) Word has length 27 [2024-11-09 07:32:39,341 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:39,341 INFO L225 Difference]: With dead ends: 210 [2024-11-09 07:32:39,341 INFO L226 Difference]: Without dead ends: 210 [2024-11-09 07:32:39,342 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=123, Invalid=383, Unknown=0, NotChecked=0, Total=506 [2024-11-09 07:32:39,343 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 380 mSDsluCounter, 749 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 837 SdHoareTripleChecker+Invalid, 472 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:39,343 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [388 Valid, 837 Invalid, 472 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 449 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-09 07:32:39,343 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2024-11-09 07:32:39,346 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 152. [2024-11-09 07:32:39,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 129 states have (on average 1.37984496124031) internal successors, (178), 144 states have internal predecessors, (178), 8 states have call successors, (8), 2 states have call predecessors, (8), 2 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:32:39,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 194 transitions. [2024-11-09 07:32:39,347 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 194 transitions. Word has length 27 [2024-11-09 07:32:39,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:39,347 INFO L471 AbstractCegarLoop]: Abstraction has 152 states and 194 transitions. [2024-11-09 07:32:39,348 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 17 states have (on average 2.0588235294117645) internal successors, (35), 15 states have internal predecessors, (35), 2 states have call successors, (3), 1 states have call predecessors, (3), 2 states have return successors, (4), 4 states have call predecessors, (4), 2 states have call successors, (4) [2024-11-09 07:32:39,348 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 194 transitions. [2024-11-09 07:32:39,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:32:39,349 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:39,349 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:39,353 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Ended with exit code 0 [2024-11-09 07:32:39,549 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:39,549 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:39,550 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:39,550 INFO L85 PathProgramCache]: Analyzing trace with hash -916311144, now seen corresponding path program 1 times [2024-11-09 07:32:39,550 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:32:39,550 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1855088320] [2024-11-09 07:32:39,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:39,550 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:39,550 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:32:39,551 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:32:39,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2024-11-09 07:32:39,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:39,600 INFO L255 TraceCheckSpWp]: Trace formula consists of 73 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 07:32:39,602 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:32:39,680 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-09 07:32:39,680 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-09 07:32:39,744 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-09 07:32:39,745 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:32:39,745 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1855088320] [2024-11-09 07:32:39,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1855088320] provided 1 perfect and 1 imperfect interpolant sequences [2024-11-09 07:32:39,745 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2024-11-09 07:32:39,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [9] total 12 [2024-11-09 07:32:39,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655867302] [2024-11-09 07:32:39,745 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:32:39,745 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-09 07:32:39,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:32:39,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-09 07:32:39,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2024-11-09 07:32:39,746 INFO L87 Difference]: Start difference. First operand 152 states and 194 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:32:39,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:39,816 INFO L93 Difference]: Finished difference Result 156 states and 197 transitions. [2024-11-09 07:32:39,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-09 07:32:39,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 29 [2024-11-09 07:32:39,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:39,818 INFO L225 Difference]: With dead ends: 156 [2024-11-09 07:32:39,818 INFO L226 Difference]: Without dead ends: 156 [2024-11-09 07:32:39,818 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 45 SyntacticMatches, 1 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=31, Invalid=125, Unknown=0, NotChecked=0, Total=156 [2024-11-09 07:32:39,818 INFO L432 NwaCegarLoop]: 88 mSDtfsCounter, 28 mSDsluCounter, 254 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 342 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:39,819 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [29 Valid, 342 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:32:39,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2024-11-09 07:32:39,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2024-11-09 07:32:39,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 132 states have (on average 1.371212121212121) internal successors, (181), 147 states have internal predecessors, (181), 8 states have call successors, (8), 3 states have call predecessors, (8), 3 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2024-11-09 07:32:39,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 197 transitions. [2024-11-09 07:32:39,822 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 197 transitions. Word has length 29 [2024-11-09 07:32:39,822 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:39,822 INFO L471 AbstractCegarLoop]: Abstraction has 156 states and 197 transitions. [2024-11-09 07:32:39,822 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 2 states have call successors, (3), 2 states have call predecessors, (3), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:32:39,822 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 197 transitions. [2024-11-09 07:32:39,823 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-11-09 07:32:39,823 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:39,823 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:39,827 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Ended with exit code 0 [2024-11-09 07:32:40,026 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:40,026 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:40,026 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:40,026 INFO L85 PathProgramCache]: Analyzing trace with hash 2126163953, now seen corresponding path program 1 times [2024-11-09 07:32:40,027 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:32:40,027 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1785764790] [2024-11-09 07:32:40,027 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-09 07:32:40,027 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:40,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:32:40,028 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:32:40,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2024-11-09 07:32:40,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-09 07:32:40,085 INFO L255 TraceCheckSpWp]: Trace formula consists of 86 conjuncts, 8 conjuncts are in the unsatisfiable core [2024-11-09 07:32:40,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-09 07:32:40,135 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2024-11-09 07:32:40,135 INFO L307 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2024-11-09 07:32:40,135 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2024-11-09 07:32:40,135 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1785764790] [2024-11-09 07:32:40,135 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1785764790] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-09 07:32:40,135 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-09 07:32:40,135 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2024-11-09 07:32:40,135 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918793897] [2024-11-09 07:32:40,135 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-09 07:32:40,135 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-09 07:32:40,135 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2024-11-09 07:32:40,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-09 07:32:40,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2024-11-09 07:32:40,136 INFO L87 Difference]: Start difference. First operand 156 states and 197 transitions. Second operand has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:32:40,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-09 07:32:40,258 INFO L93 Difference]: Finished difference Result 208 states and 263 transitions. [2024-11-09 07:32:40,259 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-09 07:32:40,259 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 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 29 [2024-11-09 07:32:40,259 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-09 07:32:40,260 INFO L225 Difference]: With dead ends: 208 [2024-11-09 07:32:40,260 INFO L226 Difference]: Without dead ends: 208 [2024-11-09 07:32:40,260 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2024-11-09 07:32:40,261 INFO L432 NwaCegarLoop]: 76 mSDtfsCounter, 104 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 419 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-09 07:32:40,261 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 419 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-09 07:32:40,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2024-11-09 07:32:40,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 178. [2024-11-09 07:32:40,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 153 states have (on average 1.3790849673202614) internal successors, (211), 168 states have internal predecessors, (211), 9 states have call successors, (9), 3 states have call predecessors, (9), 3 states have return successors, (9), 7 states have call predecessors, (9), 9 states have call successors, (9) [2024-11-09 07:32:40,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 229 transitions. [2024-11-09 07:32:40,264 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 229 transitions. Word has length 29 [2024-11-09 07:32:40,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-09 07:32:40,265 INFO L471 AbstractCegarLoop]: Abstraction has 178 states and 229 transitions. [2024-11-09 07:32:40,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.125) internal successors, (25), 8 states have internal predecessors, (25), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2024-11-09 07:32:40,265 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 229 transitions. [2024-11-09 07:32:40,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-09 07:32:40,265 INFO L207 NwaCegarLoop]: Found error trace [2024-11-09 07:32:40,265 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:40,271 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Ended with exit code 0 [2024-11-09 07:32:40,468 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:40,469 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 23 more)] === [2024-11-09 07:32:40,469 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-09 07:32:40,469 INFO L85 PathProgramCache]: Analyzing trace with hash 1546399348, now seen corresponding path program 2 times [2024-11-09 07:32:40,469 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2024-11-09 07:32:40,469 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503808204] [2024-11-09 07:32:40,469 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-09 07:32:40,469 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:40,470 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2024-11-09 07:32:40,471 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2024-11-09 07:32:40,472 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2024-11-09 07:32:40,540 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-09 07:32:40,540 INFO L228 tOrderPrioritization]: Conjunction of SSA is sat [2024-11-09 07:32:40,549 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2024-11-09 07:32:40,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2024-11-09 07:32:40,615 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2024-11-09 07:32:40,615 INFO L325 BasicCegarLoop]: Counterexample is feasible [2024-11-09 07:32:40,620 INFO L782 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK (25 of 26 remaining) [2024-11-09 07:32:40,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (24 of 26 remaining) [2024-11-09 07:32:40,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (23 of 26 remaining) [2024-11-09 07:32:40,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (22 of 26 remaining) [2024-11-09 07:32:40,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (21 of 26 remaining) [2024-11-09 07:32:40,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (20 of 26 remaining) [2024-11-09 07:32:40,621 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (19 of 26 remaining) [2024-11-09 07:32:40,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (18 of 26 remaining) [2024-11-09 07:32:40,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (17 of 26 remaining) [2024-11-09 07:32:40,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATIONMEMORY_DEREFERENCE (16 of 26 remaining) [2024-11-09 07:32:40,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE (15 of 26 remaining) [2024-11-09 07:32:40,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE (14 of 26 remaining) [2024-11-09 07:32:40,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 26 remaining) [2024-11-09 07:32:40,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 26 remaining) [2024-11-09 07:32:40,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 26 remaining) [2024-11-09 07:32:40,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 26 remaining) [2024-11-09 07:32:40,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 26 remaining) [2024-11-09 07:32:40,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 26 remaining) [2024-11-09 07:32:40,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 26 remaining) [2024-11-09 07:32:40,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 26 remaining) [2024-11-09 07:32:40,622 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 26 remaining) [2024-11-09 07:32:40,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE (4 of 26 remaining) [2024-11-09 07:32:40,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE (3 of 26 remaining) [2024-11-09 07:32:40,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE (2 of 26 remaining) [2024-11-09 07:32:40,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE (1 of 26 remaining) [2024-11-09 07:32:40,623 INFO L782 garLoopResultBuilder]: Registering result UNKNOWN for location __VERIFIER_assertErr0ASSERT_VIOLATIONMEMORY_LEAK (0 of 26 remaining) [2024-11-09 07:32:40,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Ended with exit code 0 [2024-11-09 07:32:40,826 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2024-11-09 07:32:40,829 INFO L407 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-09 07:32:40,847 INFO L170 ceAbstractionStarter]: Computing trace abstraction results [2024-11-09 07:32:40,849 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.11 07:32:40 BoogieIcfgContainer [2024-11-09 07:32:40,849 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2024-11-09 07:32:40,850 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2024-11-09 07:32:40,850 INFO L270 PluginConnector]: Initializing Witness Printer... [2024-11-09 07:32:40,850 INFO L274 PluginConnector]: Witness Printer initialized [2024-11-09 07:32:40,850 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.11 07:32:27" (3/4) ... [2024-11-09 07:32:40,852 INFO L145 WitnessPrinter]: No result that supports witness generation found [2024-11-09 07:32:40,853 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2024-11-09 07:32:40,853 INFO L158 Benchmark]: Toolchain (without parser) took 14808.43ms. Allocated memory was 62.9MB in the beginning and 117.4MB in the end (delta: 54.5MB). Free memory was 43.3MB in the beginning and 85.3MB in the end (delta: -42.0MB). Peak memory consumption was 12.5MB. Max. memory is 16.1GB. [2024-11-09 07:32:40,853 INFO L158 Benchmark]: CDTParser took 0.81ms. Allocated memory is still 62.9MB. Free memory was 37.6MB in the beginning and 37.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:32:40,854 INFO L158 Benchmark]: CACSL2BoogieTranslator took 419.77ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 43.1MB in the beginning and 55.9MB in the end (delta: -12.9MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. [2024-11-09 07:32:40,854 INFO L158 Benchmark]: Boogie Procedure Inliner took 44.13ms. Allocated memory is still 79.7MB. Free memory was 55.9MB in the beginning and 53.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:32:40,854 INFO L158 Benchmark]: Boogie Preprocessor took 51.56ms. Allocated memory is still 79.7MB. Free memory was 53.5MB in the beginning and 50.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2024-11-09 07:32:40,854 INFO L158 Benchmark]: RCFGBuilder took 611.73ms. Allocated memory is still 79.7MB. Free memory was 50.7MB in the beginning and 46.2MB in the end (delta: 4.5MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. [2024-11-09 07:32:40,854 INFO L158 Benchmark]: TraceAbstraction took 13672.23ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 45.4MB in the beginning and 85.3MB in the end (delta: -39.9MB). There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:32:40,854 INFO L158 Benchmark]: Witness Printer took 3.24ms. Allocated memory is still 117.4MB. Free memory is still 85.3MB. There was no memory consumed. Max. memory is 16.1GB. [2024-11-09 07:32:40,855 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.81ms. Allocated memory is still 62.9MB. Free memory was 37.6MB in the beginning and 37.6MB in the end (delta: 73.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 419.77ms. Allocated memory was 62.9MB in the beginning and 79.7MB in the end (delta: 16.8MB). Free memory was 43.1MB in the beginning and 55.9MB in the end (delta: -12.9MB). Peak memory consumption was 23.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 44.13ms. Allocated memory is still 79.7MB. Free memory was 55.9MB in the beginning and 53.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 51.56ms. Allocated memory is still 79.7MB. Free memory was 53.5MB in the beginning and 50.7MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 611.73ms. Allocated memory is still 79.7MB. Free memory was 50.7MB in the beginning and 46.2MB in the end (delta: 4.5MB). Peak memory consumption was 20.1MB. Max. memory is 16.1GB. * TraceAbstraction took 13672.23ms. Allocated memory was 79.7MB in the beginning and 117.4MB in the end (delta: 37.7MB). Free memory was 45.4MB in the beginning and 85.3MB in the end (delta: -39.9MB). There was no memory consumed. Max. memory is 16.1GB. * Witness Printer took 3.24ms. Allocated memory is still 117.4MB. Free memory is still 85.3MB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - UnprovableResult [Line: 1128]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 1128. Possible FailurePath: [L1130] unsigned long pat_len = __VERIFIER_nondet_ulong(), a_len = __VERIFIER_nondet_ulong(); [L1130] unsigned long pat_len = __VERIFIER_nondet_ulong(), a_len = __VERIFIER_nondet_ulong(); [L1132] CALL assume_abort_if_not(pat_len < 4294967296 / sizeof(int)) VAL [\old(cond)=1] [L5] COND FALSE !(!cond) VAL [\old(cond)=1] [L1132] RET assume_abort_if_not(pat_len < 4294967296 / sizeof(int)) VAL [pat_len=2] [L1133] CALL assume_abort_if_not(a_len < 4294967296 / sizeof(int)) VAL [\old(cond)=1] [L5] COND FALSE !(!cond) VAL [\old(cond)=1] [L1133] RET assume_abort_if_not(a_len < 4294967296 / sizeof(int)) VAL [a_len=0, pat_len=2] [L1134] int *pat=malloc(sizeof(int)*pat_len); [L1135] int *a=malloc(sizeof(int)*a_len); [L1139] int j = 0; VAL [a={3:0}, a_len=0, j=0, pat={7:0}, pat_len=2] [L1139] COND TRUE j < pat_len [L1140] pat[j] = __VERIFIER_nondet_int() [L1139] j++ VAL [a={3:0}, a_len=0, j=1, pat={7:0}, pat_len=2] [L1139] COND TRUE j < pat_len [L1140] pat[j] = __VERIFIER_nondet_int() [L1139] j++ VAL [a={3:0}, a_len=0, j=2, pat={7:0}, pat_len=2] [L1139] COND FALSE !(j < pat_len) VAL [a={3:0}, a_len=0, pat={7:0}, pat_len=2] [L1142] int j = 0; VAL [a={3:0}, a_len=0, j=0, pat={7:0}, pat_len=2] [L1142] COND FALSE !(j < a_len) VAL [a={3:0}, a_len=0, pat={7:0}, pat_len=2] [L1147] CALL is_relaxed_prefix(pat, pat_len, a, a_len) [L1106] COND TRUE pat_length>a_length+1 [L1107] return 0; VAL [\result=0, a={3:0}, pat={7:0}] [L1147] RET is_relaxed_prefix(pat, pat_len, a, a_len) [L1147] COND FALSE !(is_relaxed_prefix(pat, pat_len, a, a_len)) [L1163] COND FALSE !(pat_len<=a_len+1) [L1176] return 0; VAL [\result=0, a={3:0}, pat={7:0}] - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 97 locations, 26 error locations. Started 1 CEGAR loops. OverallTime: 13.6s, OverallIterations: 16, TraceHistogramMax: 3, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 5.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1739 SdHoareTripleChecker+Valid, 4.5s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1679 mSDsluCounter, 5442 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 4197 mSDsCounter, 90 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2948 IncrementalHoareTripleChecker+Invalid, 3038 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 90 mSolverCounterUnsat, 1245 mSDtfsCounter, 2948 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 495 GetRequests, 356 SyntacticMatches, 2 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 2.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178occurred in iteration=15, InterpolantAutomatonStates: 113, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 15 MinimizatonAttempts, 124 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 3.5s InterpolantComputationTime, 357 NumberOfCodeBlocks, 357 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 463 ConstructedInterpolants, 8 QuantifiedInterpolants, 2740 SizeOfPredicates, 42 NumberOfNonLiveVariables, 929 ConjunctsInSsa, 126 ConjunctsInUnsatCore, 22 InterpolantComputations, 10 PerfectInterpolantSequences, 76/118 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2024-11-09 07:32:40,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample