/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf -i ../../../trunk/examples/svcomp/list-ext3-properties/dll_nullified-2.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 06:11:01,407 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 06:11:01,409 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 06:11:01,482 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 06:11:01,482 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 06:11:01,483 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 06:11:01,484 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 06:11:01,486 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 06:11:01,487 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 06:11:01,488 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 06:11:01,489 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 06:11:01,490 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 06:11:01,490 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 06:11:01,491 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 06:11:01,495 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 06:11:01,496 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 06:11:01,497 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 06:11:01,498 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 06:11:01,499 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 06:11:01,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 06:11:01,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 06:11:01,511 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 06:11:01,514 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 06:11:01,515 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 06:11:01,517 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 06:11:01,517 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 06:11:01,518 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 06:11:01,518 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 06:11:01,519 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 06:11:01,520 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 06:11:01,520 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 06:11:01,520 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 06:11:01,521 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 06:11:01,522 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 06:11:01,522 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 06:11:01,523 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 06:11:01,523 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 06:11:01,523 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 06:11:01,524 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 06:11:01,524 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 06:11:01,525 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 06:11:01,529 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_Bitvector.epf [2022-01-10 06:11:01,559 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 06:11:01,559 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 06:11:01,560 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 06:11:01,560 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 06:11:01,561 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 06:11:01,561 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 06:11:01,561 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 06:11:01,561 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 06:11:01,561 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 06:11:01,561 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 06:11:01,561 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 06:11:01,562 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 06:11:01,562 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 06:11:01,562 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 06:11:01,562 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 06:11:01,562 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 06:11:01,562 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 06:11:01,562 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 06:11:01,562 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 06:11:01,562 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 06:11:01,563 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 06:11:01,563 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 06:11:01,563 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 06:11:01,563 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:11:01,563 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 06:11:01,563 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 06:11:01,563 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 06:11:01,563 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 06:11:01,564 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 06:11:01,564 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 06:11:01,564 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 06:11:01,564 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 06:11:01,564 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 06:11:01,564 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 06:11:01,783 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 06:11:01,803 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 06:11:01,805 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 06:11:01,806 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 06:11:01,808 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 06:11:01,809 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-ext3-properties/dll_nullified-2.i [2022-01-10 06:11:01,868 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a627c5f98/932691402e354772a4cfdefe585aebf8/FLAG7649e8a67 [2022-01-10 06:11:02,308 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 06:11:02,309 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/dll_nullified-2.i [2022-01-10 06:11:02,332 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a627c5f98/932691402e354772a4cfdefe585aebf8/FLAG7649e8a67 [2022-01-10 06:11:02,844 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a627c5f98/932691402e354772a4cfdefe585aebf8 [2022-01-10 06:11:02,847 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 06:11:02,848 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 06:11:02,852 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 06:11:02,852 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 06:11:02,855 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 06:11:02,855 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:11:02" (1/1) ... [2022-01-10 06:11:02,856 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@54f8131f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:11:02, skipping insertion in model container [2022-01-10 06:11:02,857 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:11:02" (1/1) ... [2022-01-10 06:11:02,862 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 06:11:02,907 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:11:03,155 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/dll_nullified-2.i[23974,23987] [2022-01-10 06:11:03,158 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:11:03,167 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 06:11:03,221 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-ext3-properties/dll_nullified-2.i[23974,23987] [2022-01-10 06:11:03,222 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:11:03,251 INFO L208 MainTranslator]: Completed translation [2022-01-10 06:11:03,251 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:11:03 WrapperNode [2022-01-10 06:11:03,252 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 06:11:03,252 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 06:11:03,253 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 06:11:03,253 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 06:11:03,260 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:11:03" (1/1) ... [2022-01-10 06:11:03,282 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:11:03" (1/1) ... [2022-01-10 06:11:03,322 INFO L137 Inliner]: procedures = 125, calls = 25, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 109 [2022-01-10 06:11:03,322 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 06:11:03,323 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 06:11:03,323 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 06:11:03,323 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 06:11:03,330 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:11:03" (1/1) ... [2022-01-10 06:11:03,330 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:11:03" (1/1) ... [2022-01-10 06:11:03,345 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:11:03" (1/1) ... [2022-01-10 06:11:03,345 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:11:03" (1/1) ... [2022-01-10 06:11:03,352 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:11:03" (1/1) ... [2022-01-10 06:11:03,372 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:11:03" (1/1) ... [2022-01-10 06:11:03,374 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:11:03" (1/1) ... [2022-01-10 06:11:03,376 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 06:11:03,377 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 06:11:03,377 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 06:11:03,377 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 06:11:03,386 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:11:03" (1/1) ... [2022-01-10 06:11:03,400 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:11:03,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 06:11:03,428 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 06:11:03,430 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 06:11:03,459 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 06:11:03,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 06:11:03,459 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 06:11:03,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 06:11:03,460 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 06:11:03,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 06:11:03,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 06:11:03,460 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 06:11:03,460 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 06:11:03,460 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 06:11:03,567 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 06:11:03,568 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 06:11:03,975 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 06:11:03,981 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 06:11:03,981 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-10 06:11:03,983 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:11:03 BoogieIcfgContainer [2022-01-10 06:11:03,983 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 06:11:03,985 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 06:11:03,985 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 06:11:03,988 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 06:11:03,989 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:11:02" (1/3) ... [2022-01-10 06:11:03,989 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a443d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:11:03, skipping insertion in model container [2022-01-10 06:11:03,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:11:03" (2/3) ... [2022-01-10 06:11:03,990 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3a443d53 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:11:03, skipping insertion in model container [2022-01-10 06:11:03,990 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:11:03" (3/3) ... [2022-01-10 06:11:03,991 INFO L111 eAbstractionObserver]: Analyzing ICFG dll_nullified-2.i [2022-01-10 06:11:03,999 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 06:11:03,999 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 06:11:04,059 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 06:11:04,076 INFO L339 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, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 06:11:04,077 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 06:11:04,104 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.6) internal successors, (40), 26 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:04,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-01-10 06:11:04,110 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:11:04,110 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:11:04,111 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:11:04,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:11:04,117 INFO L85 PathProgramCache]: Analyzing trace with hash -91270904, now seen corresponding path program 1 times [2022-01-10 06:11:04,128 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:11:04,130 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1408630294] [2022-01-10 06:11:04,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:11:04,131 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:11:04,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:11:04,137 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:11:04,178 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-01-10 06:11:04,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:11:04,232 INFO L263 TraceCheckSpWp]: Trace formula consists of 33 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:11:04,236 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:11:04,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:11:04,322 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:11:04,323 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:11:04,324 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1408630294] [2022-01-10 06:11:04,325 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1408630294] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:11:04,325 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:11:04,325 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:11:04,326 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759793419] [2022-01-10 06:11:04,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:11:04,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:11:04,333 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:11:04,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:11:04,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:11:04,366 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.6) internal successors, (40), 26 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:04,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:11:04,401 INFO L93 Difference]: Finished difference Result 52 states and 78 transitions. [2022-01-10 06:11:04,403 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:11:04,404 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-01-10 06:11:04,404 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:11:04,410 INFO L225 Difference]: With dead ends: 52 [2022-01-10 06:11:04,410 INFO L226 Difference]: Without dead ends: 27 [2022-01-10 06:11:04,413 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:11:04,416 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 7 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 66 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:11:04,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 66 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:11:04,436 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-10 06:11:04,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2022-01-10 06:11:04,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.4090909090909092) internal successors, (31), 22 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:04,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 31 transitions. [2022-01-10 06:11:04,456 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 31 transitions. Word has length 12 [2022-01-10 06:11:04,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:11:04,457 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 31 transitions. [2022-01-10 06:11:04,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:04,458 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 31 transitions. [2022-01-10 06:11:04,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 06:11:04,458 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:11:04,458 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:11:04,475 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-01-10 06:11:04,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:11:04,668 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:11:04,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:11:04,669 INFO L85 PathProgramCache]: Analyzing trace with hash -1034399597, now seen corresponding path program 1 times [2022-01-10 06:11:04,670 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:11:04,670 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1753839432] [2022-01-10 06:11:04,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:11:04,670 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:11:04,671 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:11:04,672 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:11:04,674 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-01-10 06:11:04,781 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:11:04,786 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:11:04,788 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:11:04,903 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:11:04,903 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:11:04,904 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:11:04,904 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1753839432] [2022-01-10 06:11:04,904 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1753839432] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:11:04,904 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:11:04,904 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:11:04,905 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613373896] [2022-01-10 06:11:04,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:11:04,906 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:11:04,906 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:11:04,907 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:11:04,907 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:11:04,907 INFO L87 Difference]: Start difference. First operand 23 states and 31 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:05,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:11:05,319 INFO L93 Difference]: Finished difference Result 47 states and 64 transitions. [2022-01-10 06:11:05,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:11:05,319 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-01-10 06:11:05,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:11:05,320 INFO L225 Difference]: With dead ends: 47 [2022-01-10 06:11:05,320 INFO L226 Difference]: Without dead ends: 27 [2022-01-10 06:11:05,321 INFO L932 BasicCegarLoop]: 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 [2022-01-10 06:11:05,322 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 1 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-01-10 06:11:05,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 52 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-01-10 06:11:05,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-10 06:11:05,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2022-01-10 06:11:05,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.36) internal successors, (34), 25 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:05,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 34 transitions. [2022-01-10 06:11:05,327 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 34 transitions. Word has length 17 [2022-01-10 06:11:05,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:11:05,327 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 34 transitions. [2022-01-10 06:11:05,327 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:05,327 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 34 transitions. [2022-01-10 06:11:05,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 06:11:05,328 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:11:05,328 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:11:05,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 06:11:05,538 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:11:05,539 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:11:05,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:11:05,540 INFO L85 PathProgramCache]: Analyzing trace with hash -776234159, now seen corresponding path program 1 times [2022-01-10 06:11:05,540 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:11:05,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [831933593] [2022-01-10 06:11:05,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:11:05,541 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:11:05,541 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:11:05,552 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:11:05,553 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-01-10 06:11:05,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:11:05,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 06:11:05,636 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:11:05,718 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:11:05,718 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:11:05,821 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:11:05,821 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:11:05,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [831933593] [2022-01-10 06:11:05,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [831933593] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:11:05,822 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:11:05,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-10 06:11:05,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1702160057] [2022-01-10 06:11:05,822 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:11:05,822 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 06:11:05,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:11:05,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 06:11:05,823 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:11:05,823 INFO L87 Difference]: Start difference. First operand 26 states and 34 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:05,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:11:05,895 INFO L93 Difference]: Finished difference Result 53 states and 72 transitions. [2022-01-10 06:11:05,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 06:11:05,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-01-10 06:11:05,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:11:05,896 INFO L225 Difference]: With dead ends: 53 [2022-01-10 06:11:05,896 INFO L226 Difference]: Without dead ends: 38 [2022-01-10 06:11:05,897 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 33 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=19, Invalid=23, Unknown=0, NotChecked=0, Total=42 [2022-01-10 06:11:05,898 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 26 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:11:05,899 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 87 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:11:05,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-10 06:11:05,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 38. [2022-01-10 06:11:05,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 37 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:05,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 48 transitions. [2022-01-10 06:11:05,904 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 48 transitions. Word has length 17 [2022-01-10 06:11:05,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:11:05,905 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 48 transitions. [2022-01-10 06:11:05,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 6 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:05,905 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 48 transitions. [2022-01-10 06:11:05,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-01-10 06:11:05,906 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:11:05,906 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:11:05,919 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-01-10 06:11:06,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:11:06,117 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:11:06,118 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:11:06,118 INFO L85 PathProgramCache]: Analyzing trace with hash -459646902, now seen corresponding path program 1 times [2022-01-10 06:11:06,119 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:11:06,119 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [642366537] [2022-01-10 06:11:06,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:11:06,119 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:11:06,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:11:06,120 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:11:06,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-01-10 06:11:06,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:11:06,365 INFO L263 TraceCheckSpWp]: Trace formula consists of 257 conjuncts, 8 conjunts are in the unsatisfiable core [2022-01-10 06:11:06,368 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:11:06,524 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:11:06,524 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:11:06,728 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:11:06,728 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:11:06,729 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [642366537] [2022-01-10 06:11:06,729 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [642366537] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:11:06,729 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:11:06,729 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 12 [2022-01-10 06:11:06,729 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709893636] [2022-01-10 06:11:06,729 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:11:06,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 06:11:06,730 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:11:06,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 06:11:06,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-10 06:11:06,731 INFO L87 Difference]: Start difference. First operand 38 states and 48 transitions. Second operand has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:06,852 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:11:06,852 INFO L93 Difference]: Finished difference Result 62 states and 81 transitions. [2022-01-10 06:11:06,853 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 06:11:06,854 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-01-10 06:11:06,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:11:06,854 INFO L225 Difference]: With dead ends: 62 [2022-01-10 06:11:06,854 INFO L226 Difference]: Without dead ends: 47 [2022-01-10 06:11:06,855 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=96, Unknown=0, NotChecked=0, Total=132 [2022-01-10 06:11:06,856 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 35 mSDsluCounter, 246 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:11:06,856 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 289 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:11:06,857 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2022-01-10 06:11:06,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 43. [2022-01-10 06:11:06,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.2857142857142858) internal successors, (54), 42 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:06,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 54 transitions. [2022-01-10 06:11:06,862 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 54 transitions. Word has length 32 [2022-01-10 06:11:06,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:11:06,863 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 54 transitions. [2022-01-10 06:11:06,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 4.5) internal successors, (54), 12 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:06,863 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 54 transitions. [2022-01-10 06:11:06,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 06:11:06,864 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:11:06,864 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:11:06,882 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-01-10 06:11:07,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:11:07,078 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:11:07,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:11:07,079 INFO L85 PathProgramCache]: Analyzing trace with hash -910589295, now seen corresponding path program 2 times [2022-01-10 06:11:07,079 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:11:07,080 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2141402791] [2022-01-10 06:11:07,080 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:11:07,080 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:11:07,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:11:07,081 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:11:07,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 06:11:07,509 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:11:07,509 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:11:07,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 19 conjunts are in the unsatisfiable core [2022-01-10 06:11:07,542 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:11:07,602 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 06:11:07,643 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 06:11:07,643 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-01-10 06:11:07,840 INFO L353 Elim1Store]: treesize reduction 288, result has 10.8 percent of original size [2022-01-10 06:11:07,840 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 4 case distinctions, treesize of input 31 treesize of output 44 [2022-01-10 06:11:07,884 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 06:11:08,055 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 06:11:08,055 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:11:08,097 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_354 (Array (_ BitVec 64) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_354) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (_ bv0 32))) is different from false [2022-01-10 06:11:08,390 INFO L353 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-01-10 06:11:08,390 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 38 treesize of output 59 [2022-01-10 06:11:08,400 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 22 [2022-01-10 06:11:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2022-01-10 06:11:08,467 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:11:08,467 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2141402791] [2022-01-10 06:11:08,467 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2141402791] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:11:08,467 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:11:08,467 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 12 [2022-01-10 06:11:08,468 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [755708743] [2022-01-10 06:11:08,468 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:11:08,468 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 06:11:08,468 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:11:08,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 06:11:08,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=90, Unknown=1, NotChecked=18, Total=132 [2022-01-10 06:11:08,469 INFO L87 Difference]: Start difference. First operand 43 states and 54 transitions. Second operand has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:11,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:11:11,275 INFO L93 Difference]: Finished difference Result 76 states and 101 transitions. [2022-01-10 06:11:11,276 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 06:11:11,277 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-01-10 06:11:11,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:11:11,277 INFO L225 Difference]: With dead ends: 76 [2022-01-10 06:11:11,278 INFO L226 Difference]: Without dead ends: 63 [2022-01-10 06:11:11,278 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 62 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=92, Invalid=253, Unknown=1, NotChecked=34, Total=380 [2022-01-10 06:11:11,279 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 200 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 200 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 2.5s IncrementalHoareTripleChecker+Time [2022-01-10 06:11:11,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [200 Valid, 70 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 111 Invalid, 0 Unknown, 51 Unchecked, 2.5s Time] [2022-01-10 06:11:11,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-10 06:11:11,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 46. [2022-01-10 06:11:11,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.288888888888889) internal successors, (58), 45 states have internal predecessors, (58), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:11,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 58 transitions. [2022-01-10 06:11:11,286 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 58 transitions. Word has length 37 [2022-01-10 06:11:11,286 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:11:11,286 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 58 transitions. [2022-01-10 06:11:11,286 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.5) internal successors, (30), 12 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:11,286 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 58 transitions. [2022-01-10 06:11:11,287 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 06:11:11,287 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:11:11,287 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:11:11,311 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-01-10 06:11:11,507 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:11:11,508 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:11:11,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:11:11,508 INFO L85 PathProgramCache]: Analyzing trace with hash -908742253, now seen corresponding path program 1 times [2022-01-10 06:11:11,509 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:11:11,509 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1440876492] [2022-01-10 06:11:11,509 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:11:11,509 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:11:11,509 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:11:11,510 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:11:11,511 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 06:11:12,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:11:12,032 INFO L263 TraceCheckSpWp]: Trace formula consists of 317 conjuncts, 22 conjunts are in the unsatisfiable core [2022-01-10 06:11:12,035 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:11:12,063 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 06:11:12,106 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 06:11:12,106 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-01-10 06:11:12,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:12,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:12,150 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:12,151 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:12,157 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:12,158 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:12,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:12,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:12,162 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:12,163 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:12,165 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2022-01-10 06:11:12,217 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-10 06:11:12,398 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 06:11:12,399 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:11:12,663 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_522 (Array (_ BitVec 64) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_522) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv12 64))) (_ bv0 32))) is different from false [2022-01-10 06:11:12,878 INFO L353 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-01-10 06:11:12,878 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 61 [2022-01-10 06:11:12,892 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-01-10 06:11:12,898 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-01-10 06:11:12,987 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2022-01-10 06:11:12,987 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:11:12,987 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1440876492] [2022-01-10 06:11:12,988 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1440876492] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:11:12,988 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:11:12,988 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12] total 18 [2022-01-10 06:11:12,988 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [974620633] [2022-01-10 06:11:12,988 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:11:12,988 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-01-10 06:11:12,988 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:11:12,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-01-10 06:11:12,989 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=233, Unknown=1, NotChecked=30, Total=306 [2022-01-10 06:11:12,989 INFO L87 Difference]: Start difference. First operand 46 states and 58 transitions. Second operand has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:22,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:11:22,029 INFO L93 Difference]: Finished difference Result 77 states and 101 transitions. [2022-01-10 06:11:22,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-10 06:11:22,031 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-01-10 06:11:22,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:11:22,032 INFO L225 Difference]: With dead ends: 77 [2022-01-10 06:11:22,032 INFO L226 Difference]: Without dead ends: 64 [2022-01-10 06:11:22,033 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 56 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=188, Invalid=627, Unknown=1, NotChecked=54, Total=870 [2022-01-10 06:11:22,033 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 247 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 8.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 247 SdHoareTripleChecker+Valid, 94 SdHoareTripleChecker+Invalid, 327 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 56 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2022-01-10 06:11:22,034 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [247 Valid, 94 Invalid, 327 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 235 Invalid, 0 Unknown, 56 Unchecked, 8.3s Time] [2022-01-10 06:11:22,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-10 06:11:22,040 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 48. [2022-01-10 06:11:22,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.2765957446808511) internal successors, (60), 47 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:22,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 60 transitions. [2022-01-10 06:11:22,041 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 60 transitions. Word has length 37 [2022-01-10 06:11:22,041 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:11:22,041 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 60 transitions. [2022-01-10 06:11:22,042 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 18 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:22,042 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 60 transitions. [2022-01-10 06:11:22,042 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 06:11:22,042 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:11:22,042 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:11:22,064 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-01-10 06:11:22,243 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:11:22,243 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:11:22,244 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:11:22,244 INFO L85 PathProgramCache]: Analyzing trace with hash -908740331, now seen corresponding path program 1 times [2022-01-10 06:11:22,244 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:11:22,244 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [540034060] [2022-01-10 06:11:22,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:11:22,245 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:11:22,245 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:11:22,248 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:11:22,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 06:11:22,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:11:22,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-10 06:11:22,749 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:11:22,792 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 06:11:22,866 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 06:11:22,866 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-01-10 06:11:22,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:22,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:22,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:22,917 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:22,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:22,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:22,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:22,924 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:22,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:22,928 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:22,930 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2022-01-10 06:11:22,985 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-01-10 06:11:23,195 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 06:11:23,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:11:23,414 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_690 (Array (_ BitVec 64) (_ BitVec 32)))) (= (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_690) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv24 64))) (_ bv0 32))) is different from false [2022-01-10 06:11:23,567 INFO L353 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-01-10 06:11:23,568 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 40 treesize of output 61 [2022-01-10 06:11:23,574 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 24 [2022-01-10 06:11:23,579 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 7 treesize of output 3 [2022-01-10 06:11:23,648 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2022-01-10 06:11:23,648 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:11:23,648 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [540034060] [2022-01-10 06:11:23,648 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [540034060] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:11:23,648 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:11:23,649 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2022-01-10 06:11:23,649 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323635925] [2022-01-10 06:11:23,649 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:11:23,649 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-10 06:11:23,649 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:11:23,649 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-10 06:11:23,650 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=203, Unknown=1, NotChecked=28, Total=272 [2022-01-10 06:11:23,650 INFO L87 Difference]: Start difference. First operand 48 states and 60 transitions. Second operand has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:29,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:11:29,136 INFO L93 Difference]: Finished difference Result 66 states and 82 transitions. [2022-01-10 06:11:29,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 06:11:29,137 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 37 [2022-01-10 06:11:29,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:11:29,138 INFO L225 Difference]: With dead ends: 66 [2022-01-10 06:11:29,138 INFO L226 Difference]: Without dead ends: 64 [2022-01-10 06:11:29,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 57 SyntacticMatches, 3 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=165, Invalid=540, Unknown=1, NotChecked=50, Total=756 [2022-01-10 06:11:29,139 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 278 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 194 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 4.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 278 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 268 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 194 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 4.9s IncrementalHoareTripleChecker+Time [2022-01-10 06:11:29,139 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [278 Valid, 86 Invalid, 268 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 194 Invalid, 0 Unknown, 46 Unchecked, 4.9s Time] [2022-01-10 06:11:29,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-01-10 06:11:29,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 49. [2022-01-10 06:11:29,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.2708333333333333) internal successors, (61), 48 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:29,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 61 transitions. [2022-01-10 06:11:29,146 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 61 transitions. Word has length 37 [2022-01-10 06:11:29,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:11:29,146 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 61 transitions. [2022-01-10 06:11:29,147 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.411764705882353) internal successors, (41), 17 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:29,147 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 61 transitions. [2022-01-10 06:11:29,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 06:11:29,147 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:11:29,147 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:11:29,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 06:11:29,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:11:29,356 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:11:29,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:11:29,356 INFO L85 PathProgramCache]: Analyzing trace with hash 829738032, now seen corresponding path program 1 times [2022-01-10 06:11:29,357 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:11:29,357 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1565754623] [2022-01-10 06:11:29,357 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:11:29,357 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:11:29,357 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:11:29,358 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:11:29,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 06:11:29,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:11:29,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 19 conjunts are in the unsatisfiable core [2022-01-10 06:11:29,898 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:11:29,928 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 6 treesize of output 5 [2022-01-10 06:11:29,997 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 06:11:29,997 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 12 [2022-01-10 06:11:30,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:30,051 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 19 [2022-01-10 06:11:30,116 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 06:11:30,116 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 34 [2022-01-10 06:11:30,279 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-01-10 06:11:30,311 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 5 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 06:11:30,312 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:11:30,613 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_854 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (_ bv0 64) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_854) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv4 64)))))) is different from false [2022-01-10 06:11:30,671 INFO L353 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-01-10 06:11:30,671 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 34 [2022-01-10 06:11:30,675 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 27 [2022-01-10 06:11:30,680 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 8 treesize of output 4 [2022-01-10 06:11:30,933 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 32 proven. 4 refuted. 0 times theorem prover too weak. 18 trivial. 1 not checked. [2022-01-10 06:11:30,933 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:11:30,933 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1565754623] [2022-01-10 06:11:30,934 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1565754623] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:11:30,934 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:11:30,934 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 19 [2022-01-10 06:11:30,934 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1728099911] [2022-01-10 06:11:30,934 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:11:30,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-01-10 06:11:30,935 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:11:30,935 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-01-10 06:11:30,935 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=263, Unknown=1, NotChecked=32, Total=342 [2022-01-10 06:11:30,935 INFO L87 Difference]: Start difference. First operand 49 states and 61 transitions. Second operand has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:33,783 WARN L534 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [] [2022-01-10 06:11:38,656 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:11:38,657 INFO L93 Difference]: Finished difference Result 108 states and 137 transitions. [2022-01-10 06:11:38,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-01-10 06:11:38,659 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-01-10 06:11:38,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:11:38,663 INFO L225 Difference]: With dead ends: 108 [2022-01-10 06:11:38,663 INFO L226 Difference]: Without dead ends: 101 [2022-01-10 06:11:38,664 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 114 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=207, Invalid=726, Unknown=1, NotChecked=58, Total=992 [2022-01-10 06:11:38,664 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 306 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 6.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 305 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 6.8s IncrementalHoareTripleChecker+Time [2022-01-10 06:11:38,665 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [306 Valid, 259 Invalid, 305 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 177 Invalid, 0 Unknown, 101 Unchecked, 6.8s Time] [2022-01-10 06:11:38,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-01-10 06:11:38,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 55. [2022-01-10 06:11:38,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.2592592592592593) internal successors, (68), 54 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:38,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 68 transitions. [2022-01-10 06:11:38,682 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 68 transitions. Word has length 38 [2022-01-10 06:11:38,682 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:11:38,682 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 68 transitions. [2022-01-10 06:11:38,683 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.263157894736842) internal successors, (43), 19 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:38,683 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 68 transitions. [2022-01-10 06:11:38,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 06:11:38,683 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:11:38,684 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:11:38,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 06:11:38,887 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:11:38,888 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:11:38,888 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:11:38,888 INFO L85 PathProgramCache]: Analyzing trace with hash 242932018, now seen corresponding path program 2 times [2022-01-10 06:11:38,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:11:38,889 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [741442997] [2022-01-10 06:11:38,889 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:11:38,889 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:11:38,889 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:11:38,890 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:11:38,891 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 06:11:39,179 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:11:39,179 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:11:39,200 INFO L263 TraceCheckSpWp]: Trace formula consists of 311 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:11:39,201 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:11:39,298 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 06:11:39,298 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:11:39,363 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 34 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2022-01-10 06:11:39,363 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:11:39,363 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [741442997] [2022-01-10 06:11:39,363 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [741442997] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:11:39,363 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:11:39,364 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 4 [2022-01-10 06:11:39,364 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [535679908] [2022-01-10 06:11:39,364 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:11:39,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:11:39,364 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:11:39,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:11:39,365 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:11:39,365 INFO L87 Difference]: Start difference. First operand 55 states and 68 transitions. Second operand has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:40,481 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:11:40,481 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2022-01-10 06:11:40,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 06:11:40,482 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-01-10 06:11:40,482 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:11:40,482 INFO L225 Difference]: With dead ends: 93 [2022-01-10 06:11:40,482 INFO L226 Difference]: Without dead ends: 49 [2022-01-10 06:11:40,483 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:11:40,483 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 47 mSDsluCounter, 3 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:11:40,484 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 29 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-01-10 06:11:40,484 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2022-01-10 06:11:40,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2022-01-10 06:11:40,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 49 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:40,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 56 transitions. [2022-01-10 06:11:40,490 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 56 transitions. Word has length 38 [2022-01-10 06:11:40,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:11:40,490 INFO L470 AbstractCegarLoop]: Abstraction has 49 states and 56 transitions. [2022-01-10 06:11:40,490 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 7.25) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 06:11:40,490 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 56 transitions. [2022-01-10 06:11:40,491 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-01-10 06:11:40,491 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:11:40,491 INFO L514 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 4, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:11:40,511 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 06:11:40,691 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:11:40,692 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:11:40,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:11:40,692 INFO L85 PathProgramCache]: Analyzing trace with hash 731872996, now seen corresponding path program 1 times [2022-01-10 06:11:40,693 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:11:40,693 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1964596755] [2022-01-10 06:11:40,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:11:40,693 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:11:40,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:11:40,695 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:11:40,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 06:11:41,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:11:41,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 330 conjuncts, 42 conjunts are in the unsatisfiable core [2022-01-10 06:11:41,361 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:11:41,381 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 06:11:41,443 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-01-10 06:11:41,443 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 25 [2022-01-10 06:11:41,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:41,506 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:41,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:41,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:41,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:41,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:41,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:41,519 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:41,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:41,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:41,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 11 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 44 [2022-01-10 06:11:41,577 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 06:11:41,704 INFO L353 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-01-10 06:11:41,704 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 18 treesize of output 20 [2022-01-10 06:11:41,777 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 06:11:41,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:41,787 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 19 [2022-01-10 06:11:41,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:41,804 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 18 treesize of output 19 [2022-01-10 06:11:41,899 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 06:11:41,899 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 74 [2022-01-10 06:11:41,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:11:41,908 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 38 [2022-01-10 06:11:41,916 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-01-10 06:11:42,262 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 06:11:42,266 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-01-10 06:11:42,359 INFO L134 CoverageAnalysis]: Checked inductivity of 61 backedges. 41 proven. 13 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-01-10 06:11:42,359 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:11:42,765 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1187 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1188 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1186 (_ BitVec 32))) (= (_ bv0 32) (let ((.cse0 (bvadd |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv4 64)))) (select (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base|) (bvadd |c_ULTIMATE.start_dll_create_~head~0#1.offset| (_ bv16 64)) v_ArrVal_1186)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1188) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1187) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) .cse0))))) is different from false [2022-01-10 06:11:42,842 INFO L353 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-01-10 06:11:42,842 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 77 [2022-01-10 06:11:42,847 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 112 [2022-01-10 06:11:42,859 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 55 treesize of output 51 [2022-01-10 06:11:42,928 INFO L353 Elim1Store]: treesize reduction 27, result has 43.8 percent of original size [2022-01-10 06:11:42,928 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 96 treesize of output 86 [2022-01-10 06:11:42,932 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 136 treesize of output 118 [2022-01-10 06:11:42,937 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 114 treesize of output 106 [2022-01-10 06:11:43,404 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimCell_36 (_ BitVec 64)) (v_ArrVal_1180 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_1186 (_ BitVec 32))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (and (not .cse0) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1180) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (bvadd |c_ULTIMATE.start_dll_create_~head~0#1.offset| (_ bv16 64)) v_ArrVal_1186) |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (_ bv0 32))) (and .cse0 (forall ((v_arrayElimCell_34 (_ BitVec 64))) (= (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1180))) (store .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (bvadd |c_ULTIMATE.start_dll_create_~head~0#1.offset| (_ bv16 64)) v_ArrVal_1186))) v_arrayElimCell_34) v_arrayElimCell_36) (_ bv0 32))))))) is different from false [2022-01-10 06:11:43,542 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1180 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_1186 (_ BitVec 32))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (and (not .cse0) (= (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1180) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (bvadd |c_ULTIMATE.start_dll_create_~head~0#1.offset| (_ bv16 64)) v_ArrVal_1186) |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (_ bv0 32))) (and .cse0 (forall ((v_arrayElimCell_36 (_ BitVec 64)) (v_arrayElimCell_34 (_ BitVec 64))) (= (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| v_ArrVal_1180))) (store .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (bvadd |c_ULTIMATE.start_dll_create_~head~0#1.offset| (_ bv16 64)) v_ArrVal_1186))) v_arrayElimCell_34) v_arrayElimCell_36) (_ bv0 32))))))) is different from false [2022-01-10 06:11:43,644 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:11:43,644 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2022-01-10 06:11:43,790 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_25| (_ BitVec 64)) (v_ArrVal_1180 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_1186 (_ BitVec 32))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~head~0#1.base| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_25|))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_25|)))) (and (= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_25| v_ArrVal_1180) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (bvadd |c_ULTIMATE.start_dll_create_~head~0#1.offset| (_ bv16 64)) v_ArrVal_1186) |c_ULTIMATE.start_dll_create_~head~0#1.offset|) (_ bv0 32)) (not .cse0)) (and .cse0 (forall ((v_arrayElimCell_36 (_ BitVec 64)) (v_arrayElimCell_34 (_ BitVec 64))) (= (select (select (let ((.cse1 (store |c_#memory_int| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_25| v_ArrVal_1180))) (store .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (bvadd |c_ULTIMATE.start_dll_create_~head~0#1.offset| (_ bv16 64)) v_ArrVal_1186))) v_arrayElimCell_34) v_arrayElimCell_36) (_ bv0 32))))))) is different from false [2022-01-10 06:11:44,001 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:11:44,002 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 19 [2022-01-10 06:11:44,091 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_create_~new_head~0#1.base_25| (_ BitVec 64)) (v_ArrVal_1180 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_1186 (_ BitVec 32))) (let ((.cse1 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_25|))) (or (and (forall ((v_arrayElimCell_36 (_ BitVec 64)) (v_arrayElimCell_34 (_ BitVec 64))) (= (select (select (let ((.cse0 (store |c_#memory_int| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_25| v_ArrVal_1180))) (store .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv16 64)) v_ArrVal_1186))) v_arrayElimCell_34) v_arrayElimCell_36) (_ bv0 32))) .cse1) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_25|)))) (and (= (select (store (select (store |c_#memory_int| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_25| v_ArrVal_1180) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv16 64)) v_ArrVal_1186) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (_ bv0 32)) (not .cse1))))) is different from false [2022-01-10 06:11:44,379 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:11:44,379 INFO L387 Elim1Store]: Elim1 did not use preprocessing 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 22 [2022-01-10 06:11:44,453 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1176 (Array (_ BitVec 64) (_ BitVec 32))) (|v_ULTIMATE.start_dll_create_~new_head~0#1.base_25| (_ BitVec 64)) (v_ArrVal_1180 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_1186 (_ BitVec 32))) (let ((.cse0 (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_25|))) (or (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_ULTIMATE.start_dll_create_~new_head~0#1.base_25|)))) (and (not .cse0) (= (select (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1176) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_25| v_ArrVal_1180) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv16 64)) v_ArrVal_1186) |c_ULTIMATE.start_dll_create_~new_head~0#1.offset|) (_ bv0 32))) (and (forall ((v_arrayElimCell_36 (_ BitVec 64)) (v_arrayElimCell_34 (_ BitVec 64))) (= (select (select (let ((.cse1 (store (store |c_#memory_int| |c_ULTIMATE.start_dll_create_~head~0#1.base| v_ArrVal_1176) |v_ULTIMATE.start_dll_create_~new_head~0#1.base_25| v_ArrVal_1180))) (store .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (store (select .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (bvadd |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| (_ bv16 64)) v_ArrVal_1186))) v_arrayElimCell_34) v_arrayElimCell_36) (_ bv0 32))) .cse0)))) is different from false [2022-01-10 06:11:44,867 INFO L353 Elim1Store]: treesize reduction 308, result has 13.7 percent of original size [2022-01-10 06:11:44,867 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 5 case distinctions, treesize of input 141 treesize of output 105 [2022-01-10 06:11:44,928 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:11:44,929 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3560 treesize of output 3476 [2022-01-10 06:11:45,003 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:11:45,004 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 3680 treesize of output 3606 [2022-01-10 06:11:45,089 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:11:45,090 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 4398 treesize of output 4178