/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/sll2n_append_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 06:09:10,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 06:09:10,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 06:09:10,724 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 06:09:10,724 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 06:09:10,735 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 06:09:10,737 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 06:09:10,739 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 06:09:10,740 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 06:09:10,744 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 06:09:10,744 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 06:09:10,745 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 06:09:10,745 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 06:09:10,747 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 06:09:10,748 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 06:09:10,750 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 06:09:10,750 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 06:09:10,751 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 06:09:10,752 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 06:09:10,756 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 06:09:10,757 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 06:09:10,759 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 06:09:10,760 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 06:09:10,761 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 06:09:10,766 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 06:09:10,766 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 06:09:10,766 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 06:09:10,767 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 06:09:10,768 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 06:09:10,768 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 06:09:10,768 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 06:09:10,769 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 06:09:10,770 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 06:09:10,771 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 06:09:10,772 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 06:09:10,772 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 06:09:10,772 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 06:09:10,772 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 06:09:10,773 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 06:09:10,773 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 06:09:10,774 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 06:09:10,774 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:09:10,797 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 06:09:10,797 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 06:09:10,798 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 06:09:10,798 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 06:09:10,799 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 06:09:10,799 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 06:09:10,799 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 06:09:10,799 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 06:09:10,799 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 06:09:10,800 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 06:09:10,800 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 06:09:10,800 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 06:09:10,800 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 06:09:10,801 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 06:09:10,801 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 06:09:10,801 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 06:09:10,801 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 06:09:10,801 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 06:09:10,801 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 06:09:10,801 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 06:09:10,801 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 06:09:10,801 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 06:09:10,802 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 06:09:10,802 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:09:10,803 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 06:09:10,803 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 06:09:10,803 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 06:09:10,803 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 06:09:10,803 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 06:09:10,803 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 06:09:10,803 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 06:09:10,803 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 06:09:10,804 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 06:09:10,804 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:09:11,015 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 06:09:11,027 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 06:09:11,029 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 06:09:11,030 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 06:09:11,030 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 06:09:11,031 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_append_equal.i [2022-01-10 06:09:11,075 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48da722b1/fb424477d7054a66bec85cbf3b379574/FLAG22e2916bc [2022-01-10 06:09:11,417 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 06:09:11,417 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_append_equal.i [2022-01-10 06:09:11,431 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48da722b1/fb424477d7054a66bec85cbf3b379574/FLAG22e2916bc [2022-01-10 06:09:11,443 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/48da722b1/fb424477d7054a66bec85cbf3b379574 [2022-01-10 06:09:11,446 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 06:09:11,447 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 06:09:11,450 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 06:09:11,450 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 06:09:11,452 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 06:09:11,453 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:09:11" (1/1) ... [2022-01-10 06:09:11,453 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1a55cec and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:11, skipping insertion in model container [2022-01-10 06:09:11,454 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:09:11" (1/1) ... [2022-01-10 06:09:11,458 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 06:09:11,495 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:09:11,768 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/sll2n_append_equal.i[24197,24210] [2022-01-10 06:09:11,771 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:09:11,783 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 06:09:11,817 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/sll2n_append_equal.i[24197,24210] [2022-01-10 06:09:11,818 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:09:11,846 INFO L208 MainTranslator]: Completed translation [2022-01-10 06:09:11,846 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:11 WrapperNode [2022-01-10 06:09:11,846 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 06:09:11,847 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 06:09:11,847 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 06:09:11,848 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 06:09:11,853 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:09:11" (1/1) ... [2022-01-10 06:09:11,879 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:09:11" (1/1) ... [2022-01-10 06:09:11,903 INFO L137 Inliner]: procedures = 130, calls = 33, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2022-01-10 06:09:11,904 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 06:09:11,905 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 06:09:11,905 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 06:09:11,905 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 06:09:11,910 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:11" (1/1) ... [2022-01-10 06:09:11,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:11" (1/1) ... [2022-01-10 06:09:11,925 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:11" (1/1) ... [2022-01-10 06:09:11,925 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:11" (1/1) ... [2022-01-10 06:09:11,930 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:11" (1/1) ... [2022-01-10 06:09:11,941 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:11" (1/1) ... [2022-01-10 06:09:11,942 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:11" (1/1) ... [2022-01-10 06:09:11,944 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 06:09:11,944 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 06:09:11,944 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 06:09:11,945 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 06:09:11,945 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:11" (1/1) ... [2022-01-10 06:09:11,956 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:09:11,964 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 06:09:11,974 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:09:11,994 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:09:12,005 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 06:09:12,005 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-01-10 06:09:12,005 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-01-10 06:09:12,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 06:09:12,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 06:09:12,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 06:09:12,005 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 06:09:12,006 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 06:09:12,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 06:09:12,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 06:09:12,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 06:09:12,006 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 06:09:12,006 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 06:09:12,006 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 06:09:12,076 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 06:09:12,077 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 06:09:12,278 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 06:09:12,281 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 06:09:12,281 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-10 06:09:12,283 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:09:12 BoogieIcfgContainer [2022-01-10 06:09:12,283 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 06:09:12,284 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 06:09:12,284 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 06:09:12,293 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 06:09:12,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:09:11" (1/3) ... [2022-01-10 06:09:12,293 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408dd398 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:09:12, skipping insertion in model container [2022-01-10 06:09:12,293 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:11" (2/3) ... [2022-01-10 06:09:12,294 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@408dd398 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:09:12, skipping insertion in model container [2022-01-10 06:09:12,294 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:09:12" (3/3) ... [2022-01-10 06:09:12,294 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_append_equal.i [2022-01-10 06:09:12,297 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 06:09:12,297 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 06:09:12,337 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 06:09:12,341 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:09:12,341 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 06:09:12,350 INFO L276 IsEmpty]: Start isEmpty. Operand has 31 states, 26 states have (on average 1.5) internal successors, (39), 27 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-01-10 06:09:12,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 06:09:12,352 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:12,353 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:09:12,353 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:12,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:12,356 INFO L85 PathProgramCache]: Analyzing trace with hash 2128592868, now seen corresponding path program 1 times [2022-01-10 06:09:12,375 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:12,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [838910936] [2022-01-10 06:09:12,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:12,376 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:12,376 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:12,377 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:09:12,380 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:09:12,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:12,473 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 06:09:12,477 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:12,515 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:09:12,516 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:09:12,516 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:12,516 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [838910936] [2022-01-10 06:09:12,517 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [838910936] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:09:12,517 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:09:12,517 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 06:09:12,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991488664] [2022-01-10 06:09:12,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:09:12,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 06:09:12,521 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:12,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 06:09:12,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:09:12,538 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.5) internal successors, (39), 27 states have internal predecessors, (39), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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:09:12,549 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:12,549 INFO L93 Difference]: Finished difference Result 56 states and 77 transitions. [2022-01-10 06:09:12,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 06:09:12,550 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:09:12,551 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:12,554 INFO L225 Difference]: With dead ends: 56 [2022-01-10 06:09:12,554 INFO L226 Difference]: Without dead ends: 25 [2022-01-10 06:09:12,556 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:09:12,560 INFO L933 BasicCegarLoop]: 38 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, 38 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:09:12,562 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:09:12,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-10 06:09:12,583 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-10 06:09:12,583 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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:09:12,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-01-10 06:09:12,585 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 17 [2022-01-10 06:09:12,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:12,585 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-01-10 06:09:12,585 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:09:12,585 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-01-10 06:09:12,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 06:09:12,586 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:12,586 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:09:12,593 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:09:12,799 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:09:12,799 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:12,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:12,800 INFO L85 PathProgramCache]: Analyzing trace with hash -1341887012, now seen corresponding path program 1 times [2022-01-10 06:09:12,800 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:12,800 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [351811551] [2022-01-10 06:09:12,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:12,801 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:12,801 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:12,802 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:09:12,803 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:09:12,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:12,872 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:09:12,874 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:12,913 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:09:12,913 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:09:12,913 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:12,913 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [351811551] [2022-01-10 06:09:12,914 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [351811551] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:09:12,914 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:09:12,914 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:09:12,914 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655238844] [2022-01-10 06:09:12,914 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:09:12,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:09:12,915 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:12,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:09:12,915 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:09:12,916 INFO L87 Difference]: Start difference. First operand 25 states and 30 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:09:12,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:12,924 INFO L93 Difference]: Finished difference Result 48 states and 58 transitions. [2022-01-10 06:09:12,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:09:12,924 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:09:12,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:12,925 INFO L225 Difference]: With dead ends: 48 [2022-01-10 06:09:12,925 INFO L226 Difference]: Without dead ends: 29 [2022-01-10 06:09:12,925 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:09:12,926 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 2 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 55 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:09:12,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 55 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:09:12,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-10 06:09:12,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 26. [2022-01-10 06:09:12,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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:09:12,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2022-01-10 06:09:12,931 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 17 [2022-01-10 06:09:12,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:12,931 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2022-01-10 06:09:12,931 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:09:12,931 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2022-01-10 06:09:12,932 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 06:09:12,932 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:12,932 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] [2022-01-10 06:09:12,941 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:09:13,139 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:09:13,139 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:13,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:13,140 INFO L85 PathProgramCache]: Analyzing trace with hash 2097266908, now seen corresponding path program 1 times [2022-01-10 06:09:13,141 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:13,141 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1485221089] [2022-01-10 06:09:13,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:13,142 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:13,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:13,143 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:09:13,145 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:09:13,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:13,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 06:09:13,259 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:13,309 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:09:13,310 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:13,388 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:09:13,389 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:13,389 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1485221089] [2022-01-10 06:09:13,389 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1485221089] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:09:13,390 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:09:13,390 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-10 06:09:13,398 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [899303576] [2022-01-10 06:09:13,399 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:09:13,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 06:09:13,400 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:13,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 06:09:13,402 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:09:13,402 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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:09:13,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:13,436 INFO L93 Difference]: Finished difference Result 52 states and 63 transitions. [2022-01-10 06:09:13,436 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:09:13,437 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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 26 [2022-01-10 06:09:13,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:13,438 INFO L225 Difference]: With dead ends: 52 [2022-01-10 06:09:13,438 INFO L226 Difference]: Without dead ends: 33 [2022-01-10 06:09:13,439 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 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:09:13,441 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 7 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:13,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 84 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:09:13,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-10 06:09:13,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2022-01-10 06:09:13,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 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:09:13,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-01-10 06:09:13,452 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 26 [2022-01-10 06:09:13,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:13,452 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-01-10 06:09:13,452 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.5) internal successors, (27), 6 states have internal predecessors, (27), 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:09:13,452 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-01-10 06:09:13,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 06:09:13,453 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:13,454 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] [2022-01-10 06:09:13,464 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:09:13,662 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:09:13,662 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:13,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:13,663 INFO L85 PathProgramCache]: Analyzing trace with hash -867054116, now seen corresponding path program 2 times [2022-01-10 06:09:13,663 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:13,663 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1899655551] [2022-01-10 06:09:13,663 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:09:13,663 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:13,664 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:13,664 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:09:13,666 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:09:13,739 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 06:09:13,739 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:09:13,742 INFO L263 TraceCheckSpWp]: Trace formula consists of 102 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-10 06:09:13,746 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:13,913 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 06:09:13,940 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:09:13,954 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 06:09:13,954 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:09:13,954 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:13,954 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1899655551] [2022-01-10 06:09:13,956 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1899655551] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:09:13,956 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:09:13,956 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-10 06:09:13,959 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786135512] [2022-01-10 06:09:13,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:09:13,961 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-10 06:09:13,961 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:13,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-10 06:09:13,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-01-10 06:09:13,962 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 1 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:09:14,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:14,123 INFO L93 Difference]: Finished difference Result 43 states and 50 transitions. [2022-01-10 06:09:14,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-01-10 06:09:14,124 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 1 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 35 [2022-01-10 06:09:14,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:14,125 INFO L225 Difference]: With dead ends: 43 [2022-01-10 06:09:14,125 INFO L226 Difference]: Without dead ends: 40 [2022-01-10 06:09:14,125 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=99, Unknown=0, NotChecked=0, Total=132 [2022-01-10 06:09:14,126 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 64 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:14,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 117 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 06:09:14,126 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-10 06:09:14,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 32. [2022-01-10 06:09:14,130 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 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:09:14,130 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-01-10 06:09:14,130 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 35 [2022-01-10 06:09:14,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:14,131 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-01-10 06:09:14,131 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 2 states have call successors, (2), 1 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:09:14,131 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-01-10 06:09:14,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 06:09:14,132 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:14,132 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] [2022-01-10 06:09:14,144 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:09:14,339 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:09:14,339 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:14,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:14,342 INFO L85 PathProgramCache]: Analyzing trace with hash -867052442, now seen corresponding path program 1 times [2022-01-10 06:09:14,342 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:14,342 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1263553423] [2022-01-10 06:09:14,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:14,346 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:14,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:14,351 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:09:14,352 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:09:14,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:14,563 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 19 conjunts are in the unsatisfiable core [2022-01-10 06:09:14,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:14,699 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 06:09:14,800 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:09:15,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:15,017 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:09:15,086 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:09:15,107 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 06:09:15,107 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:15,225 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:15,225 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1263553423] [2022-01-10 06:09:15,225 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1263553423] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:09:15,226 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1750051003] [2022-01-10 06:09:15,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:15,226 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 06:09:15,226 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 06:09:15,227 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:09:15,228 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:09:15,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:15,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 214 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-10 06:09:15,530 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:15,948 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:09:16,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:16,036 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:09:16,099 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:09:16,108 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 06:09:16,108 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:16,203 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1750051003] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:09:16,203 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:09:16,203 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2022-01-10 06:09:16,204 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [597928895] [2022-01-10 06:09:16,204 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:09:16,204 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-10 06:09:16,204 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:16,204 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-10 06:09:16,205 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=418, Unknown=8, NotChecked=0, Total=506 [2022-01-10 06:09:16,205 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 21 states, 19 states have (on average 2.0) internal successors, (38), 16 states have internal predecessors, (38), 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:09:16,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:16,533 INFO L93 Difference]: Finished difference Result 37 states and 44 transitions. [2022-01-10 06:09:16,534 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 06:09:16,534 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 19 states have (on average 2.0) internal successors, (38), 16 states have internal predecessors, (38), 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 35 [2022-01-10 06:09:16,534 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:16,534 INFO L225 Difference]: With dead ends: 37 [2022-01-10 06:09:16,534 INFO L226 Difference]: Without dead ends: 30 [2022-01-10 06:09:16,535 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=115, Invalid=576, Unknown=11, NotChecked=0, Total=702 [2022-01-10 06:09:16,535 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 12 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 33 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:16,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 214 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 132 Invalid, 0 Unknown, 33 Unchecked, 0.2s Time] [2022-01-10 06:09:16,536 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-10 06:09:16,538 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-01-10 06:09:16,538 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.16) internal successors, (29), 25 states have internal predecessors, (29), 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:09:16,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-01-10 06:09:16,539 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 35 [2022-01-10 06:09:16,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:16,539 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-01-10 06:09:16,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 19 states have (on average 2.0) internal successors, (38), 16 states have internal predecessors, (38), 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:09:16,539 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-01-10 06:09:16,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 06:09:16,540 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:16,540 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] [2022-01-10 06:09:16,546 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:09:16,750 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-01-10 06:09:16,941 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:09:16,941 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:16,941 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:16,941 INFO L85 PathProgramCache]: Analyzing trace with hash 1386356248, now seen corresponding path program 1 times [2022-01-10 06:09:16,942 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:16,942 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [589390886] [2022-01-10 06:09:16,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:16,942 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:16,942 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:16,951 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:09:16,952 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:09:17,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:17,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 42 conjunts are in the unsatisfiable core [2022-01-10 06:09:17,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:17,592 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:09:18,050 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:09:18,050 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 27 treesize of output 30 [2022-01-10 06:09:18,061 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 26 treesize of output 18 [2022-01-10 06:09:18,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:18,516 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-01-10 06:09:18,516 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 33 treesize of output 43 [2022-01-10 06:09:18,549 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:18,551 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 26 treesize of output 26 [2022-01-10 06:09:18,639 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 12 treesize of output 4 [2022-01-10 06:09:18,882 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 46 treesize of output 34 [2022-01-10 06:09:19,281 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 06:09:19,281 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 32 [2022-01-10 06:09:19,392 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 23 treesize of output 11 [2022-01-10 06:09:19,460 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 12 proven. 8 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:09:19,460 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:19,546 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_318 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (_ bv0 64) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_318) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-01-10 06:09:20,035 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_19| (_ BitVec 64)) (v_ArrVal_318 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_324 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_323 (Array (_ BitVec 64) (_ BitVec 64)))) (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_19| v_ArrVal_324))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (or (not (bvult |v_node_create_~temp~0#1.base_19| |c_#StackHeapBarrier|)) (not (= (_ bv0 64) (select (select (store .cse0 .cse1 v_ArrVal_318) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (not (= (_ bv0 64) (select (select .cse0 .cse1) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_19| v_ArrVal_323) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 64))))))))) is different from false [2022-01-10 06:09:20,040 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:20,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [589390886] [2022-01-10 06:09:20,041 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [589390886] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:09:20,041 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1361143121] [2022-01-10 06:09:20,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:20,041 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 06:09:20,041 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 06:09:20,052 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:09:20,084 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:09:20,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:20,413 INFO L263 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 23 conjunts are in the unsatisfiable core [2022-01-10 06:09:20,416 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:21,371 INFO L353 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-01-10 06:09:21,372 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 49 treesize of output 49 [2022-01-10 06:09:21,400 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 06:09:21,400 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 20 treesize of output 26 [2022-01-10 06:09:21,446 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-01-10 06:09:21,666 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:09:21,667 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 40 treesize of output 39 [2022-01-10 06:09:21,670 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 46 treesize of output 38 [2022-01-10 06:09:21,792 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 13 trivial. 0 not checked. [2022-01-10 06:09:21,793 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:09:21,793 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1361143121] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:09:21,793 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 06:09:21,793 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [23] total 32 [2022-01-10 06:09:21,793 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [212991672] [2022-01-10 06:09:21,793 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:09:21,793 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-10 06:09:21,794 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:21,794 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-10 06:09:21,794 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1209, Unknown=3, NotChecked=142, Total=1482 [2022-01-10 06:09:21,795 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 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:09:22,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:22,136 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2022-01-10 06:09:22,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 06:09:22,137 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 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 38 [2022-01-10 06:09:22,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:22,138 INFO L225 Difference]: With dead ends: 40 [2022-01-10 06:09:22,138 INFO L226 Difference]: Without dead ends: 37 [2022-01-10 06:09:22,139 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 485 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=142, Invalid=1423, Unknown=3, NotChecked=154, Total=1722 [2022-01-10 06:09:22,139 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 18 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 125 SdHoareTripleChecker+Invalid, 95 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 13 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:22,140 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 125 Invalid, 95 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 72 Invalid, 0 Unknown, 13 Unchecked, 0.2s Time] [2022-01-10 06:09:22,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-10 06:09:22,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 35. [2022-01-10 06:09:22,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 35 states, 30 states have (on average 1.1666666666666667) internal successors, (35), 30 states have internal predecessors, (35), 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:09:22,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2022-01-10 06:09:22,144 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 38 [2022-01-10 06:09:22,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:22,144 INFO L470 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2022-01-10 06:09:22,144 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.5) internal successors, (25), 10 states have internal predecessors, (25), 2 states have call successors, (2), 1 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:09:22,144 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2022-01-10 06:09:22,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 06:09:22,145 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:22,145 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] [2022-01-10 06:09:22,152 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:09:22,364 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-01-10 06:09:22,557 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:09:22,558 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:22,559 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:22,559 INFO L85 PathProgramCache]: Analyzing trace with hash 1386357922, now seen corresponding path program 1 times [2022-01-10 06:09:22,559 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:22,559 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1649362643] [2022-01-10 06:09:22,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:22,560 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:22,560 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:22,561 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:09:22,562 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:09:22,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:22,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 43 conjunts are in the unsatisfiable core [2022-01-10 06:09:22,839 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:22,972 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:09:23,098 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 06:09:23,354 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:09:23,355 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 30 treesize of output 33 [2022-01-10 06:09:23,362 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 26 treesize of output 18 [2022-01-10 06:09:23,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-01-10 06:09:23,617 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:23,638 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 06:09:23,638 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 36 treesize of output 42 [2022-01-10 06:09:23,658 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-10 06:09:23,658 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-01-10 06:09:23,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:23,679 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 32 treesize of output 32 [2022-01-10 06:09:23,843 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 33 treesize of output 21 [2022-01-10 06:09:24,010 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:09:24,010 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 32 treesize of output 27 [2022-01-10 06:09:24,055 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 5 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:09:24,056 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:24,315 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_449 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_450 (Array (_ BitVec 64) (_ BitVec 64))) (|v_node_create_~temp~0#1.base_22| (_ BitVec 64))) (or (not (bvult |v_node_create_~temp~0#1.base_22| |c_#StackHeapBarrier|)) (not (= (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_22| v_ArrVal_449))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (bvadd (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_22| v_ArrVal_450) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 64))) (_ bv0 64))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_22|) (_ bv0 1))))) is different from false [2022-01-10 06:09:24,319 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:24,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1649362643] [2022-01-10 06:09:24,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1649362643] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:09:24,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [361668027] [2022-01-10 06:09:24,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:24,319 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 06:09:24,320 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 06:09:24,321 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:09:24,323 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:09:24,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:24,686 INFO L263 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 59 conjunts are in the unsatisfiable core [2022-01-10 06:09:24,690 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:24,883 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:09:25,011 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 11 treesize of output 7 [2022-01-10 06:09:25,283 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:25,284 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 21 treesize of output 20 [2022-01-10 06:09:25,797 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-01-10 06:09:25,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-01-10 06:09:25,808 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:09:25,812 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:09:26,258 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:26,259 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 36 treesize of output 34 [2022-01-10 06:09:26,274 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:26,276 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 18 treesize of output 20 [2022-01-10 06:09:26,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:26,301 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:09:26,323 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-10 06:09:26,323 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 17 treesize of output 17 [2022-01-10 06:09:26,975 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 06:09:26,976 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 72 treesize of output 65 [2022-01-10 06:09:26,986 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:26,987 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 37 treesize of output 32 [2022-01-10 06:09:27,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:27,013 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:09:27,203 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 34 treesize of output 18 [2022-01-10 06:09:27,210 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:09:27,407 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:09:27,474 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 10 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 06:09:27,474 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:27,707 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_518 (_ BitVec 32)) (v_ArrVal_517 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_516 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 64) |c_ULTIMATE.start_sll_append_~last~0#1.offset|) v_ArrVal_518)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_516) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_517) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-01-10 06:09:28,174 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_518 (_ BitVec 32)) (v_ArrVal_529 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_528 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_517 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_516 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_527 (Array (_ BitVec 64) (_ BitVec 32))) (|v_node_create_~temp~0#1.base_25| (_ BitVec 64))) (or (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_25| v_ArrVal_528))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_25| v_ArrVal_529)) (.cse1 (select (select .cse3 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (select (select (let ((.cse0 (store |c_#memory_int| |v_node_create_~temp~0#1.base_25| v_ArrVal_527))) (store .cse0 .cse1 (store (select .cse0 .cse1) (bvadd (select (select .cse2 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 64)) v_ArrVal_518))) (select (select (store .cse3 .cse1 v_ArrVal_516) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store .cse2 .cse1 v_ArrVal_517) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_25|))) (not (bvult |v_node_create_~temp~0#1.base_25| |c_#StackHeapBarrier|)))) is different from false [2022-01-10 06:09:28,183 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [361668027] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:09:28,183 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:09:28,183 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 35 [2022-01-10 06:09:28,183 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1100893769] [2022-01-10 06:09:28,183 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:09:28,184 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-10 06:09:28,184 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:28,184 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-10 06:09:28,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1499, Unknown=15, NotChecked=240, Total=1892 [2022-01-10 06:09:28,185 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand has 35 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 30 states have internal predecessors, (61), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-10 06:09:31,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:31,029 INFO L93 Difference]: Finished difference Result 46 states and 53 transitions. [2022-01-10 06:09:31,030 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-10 06:09:31,030 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 30 states have internal predecessors, (61), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 38 [2022-01-10 06:09:31,031 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:31,032 INFO L225 Difference]: With dead ends: 46 [2022-01-10 06:09:31,032 INFO L226 Difference]: Without dead ends: 38 [2022-01-10 06:09:31,034 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 48 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 4.8s TimeCoverageRelationStatistics Valid=264, Invalid=2589, Unknown=21, NotChecked=318, Total=3192 [2022-01-10 06:09:31,034 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 19 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 393 SdHoareTripleChecker+Invalid, 411 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:31,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 393 Invalid, 411 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 319 Invalid, 0 Unknown, 84 Unchecked, 0.7s Time] [2022-01-10 06:09:31,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-10 06:09:31,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 37. [2022-01-10 06:09:31,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 31 states have (on average 1.1290322580645162) internal successors, (35), 31 states have internal predecessors, (35), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:09:31,040 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2022-01-10 06:09:31,040 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 38 [2022-01-10 06:09:31,040 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:31,041 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2022-01-10 06:09:31,041 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 1.8484848484848484) internal successors, (61), 30 states have internal predecessors, (61), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2022-01-10 06:09:31,041 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2022-01-10 06:09:31,041 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 06:09:31,041 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:31,042 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] [2022-01-10 06:09:31,050 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:09:31,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-01-10 06:09:31,464 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:09:31,465 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:31,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:31,465 INFO L85 PathProgramCache]: Analyzing trace with hash 403579891, now seen corresponding path program 1 times [2022-01-10 06:09:31,466 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:31,466 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1288057154] [2022-01-10 06:09:31,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:31,466 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:31,466 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:31,467 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:09:31,469 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:09:31,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:31,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 27 conjunts are in the unsatisfiable core [2022-01-10 06:09:31,781 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:31,905 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 06:09:32,026 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:09:32,216 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 06:09:32,217 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 21 [2022-01-10 06:09:32,221 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 6 treesize of output 4 [2022-01-10 06:09:32,584 INFO L353 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-01-10 06:09:32,585 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 22 treesize of output 31 [2022-01-10 06:09:32,780 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:09:32,780 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 29 [2022-01-10 06:09:32,818 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 18 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-01-10 06:09:32,818 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:09:32,818 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:32,819 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1288057154] [2022-01-10 06:09:32,819 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1288057154] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:09:32,819 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:09:32,819 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2022-01-10 06:09:32,819 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [297751277] [2022-01-10 06:09:32,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:09:32,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-01-10 06:09:32,820 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:32,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-01-10 06:09:32,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=224, Unknown=0, NotChecked=0, Total=272 [2022-01-10 06:09:32,820 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand has 17 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 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:09:33,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:33,052 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-01-10 06:09:33,053 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 06:09:33,053 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 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:09:33,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:33,057 INFO L225 Difference]: With dead ends: 44 [2022-01-10 06:09:33,057 INFO L226 Difference]: Without dead ends: 41 [2022-01-10 06:09:33,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 79 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=68, Invalid=312, Unknown=0, NotChecked=0, Total=380 [2022-01-10 06:09:33,058 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 13 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 45 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:33,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 137 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 78 Invalid, 0 Unknown, 45 Unchecked, 0.1s Time] [2022-01-10 06:09:33,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-10 06:09:33,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 38. [2022-01-10 06:09:33,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 32 states have (on average 1.125) internal successors, (36), 32 states have internal predecessors, (36), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:09:33,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 42 transitions. [2022-01-10 06:09:33,075 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 42 transitions. Word has length 40 [2022-01-10 06:09:33,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:33,076 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 42 transitions. [2022-01-10 06:09:33,076 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.0) internal successors, (32), 14 states have internal predecessors, (32), 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:09:33,076 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 42 transitions. [2022-01-10 06:09:33,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 06:09:33,078 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:33,078 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] [2022-01-10 06:09:33,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-01-10 06:09:33,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:33,291 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:33,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:33,292 INFO L85 PathProgramCache]: Analyzing trace with hash 403581565, now seen corresponding path program 1 times [2022-01-10 06:09:33,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:33,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [662296993] [2022-01-10 06:09:33,303 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:33,304 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:33,304 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:33,308 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:33,310 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-01-10 06:09:33,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:33,679 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 72 conjunts are in the unsatisfiable core [2022-01-10 06:09:33,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:33,696 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:09:33,755 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:09:33,860 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-01-10 06:09:33,860 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:09:33,989 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 12 treesize of output 8 [2022-01-10 06:09:34,054 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 11 treesize of output 7 [2022-01-10 06:09:34,179 INFO L353 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-01-10 06:09:34,179 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 23 treesize of output 40 [2022-01-10 06:09:34,293 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:09:34,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:34,331 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 21 treesize of output 20 [2022-01-10 06:09:34,887 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-01-10 06:09:34,887 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 95 treesize of output 40 [2022-01-10 06:09:34,902 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 19 treesize of output 11 [2022-01-10 06:09:34,918 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 21 treesize of output 15 [2022-01-10 06:09:34,925 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:09:35,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:35,383 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 06:09:35,383 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 101 treesize of output 89 [2022-01-10 06:09:35,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:35,405 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 22 treesize of output 24 [2022-01-10 06:09:35,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:35,416 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 91 treesize of output 85 [2022-01-10 06:09:35,442 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:35,473 INFO L353 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-01-10 06:09:35,473 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 44 [2022-01-10 06:09:36,819 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-01-10 06:09:36,820 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 150 treesize of output 123 [2022-01-10 06:09:36,847 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 06:09:36,848 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 121 treesize of output 114 [2022-01-10 06:09:36,867 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 36 treesize of output 38 [2022-01-10 06:09:37,125 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-01-10 06:09:37,126 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 97 treesize of output 38 [2022-01-10 06:09:37,134 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 26 treesize of output 14 [2022-01-10 06:09:37,308 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:09:37,391 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 8 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:09:37,392 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:37,579 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_661 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_659 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_660 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_659) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_661) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_660) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-01-10 06:09:37,605 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_661 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_659 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_660 (Array (_ BitVec 64) (_ BitVec 64)))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 64) |c_ULTIMATE.start_sll_append_~last~0#1.offset|)))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_659) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_661) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_660) |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:09:37,629 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_661 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_659 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_660 (Array (_ BitVec 64) (_ BitVec 64)))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 64))))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_659) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_661) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_660) |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:09:37,790 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_node_create_~temp~0#1.base_28| (_ BitVec 64)) (v_ArrVal_659 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_661 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_671 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_660 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_670 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_669 (Array (_ BitVec 64) (_ BitVec 32)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_28|))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_28| v_ArrVal_670)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_28| v_ArrVal_671))) (let ((.cse0 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (bvadd (_ bv4 64) (select (select .cse2 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))))) (select (select (store (store |c_#memory_int| |v_node_create_~temp~0#1.base_28| v_ArrVal_669) .cse0 v_ArrVal_659) (select (select (store .cse1 .cse0 v_ArrVal_661) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store .cse2 .cse0 v_ArrVal_660) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) (not (bvult |v_node_create_~temp~0#1.base_28| |c_#StackHeapBarrier|)))) is different from false [2022-01-10 06:09:37,797 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:37,797 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [662296993] [2022-01-10 06:09:37,798 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [662296993] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:09:37,798 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1230963339] [2022-01-10 06:09:37,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:37,798 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 06:09:37,798 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 06:09:37,800 INFO L229 MonitoredProcess]: Starting monitored process 14 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:09:37,801 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Waiting until timeout for monitored process [2022-01-10 06:09:38,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:38,275 INFO L263 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 74 conjunts are in the unsatisfiable core [2022-01-10 06:09:38,278 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:38,426 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:09:38,956 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 5 [2022-01-10 06:09:39,180 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 11 treesize of output 7 [2022-01-10 06:09:39,347 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-01-10 06:09:39,347 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 19 treesize of output 26 [2022-01-10 06:09:39,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-01-10 06:09:39,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:39,559 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 21 treesize of output 20 [2022-01-10 06:09:40,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:40,326 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:09:40,326 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 82 treesize of output 31 [2022-01-10 06:09:40,356 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 14 treesize of output 10 [2022-01-10 06:09:40,363 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:09:40,369 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:09:40,784 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:40,809 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 06:09:40,809 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 88 treesize of output 78 [2022-01-10 06:09:40,822 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:40,823 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 18 treesize of output 20 [2022-01-10 06:09:40,845 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:40,846 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 75 treesize of output 71 [2022-01-10 06:09:40,882 INFO L353 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-01-10 06:09:40,883 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 39 [2022-01-10 06:09:42,603 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-01-10 06:09:42,603 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 137 treesize of output 112 [2022-01-10 06:09:42,643 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 06:09:42,643 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 105 treesize of output 100 [2022-01-10 06:09:42,665 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 32 treesize of output 34 [2022-01-10 06:09:43,078 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:43,081 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:09:43,081 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 84 treesize of output 29 [2022-01-10 06:09:43,091 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:09:43,247 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:09:43,251 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:09:43,251 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:43,269 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_743 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_741 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_740 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_743) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_741) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_740) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-01-10 06:09:43,292 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_743 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_741 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_740 (Array (_ BitVec 64) (_ BitVec 64)))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 64) |c_ULTIMATE.start_sll_append_~last~0#1.offset|)))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_743) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_741) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_740) |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:09:43,316 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_743 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_741 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_740 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 64))))) (select (select (store |c_#memory_int| .cse0 v_ArrVal_743) (select (select (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_741) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_740) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))) is different from false [2022-01-10 06:09:43,476 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_751 (Array (_ BitVec 64) (_ BitVec 32))) (|v_ULTIMATE.start_sll_append_#t~ret7#1.base_34| (_ BitVec 64)) (v_ArrVal_753 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_743 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_752 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_741 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_740 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_34|) (_ bv0 1))) (not (bvult |v_ULTIMATE.start_sll_append_#t~ret7#1.base_34| |c_#StackHeapBarrier|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_34| v_ArrVal_753)) (.cse2 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_34| v_ArrVal_752))) (let ((.cse0 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (bvadd (select (select .cse2 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 64))))) (select (select (store (store |c_#memory_int| |v_ULTIMATE.start_sll_append_#t~ret7#1.base_34| v_ArrVal_751) .cse0 v_ArrVal_743) (select (select (store .cse1 .cse0 v_ArrVal_741) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store .cse2 .cse0 v_ArrVal_740) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-01-10 06:09:43,484 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1230963339] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:09:43,485 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:09:43,485 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 25] total 43 [2022-01-10 06:09:43,485 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337230735] [2022-01-10 06:09:43,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:09:43,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2022-01-10 06:09:43,485 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:43,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2022-01-10 06:09:43,486 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=170, Invalid=1916, Unknown=16, NotChecked=760, Total=2862 [2022-01-10 06:09:43,486 INFO L87 Difference]: Start difference. First operand 38 states and 42 transitions. Second operand has 43 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 33 states have internal predecessors, (63), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 06:09:47,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:47,694 INFO L93 Difference]: Finished difference Result 47 states and 53 transitions. [2022-01-10 06:09:47,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 06:09:47,695 INFO L78 Accepts]: Start accepts. Automaton has has 43 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 33 states have internal predecessors, (63), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 40 [2022-01-10 06:09:47,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:47,695 INFO L225 Difference]: With dead ends: 47 [2022-01-10 06:09:47,695 INFO L226 Difference]: Without dead ends: 45 [2022-01-10 06:09:47,696 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 67 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 749 ImplicationChecksByTransitivity, 8.7s TimeCoverageRelationStatistics Valid=312, Invalid=3363, Unknown=17, NotChecked=1000, Total=4692 [2022-01-10 06:09:47,696 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 30 mSDsluCounter, 253 mSDsCounter, 0 mSdLazyCounter, 291 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 385 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 291 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 82 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:47,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 271 Invalid, 385 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 291 Invalid, 0 Unknown, 82 Unchecked, 0.6s Time] [2022-01-10 06:09:47,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-10 06:09:47,701 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2022-01-10 06:09:47,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 38 states have (on average 1.131578947368421) internal successors, (43), 38 states have internal predecessors, (43), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:09:47,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2022-01-10 06:09:47,701 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 40 [2022-01-10 06:09:47,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:47,702 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2022-01-10 06:09:47,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 41 states have (on average 1.5365853658536586) internal successors, (63), 33 states have internal predecessors, (63), 6 states have call successors, (6), 5 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2022-01-10 06:09:47,702 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-01-10 06:09:47,702 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-10 06:09:47,702 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:47,702 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:09:47,707 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (14)] Forceful destruction successful, exit code 0 [2022-01-10 06:09:47,918 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-01-10 06:09:48,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:48,106 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:48,106 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:48,106 INFO L85 PathProgramCache]: Analyzing trace with hash 1294860110, now seen corresponding path program 1 times [2022-01-10 06:09:48,107 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:48,107 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1888553553] [2022-01-10 06:09:48,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:48,107 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:48,107 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:48,108 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:48,110 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-01-10 06:09:48,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:48,505 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 59 conjunts are in the unsatisfiable core [2022-01-10 06:09:48,509 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:48,524 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:09:48,549 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:09:48,723 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-01-10 06:09:48,723 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:09:48,885 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 13 treesize of output 9 [2022-01-10 06:09:49,041 INFO L353 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-01-10 06:09:49,042 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 2 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:09:49,150 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 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:09:49,668 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-01-10 06:09:49,669 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 97 treesize of output 32 [2022-01-10 06:09:49,682 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:09:49,689 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 4 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:09:49,949 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:49,984 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 06:09:49,984 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 103 treesize of output 87 [2022-01-10 06:09:49,994 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:49,995 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 93 treesize of output 87 [2022-01-10 06:09:50,023 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:50,056 INFO L353 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-01-10 06:09:50,057 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 2 case distinctions, treesize of input 43 treesize of output 43 [2022-01-10 06:09:51,414 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-01-10 06:09:51,415 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 133 treesize of output 108 [2022-01-10 06:09:51,450 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 06:09:51,450 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 104 treesize of output 99 [2022-01-10 06:09:51,710 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 91 treesize of output 67 [2022-01-10 06:09:52,123 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-10 06:09:52,124 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 80 treesize of output 31 [2022-01-10 06:09:52,384 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:09:52,384 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:52,600 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_818 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_817 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (_ bv0 64) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_818))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 64) (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_817) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-01-10 06:09:52,633 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_818 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_817 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (_ bv0 64) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base|) (bvadd (_ bv4 64) |c_ULTIMATE.start_sll_append_~last~0#1.offset|)))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_818))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (bvadd (_ bv4 64) (select (select (store |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_817) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-01-10 06:09:52,663 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_818 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_817 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (_ bv0 64) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (bvadd (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 64))))) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| .cse1 v_ArrVal_818))) (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 |c_#memory_$Pointer$.offset| .cse1 v_ArrVal_817) |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:09:52,821 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_823 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_824 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_818 (Array (_ BitVec 64) (_ BitVec 64))) (|v_node_create_~temp~0#1.base_34| (_ BitVec 64)) (v_ArrVal_817 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (bvult |v_node_create_~temp~0#1.base_34| |c_#StackHeapBarrier|)) (not (= (_ bv0 64) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_34| v_ArrVal_823)) (.cse3 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_34| v_ArrVal_824))) (let ((.cse2 (select (select .cse1 (select (select .cse1 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|)) (bvadd (_ bv4 64) (select (select .cse3 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_818))) (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 .cse3 .cse2 v_ArrVal_817) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv4 64))))))) (not (= (bvneg (select |c_#valid| |v_node_create_~temp~0#1.base_34|)) (_ bv0 1))))) is different from false [2022-01-10 06:09:52,830 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:52,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1888553553] [2022-01-10 06:09:52,831 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1888553553] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:09:52,831 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2095512800] [2022-01-10 06:09:52,831 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:52,831 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 06:09:52,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 06:09:52,832 INFO L229 MonitoredProcess]: Starting monitored process 16 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:09:52,856 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (16)] Waiting until timeout for monitored process [2022-01-10 06:09:53,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:53,400 INFO L263 TraceCheckSpWp]: Trace formula consists of 230 conjuncts, 66 conjunts are in the unsatisfiable core [2022-01-10 06:09:53,404 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:53,562 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:09:54,340 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-01-10 06:09:54,340 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 19 treesize of output 26 [2022-01-10 06:09:54,535 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:09:55,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:55,333 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:09:55,333 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 86 treesize of output 31 [2022-01-10 06:09:55,340 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:09:55,346 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 13 treesize of output 9 [2022-01-10 06:09:55,997 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:56,023 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 06:09:56,024 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 92 treesize of output 80 [2022-01-10 06:09:56,049 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:56,051 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 75 treesize of output 71 [2022-01-10 06:09:56,098 INFO L353 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-01-10 06:09:56,099 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 36 treesize of output 38 [2022-01-10 06:09:59,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:59,778 INFO L353 Elim1Store]: treesize reduction 97, result has 24.8 percent of original size [2022-01-10 06:09:59,779 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 187 treesize of output 86 [2022-01-10 06:09:59,846 INFO L353 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-01-10 06:09:59,847 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 132 treesize of output 100 [2022-01-10 06:10:00,758 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:10:01,408 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:10:01,408 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 75 treesize of output 30 [2022-01-10 06:10:01,771 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 13 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:10:01,772 INFO L328 TraceCheckSpWp]: Computing backward predicates...