/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-simple/dll2n_append_unequal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 06:07:41,505 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 06:07:41,507 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 06:07:41,560 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 06:07:41,561 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 06:07:41,563 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 06:07:41,564 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 06:07:41,566 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 06:07:41,567 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 06:07:41,568 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 06:07:41,569 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 06:07:41,572 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 06:07:41,572 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 06:07:41,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 06:07:41,579 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 06:07:41,580 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 06:07:41,581 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 06:07:41,582 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 06:07:41,588 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 06:07:41,593 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 06:07:41,595 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 06:07:41,596 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 06:07:41,597 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 06:07:41,597 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 06:07:41,599 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 06:07:41,599 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 06:07:41,600 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 06:07:41,600 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 06:07:41,600 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 06:07:41,601 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 06:07:41,601 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 06:07:41,602 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 06:07:41,602 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 06:07:41,603 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 06:07:41,604 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 06:07:41,604 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 06:07:41,605 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 06:07:41,605 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 06:07:41,605 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 06:07:41,606 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 06:07:41,606 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 06:07:41,612 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:07:41,644 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 06:07:41,644 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 06:07:41,645 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 06:07:41,645 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 06:07:41,645 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 06:07:41,646 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 06:07:41,646 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 06:07:41,646 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 06:07:41,646 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 06:07:41,646 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 06:07:41,647 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 06:07:41,647 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 06:07:41,649 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 06:07:41,649 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 06:07:41,649 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 06:07:41,649 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 06:07:41,649 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 06:07:41,650 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 06:07:41,650 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 06:07:41,650 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 06:07:41,650 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 06:07:41,650 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 06:07:41,650 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 06:07:41,651 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:07:41,651 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 06:07:41,651 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 06:07:41,651 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 06:07:41,651 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 06:07:41,652 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 06:07:41,652 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 06:07:41,652 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 06:07:41,652 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 06:07:41,652 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 06:07:41,652 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:07:41,893 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 06:07:41,911 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 06:07:41,914 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 06:07:41,915 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 06:07:41,917 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 06:07:41,919 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_append_unequal.i [2022-01-10 06:07:41,974 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b106114a/252eec3bb3ae410eaaaa3dbc9c42018e/FLAG1a54ac426 [2022-01-10 06:07:42,490 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 06:07:42,491 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_append_unequal.i [2022-01-10 06:07:42,501 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b106114a/252eec3bb3ae410eaaaa3dbc9c42018e/FLAG1a54ac426 [2022-01-10 06:07:42,992 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4b106114a/252eec3bb3ae410eaaaa3dbc9c42018e [2022-01-10 06:07:42,994 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 06:07:42,995 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 06:07:42,996 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 06:07:42,996 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 06:07:43,004 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 06:07:43,005 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:07:42" (1/1) ... [2022-01-10 06:07:43,006 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1de2b4ff and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:43, skipping insertion in model container [2022-01-10 06:07:43,006 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:07:42" (1/1) ... [2022-01-10 06:07:43,012 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 06:07:43,045 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:07:43,345 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-simple/dll2n_append_unequal.i[24457,24470] [2022-01-10 06:07:43,353 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:07:43,365 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 06:07:43,408 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-simple/dll2n_append_unequal.i[24457,24470] [2022-01-10 06:07:43,409 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:07:43,433 INFO L208 MainTranslator]: Completed translation [2022-01-10 06:07:43,433 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:43 WrapperNode [2022-01-10 06:07:43,434 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 06:07:43,435 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 06:07:43,435 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 06:07:43,435 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 06:07:43,442 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:07:43" (1/1) ... [2022-01-10 06:07:43,462 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:07:43" (1/1) ... [2022-01-10 06:07:43,483 INFO L137 Inliner]: procedures = 130, calls = 40, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 139 [2022-01-10 06:07:43,483 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 06:07:43,484 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 06:07:43,484 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 06:07:43,484 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 06:07:43,492 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:43" (1/1) ... [2022-01-10 06:07:43,492 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:43" (1/1) ... [2022-01-10 06:07:43,496 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:43" (1/1) ... [2022-01-10 06:07:43,497 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:43" (1/1) ... [2022-01-10 06:07:43,505 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:43" (1/1) ... [2022-01-10 06:07:43,525 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:43" (1/1) ... [2022-01-10 06:07:43,527 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:43" (1/1) ... [2022-01-10 06:07:43,540 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 06:07:43,541 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 06:07:43,541 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 06:07:43,541 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 06:07:43,542 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:43" (1/1) ... [2022-01-10 06:07:43,555 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:07:43,563 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 06:07:43,575 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:07:43,583 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:07:43,610 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 06:07:43,610 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-01-10 06:07:43,610 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-01-10 06:07:43,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 06:07:43,610 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 06:07:43,611 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 06:07:43,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 06:07:43,611 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 06:07:43,611 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 06:07:43,611 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 06:07:43,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 06:07:43,612 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 06:07:43,612 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 06:07:43,612 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 06:07:43,745 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 06:07:43,747 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 06:07:44,095 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 06:07:44,101 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 06:07:44,102 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-10 06:07:44,103 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:07:44 BoogieIcfgContainer [2022-01-10 06:07:44,103 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 06:07:44,105 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 06:07:44,105 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 06:07:44,108 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 06:07:44,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:07:42" (1/3) ... [2022-01-10 06:07:44,109 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397ecf05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:07:44, skipping insertion in model container [2022-01-10 06:07:44,109 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:07:43" (2/3) ... [2022-01-10 06:07:44,110 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@397ecf05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:07:44, skipping insertion in model container [2022-01-10 06:07:44,110 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:07:44" (3/3) ... [2022-01-10 06:07:44,111 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2022-01-10 06:07:44,115 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 06:07:44,116 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 06:07:44,149 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 06:07:44,160 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:07:44,160 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 06:07:44,174 INFO L276 IsEmpty]: Start isEmpty. Operand has 36 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 32 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 06:07:44,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 06:07:44,177 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:07:44,178 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:07:44,178 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:07:44,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:07:44,183 INFO L85 PathProgramCache]: Analyzing trace with hash -346371136, now seen corresponding path program 1 times [2022-01-10 06:07:44,194 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:07:44,194 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1861987298] [2022-01-10 06:07:44,195 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:07:44,195 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:07:44,196 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:07:44,198 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:07:44,199 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:07:44,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:07:44,352 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 06:07:44,356 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:07:44,420 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:07:44,421 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:07:44,421 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:07:44,421 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1861987298] [2022-01-10 06:07:44,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1861987298] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:07:44,423 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:07:44,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 06:07:44,425 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1217176386] [2022-01-10 06:07:44,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:07:44,429 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 06:07:44,429 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:07:44,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 06:07:44,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:07:44,464 INFO L87 Difference]: Start difference. First operand has 36 states, 31 states have (on average 1.5161290322580645) internal successors, (47), 32 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 06:07:44,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:07:44,490 INFO L93 Difference]: Finished difference Result 65 states and 91 transitions. [2022-01-10 06:07:44,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 06:07:44,493 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-01-10 06:07:44,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:07:44,500 INFO L225 Difference]: With dead ends: 65 [2022-01-10 06:07:44,500 INFO L226 Difference]: Without dead ends: 30 [2022-01-10 06:07:44,503 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:07:44,508 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:07:44,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:07:44,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-10 06:07:44,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-01-10 06:07:44,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.3076923076923077) internal successors, (34), 26 states have internal predecessors, (34), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 06:07:44,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-01-10 06:07:44,553 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 17 [2022-01-10 06:07:44,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:07:44,553 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-01-10 06:07:44,554 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 06:07:44,554 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-01-10 06:07:44,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 06:07:44,556 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:07:44,556 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:07:44,570 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:07:44,767 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:07:44,767 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:07:44,768 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:07:44,768 INFO L85 PathProgramCache]: Analyzing trace with hash 1530291827, now seen corresponding path program 1 times [2022-01-10 06:07:44,773 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:07:44,774 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [684669032] [2022-01-10 06:07:44,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:07:44,774 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:07:44,774 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:07:44,776 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:07:44,778 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:07:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:07:44,901 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:07:44,902 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:07:44,966 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:07:44,966 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:07:44,966 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:07:44,966 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [684669032] [2022-01-10 06:07:44,967 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [684669032] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:07:44,967 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:07:44,967 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:07:44,967 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365822799] [2022-01-10 06:07:44,967 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:07:44,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:07:44,968 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:07:44,969 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:07:44,969 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:07:44,969 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 06:07:44,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:07:44,984 INFO L93 Difference]: Finished difference Result 58 states and 74 transitions. [2022-01-10 06:07:44,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:07:44,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-01-10 06:07:44,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:07:44,985 INFO L225 Difference]: With dead ends: 58 [2022-01-10 06:07:44,985 INFO L226 Difference]: Without dead ends: 35 [2022-01-10 06:07:44,986 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:07:44,987 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 4 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 71 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:07:44,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 71 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:07:44,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-10 06:07:44,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 31. [2022-01-10 06:07:44,994 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 27 states have (on average 1.2962962962962963) internal successors, (35), 27 states have internal predecessors, (35), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 06:07:44,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 39 transitions. [2022-01-10 06:07:44,995 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 39 transitions. Word has length 17 [2022-01-10 06:07:44,995 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:07:44,995 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 39 transitions. [2022-01-10 06:07:44,996 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-01-10 06:07:44,996 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 39 transitions. [2022-01-10 06:07:44,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 06:07:44,998 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:07:44,998 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:07:45,019 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:07:45,208 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:07:45,209 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:07:45,209 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:07:45,209 INFO L85 PathProgramCache]: Analyzing trace with hash 878865159, now seen corresponding path program 1 times [2022-01-10 06:07:45,210 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:07:45,210 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [745437514] [2022-01-10 06:07:45,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:07:45,210 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:07:45,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:07:45,211 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:07:45,214 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:07:45,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:07:45,376 INFO L263 TraceCheckSpWp]: Trace formula consists of 187 conjuncts, 3 conjunts are in the unsatisfiable core [2022-01-10 06:07:45,378 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:07:45,457 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:07:45,458 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:07:45,458 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:07:45,458 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [745437514] [2022-01-10 06:07:45,458 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [745437514] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:07:45,458 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:07:45,458 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:07:45,459 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [622150185] [2022-01-10 06:07:45,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:07:45,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:07:45,459 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:07:45,460 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:07:45,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:07:45,460 INFO L87 Difference]: Start difference. First operand 31 states and 39 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 06:07:45,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:07:45,508 INFO L93 Difference]: Finished difference Result 63 states and 81 transitions. [2022-01-10 06:07:45,509 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:07:45,509 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 27 [2022-01-10 06:07:45,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:07:45,510 INFO L225 Difference]: With dead ends: 63 [2022-01-10 06:07:45,510 INFO L226 Difference]: Without dead ends: 35 [2022-01-10 06:07:45,510 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 25 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:07:45,511 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 1 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 69 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.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:07:45,512 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1 Valid, 69 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:07:45,513 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2022-01-10 06:07:45,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2022-01-10 06:07:45,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:07:45,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-01-10 06:07:45,517 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 27 [2022-01-10 06:07:45,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:07:45,518 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-01-10 06:07:45,518 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 06:07:45,518 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-01-10 06:07:45,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-10 06:07:45,519 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:07:45,519 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:07:45,536 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:07:45,730 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:07:45,731 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:07:45,731 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:07:45,731 INFO L85 PathProgramCache]: Analyzing trace with hash -709482743, now seen corresponding path program 1 times [2022-01-10 06:07:45,732 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:07:45,732 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [461009100] [2022-01-10 06:07:45,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:07:45,732 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:07:45,732 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:07:45,733 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:07:45,736 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:07:45,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:07:45,860 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 06:07:45,863 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:07:45,921 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:07:45,921 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:07:45,995 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 06:07:45,996 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:07:45,996 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [461009100] [2022-01-10 06:07:45,996 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [461009100] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:07:45,996 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:07:45,997 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-10 06:07:45,997 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163066931] [2022-01-10 06:07:45,997 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:07:45,997 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 06:07:45,998 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:07:45,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 06:07:45,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:07:45,998 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 06:07:46,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:07:46,040 INFO L93 Difference]: Finished difference Result 63 states and 80 transitions. [2022-01-10 06:07:46,041 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:07:46,041 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 27 [2022-01-10 06:07:46,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:07:46,042 INFO L225 Difference]: With dead ends: 63 [2022-01-10 06:07:46,042 INFO L226 Difference]: Without dead ends: 40 [2022-01-10 06:07:46,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:07:46,049 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 10 mSDsluCounter, 99 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:07:46,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 140 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:07:46,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-10 06:07:46,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 36. [2022-01-10 06:07:46,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2580645161290323) internal successors, (39), 31 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:07:46,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 45 transitions. [2022-01-10 06:07:46,063 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 45 transitions. Word has length 27 [2022-01-10 06:07:46,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:07:46,063 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 45 transitions. [2022-01-10 06:07:46,064 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 06:07:46,064 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-01-10 06:07:46,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 06:07:46,065 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:07:46,065 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:07:46,077 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:07:46,275 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:07:46,276 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:07:46,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:07:46,276 INFO L85 PathProgramCache]: Analyzing trace with hash -1607276515, now seen corresponding path program 1 times [2022-01-10 06:07:46,277 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:07:46,277 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [57309063] [2022-01-10 06:07:46,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:07:46,277 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:07:46,278 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:07:46,280 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:07:46,281 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:07:46,616 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:07:46,631 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 19 conjunts are in the unsatisfiable core [2022-01-10 06:07:46,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:07:46,887 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 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 06:07:47,034 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 8 treesize of output 4 [2022-01-10 06:07:47,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:47,309 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 15 treesize of output 17 [2022-01-10 06:07:47,409 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 16 treesize of output 8 [2022-01-10 06:07:47,445 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 06:07:47,445 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:07:47,718 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:07:47,718 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [57309063] [2022-01-10 06:07:47,718 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [57309063] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:07:47,719 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2040771473] [2022-01-10 06:07:47,719 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:07:47,719 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 06:07:47,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 06:07:47,721 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-01-10 06:07:47,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-01-10 06:07:48,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:07:48,109 INFO L263 TraceCheckSpWp]: Trace formula consists of 256 conjuncts, 19 conjunts are in the unsatisfiable core [2022-01-10 06:07:48,115 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:07:48,734 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 8 treesize of output 4 [2022-01-10 06:07:48,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:48,875 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 15 treesize of output 17 [2022-01-10 06:07:48,965 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 16 treesize of output 8 [2022-01-10 06:07:48,976 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 15 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 06:07:48,976 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:07:49,132 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2040771473] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:07:49,132 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:07:49,132 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 23 [2022-01-10 06:07:49,132 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147337976] [2022-01-10 06:07:49,133 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:07:49,133 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-01-10 06:07:49,133 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:07:49,133 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-01-10 06:07:49,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=502, Unknown=8, NotChecked=0, Total=600 [2022-01-10 06:07:49,134 INFO L87 Difference]: Start difference. First operand 36 states and 45 transitions. Second operand has 23 states, 21 states have (on average 2.0) internal successors, (42), 18 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-10 06:07:49,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:07:49,841 INFO L93 Difference]: Finished difference Result 46 states and 58 transitions. [2022-01-10 06:07:49,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 06:07:49,842 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 2.0) internal successors, (42), 18 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 37 [2022-01-10 06:07:49,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:07:49,843 INFO L225 Difference]: With dead ends: 46 [2022-01-10 06:07:49,843 INFO L226 Difference]: Without dead ends: 36 [2022-01-10 06:07:49,843 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 59 SyntacticMatches, 4 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 233 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=140, Invalid=719, Unknown=11, NotChecked=0, Total=870 [2022-01-10 06:07:49,844 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 34 mSDsluCounter, 128 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 155 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 31 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-10 06:07:49,844 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 155 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 127 Invalid, 0 Unknown, 31 Unchecked, 0.5s Time] [2022-01-10 06:07:49,845 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-10 06:07:49,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2022-01-10 06:07:49,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 states have internal predecessors, (38), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:07:49,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 44 transitions. [2022-01-10 06:07:49,849 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 44 transitions. Word has length 37 [2022-01-10 06:07:49,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:07:49,849 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 44 transitions. [2022-01-10 06:07:49,849 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 2.0) internal successors, (42), 18 states have internal predecessors, (42), 4 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-10 06:07:49,849 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 44 transitions. [2022-01-10 06:07:49,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 06:07:49,850 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:07:49,850 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:07:49,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2022-01-10 06:07:50,061 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:07:50,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:07:50,251 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:07:50,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:07:50,252 INFO L85 PathProgramCache]: Analyzing trace with hash -859241559, now seen corresponding path program 1 times [2022-01-10 06:07:50,252 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:07:50,252 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437141405] [2022-01-10 06:07:50,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:07:50,253 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:07:50,253 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:07:50,254 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:07:50,256 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:07:50,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:07:50,672 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 50 conjunts are in the unsatisfiable core [2022-01-10 06:07:50,676 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:07:50,720 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:07:51,118 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-01-10 06:07:51,119 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2022-01-10 06:07:51,229 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 13 treesize of output 9 [2022-01-10 06:07:51,391 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 06:07:51,392 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 59 treesize of output 56 [2022-01-10 06:07:51,401 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 12 treesize of output 11 [2022-01-10 06:07:51,931 INFO L353 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-01-10 06:07:51,932 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 34 [2022-01-10 06:07:51,944 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 7 treesize of output 3 [2022-01-10 06:07:51,954 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-10 06:07:52,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:52,292 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 06:07:52,293 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 60 treesize of output 52 [2022-01-10 06:07:52,345 INFO L353 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-01-10 06:07:52,346 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 31 treesize of output 33 [2022-01-10 06:07:52,375 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:52,377 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-10 06:07:52,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 15 treesize of output 7 [2022-01-10 06:07:52,987 INFO L353 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-01-10 06:07:52,988 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 32 [2022-01-10 06:07:53,135 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:07:53,135 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:07:53,397 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_19| (_ BitVec 64)) (v_ArrVal_441 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_440 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (bvult |v_node_create_~temp~0#1.base_19| |c_#StackHeapBarrier|)) (not (= (_ bv0 1) (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_19|)))) (not (= (_ bv0 64) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_19| v_ArrVal_441))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_19| v_ArrVal_440) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 64))))))) is different from false [2022-01-10 06:07:53,400 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:07:53,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437141405] [2022-01-10 06:07:53,400 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437141405] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:07:53,400 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1786177469] [2022-01-10 06:07:53,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:07:53,401 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 06:07:53,401 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 06:07:53,402 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-01-10 06:07:53,403 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-01-10 06:07:53,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:07:54,013 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 47 conjunts are in the unsatisfiable core [2022-01-10 06:07:54,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:07:54,822 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 7 treesize of output 3 [2022-01-10 06:07:55,246 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 06:07:55,247 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-01-10 06:07:55,258 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 5 treesize of output 3 [2022-01-10 06:07:56,296 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:56,297 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:56,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:56,302 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:07:56,302 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 54 [2022-01-10 06:07:56,332 INFO L353 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-01-10 06:07:56,332 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 110 treesize of output 91 [2022-01-10 06:07:56,372 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 06:07:56,373 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 88 treesize of output 85 [2022-01-10 06:07:56,575 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:56,577 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:56,580 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:07:56,580 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 78 treesize of output 20 [2022-01-10 06:07:56,586 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 7 treesize of output 3 [2022-01-10 06:07:56,689 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 06:07:56,689 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:07:56,689 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1786177469] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:07:56,689 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 06:07:56,689 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [21] imperfect sequences [24] total 42 [2022-01-10 06:07:56,690 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [142675427] [2022-01-10 06:07:56,690 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:07:56,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-10 06:07:56,690 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:07:56,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-10 06:07:56,691 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=151, Invalid=1741, Unknown=4, NotChecked=84, Total=1980 [2022-01-10 06:07:56,692 INFO L87 Difference]: Start difference. First operand 36 states and 44 transitions. Second operand has 21 states, 20 states have (on average 1.65) internal successors, (33), 18 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 06:07:57,157 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:07:57,157 INFO L93 Difference]: Finished difference Result 45 states and 54 transitions. [2022-01-10 06:07:57,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-10 06:07:57,159 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 1.65) internal successors, (33), 18 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 40 [2022-01-10 06:07:57,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:07:57,160 INFO L225 Difference]: With dead ends: 45 [2022-01-10 06:07:57,160 INFO L226 Difference]: Without dead ends: 42 [2022-01-10 06:07:57,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 42 SyntacticMatches, 3 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 704 ImplicationChecksByTransitivity, 3.3s TimeCoverageRelationStatistics Valid=184, Invalid=2071, Unknown=5, NotChecked=92, Total=2352 [2022-01-10 06:07:57,162 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 18 mSDsluCounter, 171 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 93 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:07:57,162 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 192 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 62 Invalid, 0 Unknown, 93 Unchecked, 0.2s Time] [2022-01-10 06:07:57,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-10 06:07:57,165 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-01-10 06:07:57,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 36 states have (on average 1.2222222222222223) internal successors, (44), 36 states have internal predecessors, (44), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:07:57,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 50 transitions. [2022-01-10 06:07:57,166 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 50 transitions. Word has length 40 [2022-01-10 06:07:57,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:07:57,167 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 50 transitions. [2022-01-10 06:07:57,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 1.65) internal successors, (33), 18 states have internal predecessors, (33), 2 states have call successors, (2), 2 states have call predecessors, (2), 3 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2022-01-10 06:07:57,167 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 50 transitions. [2022-01-10 06:07:57,168 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 06:07:57,168 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:07:57,168 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:07:57,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Forceful destruction successful, exit code 0 [2022-01-10 06:07:57,386 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:07:57,575 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:07:57,576 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:07:57,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:07:57,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1122207131, now seen corresponding path program 1 times [2022-01-10 06:07:57,577 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:07:57,577 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350428113] [2022-01-10 06:07:57,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:07:57,577 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:07:57,577 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:07:57,578 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:07:57,579 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:07:58,005 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:07:58,026 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 49 conjunts are in the unsatisfiable core [2022-01-10 06:07:58,030 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:07:58,060 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:07:58,372 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-01-10 06:07:58,373 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2022-01-10 06:07:58,453 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 13 treesize of output 9 [2022-01-10 06:07:58,578 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 06:07:58,578 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 48 treesize of output 47 [2022-01-10 06:07:58,954 INFO L353 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-01-10 06:07:58,954 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 35 [2022-01-10 06:07:58,964 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 7 treesize of output 3 [2022-01-10 06:07:58,973 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 06:07:59,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:59,244 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:07:59,264 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:07:59,286 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 06:07:59,286 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 61 treesize of output 53 [2022-01-10 06:07:59,318 INFO L353 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-01-10 06:07:59,319 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2022-01-10 06:07:59,509 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:07:59,742 INFO L353 Elim1Store]: treesize reduction 3, result has 75.0 percent of original size [2022-01-10 06:07:59,742 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 60 treesize of output 32 [2022-01-10 06:07:59,856 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:07:59,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:08:00,086 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_22| (_ BitVec 64)) (v_ArrVal_653 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_652 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (bvult |v_node_create_~temp~0#1.base_22| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_22|) (_ bv0 1))) (not (= (_ bv0 64) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_22| v_ArrVal_652))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_22| v_ArrVal_653) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 64))))))) is different from false [2022-01-10 06:08:00,090 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:08:00,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350428113] [2022-01-10 06:08:00,090 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350428113] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:08:00,090 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [966804491] [2022-01-10 06:08:00,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:08:00,090 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 06:08:00,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 06:08:00,091 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-01-10 06:08:00,092 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-01-10 06:08:00,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:08:00,705 INFO L263 TraceCheckSpWp]: Trace formula consists of 275 conjuncts, 62 conjunts are in the unsatisfiable core [2022-01-10 06:08:00,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:08:00,793 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:08:01,331 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-01-10 06:08:01,331 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2022-01-10 06:08:01,495 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 13 treesize of output 9 [2022-01-10 06:08:01,684 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 06:08:01,684 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 48 treesize of output 47 [2022-01-10 06:08:02,360 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:08:02,361 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 29 [2022-01-10 06:08:02,369 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 06:08:02,375 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 7 treesize of output 3 [2022-01-10 06:08:02,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:08:02,733 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 06:08:02,734 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 58 [2022-01-10 06:08:02,766 INFO L353 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-01-10 06:08:02,766 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 34 [2022-01-10 06:08:02,831 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 06:08:02,832 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 1 case distinctions, treesize of input 14 treesize of output 20 [2022-01-10 06:08:02,854 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 5 treesize of output 3 [2022-01-10 06:08:03,879 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 16 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:08:03,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:08:04,044 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_dll_append_#t~ret7#1.base_26| (_ BitVec 64)) (v_ArrVal_766 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_765 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (bvult |v_ULTIMATE.start_dll_append_#t~ret7#1.base_26| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_26|) (_ bv0 1))) (not (= (_ bv0 64) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_26| v_ArrVal_765))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))) (bvadd (_ bv4 64) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_26| v_ArrVal_766) |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))))))) is different from false [2022-01-10 06:08:04,048 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [966804491] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:08:04,048 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:08:04,048 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 25] total 42 [2022-01-10 06:08:04,048 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903776868] [2022-01-10 06:08:04,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:08:04,048 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2022-01-10 06:08:04,049 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:08:04,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2022-01-10 06:08:04,050 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=186, Invalid=1707, Unknown=7, NotChecked=170, Total=2070 [2022-01-10 06:08:04,050 INFO L87 Difference]: Start difference. First operand 41 states and 50 transitions. Second operand has 42 states, 40 states have (on average 1.475) internal successors, (59), 33 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 06:08:06,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:08:06,319 INFO L93 Difference]: Finished difference Result 73 states and 91 transitions. [2022-01-10 06:08:06,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-01-10 06:08:06,320 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 1.475) internal successors, (59), 33 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2022-01-10 06:08:06,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:08:06,322 INFO L225 Difference]: With dead ends: 73 [2022-01-10 06:08:06,322 INFO L226 Difference]: Without dead ends: 40 [2022-01-10 06:08:06,323 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 60 SyntacticMatches, 2 SemanticMatches, 52 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=290, Invalid=2362, Unknown=8, NotChecked=202, Total=2862 [2022-01-10 06:08:06,323 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 30 mSDsluCounter, 256 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 06:08:06,324 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 283 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 246 Invalid, 0 Unknown, 71 Unchecked, 0.9s Time] [2022-01-10 06:08:06,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-10 06:08:06,329 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 38. [2022-01-10 06:08:06,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 33 states have (on average 1.1818181818181819) internal successors, (39), 33 states have internal predecessors, (39), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:08:06,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-01-10 06:08:06,330 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 42 [2022-01-10 06:08:06,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:08:06,330 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-01-10 06:08:06,330 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 1.475) internal successors, (59), 33 states have internal predecessors, (59), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 06:08:06,330 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-01-10 06:08:06,331 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 06:08:06,331 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:08:06,331 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:08:06,341 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2022-01-10 06:08:06,548 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-01-10 06:08:06,738 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:08:06,738 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:08:06,738 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:08:06,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1563025532, now seen corresponding path program 1 times [2022-01-10 06:08:06,739 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:08:06,739 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [504088170] [2022-01-10 06:08:06,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:08:06,739 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:08:06,740 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:08:06,741 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:08:06,758 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-01-10 06:08:07,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:08:07,166 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 78 conjunts are in the unsatisfiable core [2022-01-10 06:08:07,170 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:08:07,180 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:08:07,200 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 5 treesize of output 3 [2022-01-10 06:08:07,318 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-01-10 06:08:07,318 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-01-10 06:08:07,495 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-10 06:08:07,616 INFO L353 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-01-10 06:08:07,617 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 25 treesize of output 42 [2022-01-10 06:08:07,738 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 13 treesize of output 9 [2022-01-10 06:08:07,753 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 06:08:07,896 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 06:08:07,897 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 62 [2022-01-10 06:08:07,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, 5 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:08:08,428 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-10 06:08:08,428 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 91 treesize of output 42 [2022-01-10 06:08:08,448 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 06:08:08,462 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 5 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2022-01-10 06:08:08,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:08:08,743 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 06:08:08,743 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 97 treesize of output 77 [2022-01-10 06:08:08,786 INFO L353 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-01-10 06:08:08,787 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 42 [2022-01-10 06:08:08,811 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-01-10 06:08:10,594 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 06:08:10,708 INFO L353 Elim1Store]: treesize reduction 169, result has 12.4 percent of original size [2022-01-10 06:08:10,709 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 8 new quantified variables, introduced 9 case distinctions, treesize of input 190 treesize of output 101 [2022-01-10 06:08:10,805 INFO L353 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-01-10 06:08:10,806 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 292 treesize of output 203 [2022-01-10 06:08:10,889 INFO L353 Elim1Store]: treesize reduction 102, result has 16.4 percent of original size [2022-01-10 06:08:10,889 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 243 treesize of output 208 [2022-01-10 06:08:11,181 INFO L353 Elim1Store]: treesize reduction 45, result has 8.2 percent of original size [2022-01-10 06:08:11,181 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 3 case distinctions, treesize of input 212 treesize of output 63 [2022-01-10 06:08:11,193 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 5 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 06:08:11,368 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 06:08:11,369 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:08:11,474 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_876 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_872 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (_ bv0 64) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 64) |c_ULTIMATE.start_dll_append_~last~0#1.offset|) |c_ULTIMATE.start_dll_append_~new_last~0#1.base|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_876))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_872) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_878) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 64)))))) is different from false [2022-01-10 06:08:13,678 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_878 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_876 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_30| (_ BitVec 64)) (v_ArrVal_884 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_883 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_872 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_30| v_ArrVal_884)) (.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_30| v_ArrVal_883))) (let ((.cse6 (select (select .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (.cse7 (bvadd (_ bv4 64) (select (select .cse5 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)))) (let ((.cse4 (select (select .cse3 .cse6) .cse7))) (let ((.cse0 (select .cse3 .cse4)) (.cse1 (bvadd (select (select .cse5 .cse6) .cse7) (_ bv4 64)))) (or (not (= (_ bv0 64) (select .cse0 .cse1))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_30|))) (not (= (_ bv0 64) (select (let ((.cse2 (store (store .cse3 .cse4 (store .cse0 .cse1 |v_ULTIMATE.start_dll_append_#t~ret7#1.base_30|)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_30| v_ArrVal_876))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store (store .cse5 .cse4 v_ArrVal_872) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_30| v_ArrVal_878) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 64))))) (not (bvult |v_ULTIMATE.start_dll_append_#t~ret7#1.base_30| |c_#StackHeapBarrier|)))))))) is different from false [2022-01-10 06:08:13,699 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:08:13,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [504088170] [2022-01-10 06:08:13,700 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [504088170] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:08:13,700 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2018312754] [2022-01-10 06:08:13,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:08:13,700 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 06:08:13,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 06:08:13,701 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-01-10 06:08:13,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Waiting until timeout for monitored process [2022-01-10 06:08:14,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:08:14,358 INFO L263 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 70 conjunts are in the unsatisfiable core [2022-01-10 06:08:14,362 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:08:14,623 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:08:15,736 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-01-10 06:08:15,737 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 27 [2022-01-10 06:08:15,998 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 13 treesize of output 9 [2022-01-10 06:08:16,336 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 06:08:16,336 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 46 [2022-01-10 06:08:17,434 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:08:17,434 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 35 [2022-01-10 06:08:17,441 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2022-01-10 06:08:17,449 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 7 treesize of output 3 [2022-01-10 06:08:18,247 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 06:08:18,247 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-01-10 06:08:18,252 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 5 treesize of output 3 [2022-01-10 06:08:18,286 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:08:18,304 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 06:08:18,304 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 66 [2022-01-10 06:08:18,348 INFO L353 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-01-10 06:08:18,348 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 36 [2022-01-10 06:08:21,797 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 06:08:21,964 INFO L353 Elim1Store]: treesize reduction 146, result has 19.3 percent of original size [2022-01-10 06:08:21,965 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 7 new quantified variables, introduced 9 case distinctions, treesize of input 175 treesize of output 98 [2022-01-10 06:08:21,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:08:22,027 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 06:08:22,028 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 157 treesize of output 127 [2022-01-10 06:08:22,068 INFO L353 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-01-10 06:08:22,068 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 135 treesize of output 106 [2022-01-10 06:08:22,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:08:22,090 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 97 treesize of output 91 [2022-01-10 06:08:22,633 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:08:22,638 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:08:22,638 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 30 [2022-01-10 06:08:22,655 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 7 treesize of output 3 [2022-01-10 06:08:22,891 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:08:22,891 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:08:22,939 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_992 (_ BitVec 64)) (v_ArrVal_991 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_990 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_987 (_ BitVec 64))) (not (= (_ bv0 64) (let ((.cse1 (bvadd (_ bv4 64) |c_ULTIMATE.start_dll_append_~last~0#1.offset|))) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 v_ArrVal_992)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_990))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse1 v_ArrVal_987)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_991) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 64))))))) is different from false [2022-01-10 06:08:32,898 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_992 (_ BitVec 64)) (v_ArrVal_991 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_990 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_16| (_ BitVec 64)) (v_ArrVal_987 (_ BitVec 64))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 64))))) (let ((.cse0 (select |c_#memory_$Pointer$.base| .cse3)) (.cse1 (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_16| (_ bv4 64)))) (or (not (= (_ bv0 64) (select .cse0 .cse1))) (not (= (_ bv0 64) (select (let ((.cse2 (store (store |c_#memory_$Pointer$.base| .cse3 (store .cse0 .cse1 v_ArrVal_992)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_990))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 64) (select (select (store (store |c_#memory_$Pointer$.offset| .cse3 (store (select |c_#memory_$Pointer$.offset| .cse3) .cse1 v_ArrVal_987)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_991) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))))) is different from false [2022-01-10 06:08:33,048 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_992 (_ BitVec 64)) (v_ArrVal_991 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_990 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_16| (_ BitVec 64)) (v_ArrVal_987 (_ BitVec 64))) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 64))))) (let ((.cse2 (select |c_#memory_$Pointer$.base| .cse1)) (.cse3 (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_16| (_ bv4 64)))) (or (not (= (_ bv0 64) (select (let ((.cse0 (store (store |c_#memory_$Pointer$.base| .cse1 (store .cse2 .cse3 v_ArrVal_992)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_990))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (select (select (store (store |c_#memory_$Pointer$.offset| .cse1 (store (select |c_#memory_$Pointer$.offset| .cse1) .cse3 v_ArrVal_987)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_991) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 64))))) (not (= (_ bv0 64) (select .cse2 .cse3))))))) is different from false [2022-01-10 06:08:33,774 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_998 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_997 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_992 (_ BitVec 64)) (|v_ULTIMATE.start_dll_append_#t~ret7#1.base_34| (_ BitVec 64)) (v_ArrVal_991 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_990 (Array (_ BitVec 64) (_ BitVec 64))) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_16| (_ BitVec 64)) (v_ArrVal_987 (_ BitVec 64))) (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_34| v_ArrVal_998)) (.cse5 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_34| v_ArrVal_997))) (let ((.cse4 (select (select .cse3 (select (select .cse3 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (_ bv4 64) (select (select .cse5 |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|))))) (let ((.cse0 (select .cse3 .cse4)) (.cse1 (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_16| (_ bv4 64)))) (or (not (= (_ bv0 64) (select .cse0 .cse1))) (not (= (_ bv0 64) (select (let ((.cse2 (store (store .cse3 .cse4 (store .cse0 .cse1 v_ArrVal_992)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_34| v_ArrVal_990))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 64) (select (select (store (store .cse5 .cse4 (store (select .cse5 .cse4) .cse1 v_ArrVal_987)) |v_ULTIMATE.start_dll_append_#t~ret7#1.base_34| v_ArrVal_991) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (bvult |v_ULTIMATE.start_dll_append_#t~ret7#1.base_34| |c_#StackHeapBarrier|)) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_append_#t~ret7#1.base_34|) (_ bv0 1)))))))) is different from false [2022-01-10 06:08:33,796 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2018312754] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:08:33,796 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:08:33,796 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 29] total 51 [2022-01-10 06:08:33,796 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534995916] [2022-01-10 06:08:33,796 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:08:33,797 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2022-01-10 06:08:33,797 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:08:33,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2022-01-10 06:08:33,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=270, Invalid=3271, Unknown=23, NotChecked=726, Total=4290 [2022-01-10 06:08:33,798 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 51 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 41 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 06:08:42,418 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:08:42,418 INFO L93 Difference]: Finished difference Result 48 states and 57 transitions. [2022-01-10 06:08:42,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-10 06:08:42,420 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 41 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 42 [2022-01-10 06:08:42,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:08:42,421 INFO L225 Difference]: With dead ends: 48 [2022-01-10 06:08:42,421 INFO L226 Difference]: Without dead ends: 45 [2022-01-10 06:08:42,423 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 127 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 1873 ImplicationChecksByTransitivity, 27.7s TimeCoverageRelationStatistics Valid=471, Invalid=5692, Unknown=23, NotChecked=954, Total=7140 [2022-01-10 06:08:42,423 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 27 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 263 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 06:08:42,424 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 424 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 168 Invalid, 0 Unknown, 263 Unchecked, 0.7s Time] [2022-01-10 06:08:42,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-10 06:08:42,429 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2022-01-10 06:08:42,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 38 states have (on average 1.1842105263157894) internal successors, (45), 38 states have internal predecessors, (45), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:08:42,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 51 transitions. [2022-01-10 06:08:42,430 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 51 transitions. Word has length 42 [2022-01-10 06:08:42,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:08:42,431 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 51 transitions. [2022-01-10 06:08:42,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 1.3061224489795917) internal successors, (64), 41 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 06:08:42,431 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 51 transitions. [2022-01-10 06:08:42,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2022-01-10 06:08:42,432 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:08:42,432 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:08:42,444 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (13)] Forceful destruction successful, exit code 0 [2022-01-10 06:08:42,649 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Ended with exit code 0 [2022-01-10 06:08:42,838 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:08:42,838 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:08:42,839 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:08:42,839 INFO L85 PathProgramCache]: Analyzing trace with hash 1146227584, now seen corresponding path program 1 times [2022-01-10 06:08:42,839 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:08:42,839 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [169460326] [2022-01-10 06:08:42,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:08:42,839 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:08:42,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:08:42,840 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:08:42,841 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-01-10 06:08:43,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:08:43,300 INFO L263 TraceCheckSpWp]: Trace formula consists of 280 conjuncts, 80 conjunts are in the unsatisfiable core [2022-01-10 06:08:43,304 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:08:43,321 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:08:43,369 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 5 treesize of output 3 [2022-01-10 06:08:43,525 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-01-10 06:08:43,525 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 17 treesize of output 24 [2022-01-10 06:08:43,805 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 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 06:08:44,038 INFO L353 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-01-10 06:08:44,038 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 24 treesize of output 41 [2022-01-10 06:08:44,265 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 13 treesize of output 9 [2022-01-10 06:08:44,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:08:44,333 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 16 treesize of output 17 [2022-01-10 06:08:44,507 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 06:08:44,508 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 70 treesize of output 65 [2022-01-10 06:08:44,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 22 [2022-01-10 06:08:44,540 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 12 treesize of output 11 [2022-01-10 06:08:45,376 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-10 06:08:45,376 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 72 treesize of output 35 [2022-01-10 06:08:45,390 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 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 7 treesize of output 3 [2022-01-10 06:08:45,403 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 14 [2022-01-10 06:08:45,413 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-10 06:08:46,093 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 06:08:46,094 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-01-10 06:08:46,113 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 5 treesize of output 3 [2022-01-10 06:08:46,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:08:46,187 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 06:08:46,188 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 78 treesize of output 66 [2022-01-10 06:08:46,203 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:08:46,204 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 18 treesize of output 20 [2022-01-10 06:08:46,286 INFO L353 Elim1Store]: treesize reduction 12, result has 67.6 percent of original size [2022-01-10 06:08:46,287 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 37 treesize of output 41 [2022-01-10 06:08:48,042 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:08:48,150 INFO L353 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-01-10 06:08:48,151 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 158 treesize of output 127 [2022-01-10 06:08:48,204 INFO L353 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-01-10 06:08:48,204 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 58 [2022-01-10 06:08:48,235 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:08:48,236 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 37 [2022-01-10 06:08:48,257 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:08:48,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:08:48,260 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 39 [2022-01-10 06:08:48,597 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-10 06:08:48,597 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 75 treesize of output 34 [2022-01-10 06:08:48,615 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 06:08:48,839 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:08:48,948 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:08:48,948 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:08:49,277 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1112 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (|ULTIMATE.start_dll_append_~last~0#1.offset| (_ BitVec 64)) (|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 64)) (v_ArrVal_1111 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1109 (Array (_ BitVec 64) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1109) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1112) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base| v_ArrVal_1117) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1111) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 64) |ULTIMATE.start_dll_append_~last~0#1.offset|) |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1113) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-01-10 06:08:49,348 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1112 (Array (_ BitVec 64) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_20| (_ BitVec 64)) (v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 64)) (v_ArrVal_1111 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1109 (Array (_ BitVec 64) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) (bvadd (_ bv4 64) |c_ULTIMATE.start_dll_append_~last~0#1.offset|)))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1109) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1112) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1117) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1111) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_20| (_ bv4 64)) |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1113) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-01-10 06:08:49,397 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1112 (Array (_ BitVec 64) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_20| (_ BitVec 64)) (v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 64)) (v_ArrVal_1111 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1109 (Array (_ BitVec 64) (_ BitVec 32)))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 64))))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1109) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1112) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1117) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1111) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_20| (_ bv4 64)) |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_1113) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-01-10 06:08:49,438 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1117 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1112 (Array (_ BitVec 64) (_ BitVec 32))) (|v_ULTIMATE.start_dll_append_~last~0#1.offset_20| (_ BitVec 64)) (v_ArrVal_1113 (Array (_ BitVec 64) (_ BitVec 64))) (|ULTIMATE.start_dll_append_~new_last~0#1.offset| (_ BitVec 64)) (v_ArrVal_1111 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_1109 (Array (_ BitVec 64) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) |c_ULTIMATE.start_dll_append_~head#1.offset|) (_ bv4 64))))) (select (select (store (store |c_#memory_int| .cse0 v_ArrVal_1109) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1112) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_1117) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1111) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 (store (select |c_#memory_$Pointer$.offset| .cse0) (bvadd |v_ULTIMATE.start_dll_append_~last~0#1.offset_20| (_ bv4 64)) |ULTIMATE.start_dll_append_~new_last~0#1.offset|)) |c_ULTIMATE.start_dll_append_#t~ret7#1.base| v_ArrVal_1113) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-01-10 06:08:50,547 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:08:50,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [169460326] [2022-01-10 06:08:50,547 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [169460326] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:08:50,547 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [51450744] [2022-01-10 06:08:50,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:08:50,547 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 06:08:50,548 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 06:08:50,549 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-01-10 06:08:50,550 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (15)] Waiting until timeout for monitored process