/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_unequal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 06:09:32,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 06:09:32,159 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 06:09:32,266 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 06:09:32,267 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 06:09:32,267 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 06:09:32,268 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 06:09:32,269 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 06:09:32,271 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 06:09:32,272 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 06:09:32,273 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 06:09:32,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 06:09:32,273 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 06:09:32,288 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 06:09:32,289 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 06:09:32,289 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 06:09:32,290 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 06:09:32,290 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 06:09:32,291 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 06:09:32,293 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 06:09:32,293 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 06:09:32,294 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 06:09:32,295 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 06:09:32,296 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 06:09:32,297 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 06:09:32,297 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 06:09:32,298 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 06:09:32,298 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 06:09:32,298 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 06:09:32,299 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 06:09:32,299 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 06:09:32,300 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 06:09:32,300 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 06:09:32,301 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 06:09:32,301 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 06:09:32,301 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 06:09:32,302 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 06:09:32,302 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 06:09:32,302 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 06:09:32,302 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 06:09:32,303 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 06:09:32,304 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:32,335 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 06:09:32,335 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 06:09:32,336 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 06:09:32,336 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 06:09:32,336 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 06:09:32,337 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 06:09:32,337 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 06:09:32,337 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 06:09:32,337 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 06:09:32,337 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 06:09:32,337 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 06:09:32,337 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 06:09:32,338 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 06:09:32,338 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 06:09:32,338 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 06:09:32,338 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 06:09:32,338 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 06:09:32,338 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 06:09:32,338 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 06:09:32,338 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 06:09:32,338 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 06:09:32,338 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 06:09:32,339 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 06:09:32,339 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:09:32,339 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 06:09:32,355 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 06:09:32,355 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 06:09:32,355 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 06:09:32,356 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 06:09:32,356 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 06:09:32,356 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 06:09:32,356 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 06:09:32,356 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 06:09:32,356 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:32,550 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 06:09:32,572 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 06:09:32,574 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 06:09:32,575 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 06:09:32,575 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 06:09:32,576 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_append_unequal.i [2022-01-10 06:09:32,637 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921df7225/dc75baa9da7347e9b51b6bcfdf8da01b/FLAGc46222d01 [2022-01-10 06:09:33,011 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 06:09:33,012 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_append_unequal.i [2022-01-10 06:09:33,021 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921df7225/dc75baa9da7347e9b51b6bcfdf8da01b/FLAGc46222d01 [2022-01-10 06:09:33,380 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/921df7225/dc75baa9da7347e9b51b6bcfdf8da01b [2022-01-10 06:09:33,381 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 06:09:33,382 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 06:09:33,383 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 06:09:33,383 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 06:09:33,387 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 06:09:33,388 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:09:33" (1/1) ... [2022-01-10 06:09:33,390 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@305e1c4d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:33, skipping insertion in model container [2022-01-10 06:09:33,390 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:09:33" (1/1) ... [2022-01-10 06:09:33,394 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 06:09:33,418 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:09:33,667 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_unequal.i[24323,24336] [2022-01-10 06:09:33,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:09:33,681 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 06:09:33,721 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_unequal.i[24323,24336] [2022-01-10 06:09:33,723 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:09:33,750 INFO L208 MainTranslator]: Completed translation [2022-01-10 06:09:33,750 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:33 WrapperNode [2022-01-10 06:09:33,750 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 06:09:33,751 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 06:09:33,751 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 06:09:33,752 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 06:09:33,756 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:33" (1/1) ... [2022-01-10 06:09:33,772 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:33" (1/1) ... [2022-01-10 06:09:33,792 INFO L137 Inliner]: procedures = 130, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 135 [2022-01-10 06:09:33,792 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 06:09:33,793 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 06:09:33,793 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 06:09:33,793 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 06:09:33,799 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:33" (1/1) ... [2022-01-10 06:09:33,799 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:33" (1/1) ... [2022-01-10 06:09:33,814 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:33" (1/1) ... [2022-01-10 06:09:33,814 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:33" (1/1) ... [2022-01-10 06:09:33,820 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:33" (1/1) ... [2022-01-10 06:09:33,822 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:33" (1/1) ... [2022-01-10 06:09:33,824 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:33" (1/1) ... [2022-01-10 06:09:33,828 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 06:09:33,828 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 06:09:33,828 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 06:09:33,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 06:09:33,829 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:33" (1/1) ... [2022-01-10 06:09:33,836 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:09:33,851 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 06:09:33,863 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:33,878 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:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 06:09:33,904 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-01-10 06:09:33,904 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-01-10 06:09:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 06:09:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 06:09:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 06:09:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 06:09:33,905 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 06:09:33,907 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 06:09:33,907 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 06:09:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 06:09:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 06:09:33,908 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 06:09:33,908 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 06:09:34,077 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 06:09:34,079 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 06:09:34,294 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 06:09:34,299 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 06:09:34,301 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-10 06:09:34,302 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:09:34 BoogieIcfgContainer [2022-01-10 06:09:34,302 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 06:09:34,303 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 06:09:34,303 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 06:09:34,306 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 06:09:34,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:09:33" (1/3) ... [2022-01-10 06:09:34,307 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fea050c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:09:34, skipping insertion in model container [2022-01-10 06:09:34,307 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:33" (2/3) ... [2022-01-10 06:09:34,308 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4fea050c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:09:34, skipping insertion in model container [2022-01-10 06:09:34,308 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:09:34" (3/3) ... [2022-01-10 06:09:34,310 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_append_unequal.i [2022-01-10 06:09:34,314 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 06:09:34,314 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 06:09:34,355 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 06:09:34,364 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:34,364 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 06:09:34,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 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:34,383 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 06:09:34,384 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:34,384 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:34,385 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:34,389 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:34,389 INFO L85 PathProgramCache]: Analyzing trace with hash 1473722618, now seen corresponding path program 1 times [2022-01-10 06:09:34,399 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:34,399 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2076919115] [2022-01-10 06:09:34,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:34,400 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:34,400 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:34,411 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:34,451 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:34,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:34,552 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 06:09:34,557 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:34,610 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:34,611 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:09:34,611 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:34,612 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2076919115] [2022-01-10 06:09:34,612 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2076919115] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:09:34,613 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:09:34,613 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 06:09:34,614 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795157109] [2022-01-10 06:09:34,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:09:34,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 06:09:34,619 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:34,639 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 06:09:34,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:09:34,641 INFO L87 Difference]: Start difference. First operand has 35 states, 30 states have (on average 1.5) internal successors, (45), 31 states have internal predecessors, (45), 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:34,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:34,661 INFO L93 Difference]: Finished difference Result 64 states and 89 transitions. [2022-01-10 06:09:34,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 06:09:34,663 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:34,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:34,667 INFO L225 Difference]: With dead ends: 64 [2022-01-10 06:09:34,667 INFO L226 Difference]: Without dead ends: 29 [2022-01-10 06:09:34,669 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:34,672 INFO L933 BasicCegarLoop]: 44 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, 44 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:34,673 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 44 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:34,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-01-10 06:09:34,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-01-10 06:09:34,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.28) internal successors, (32), 25 states have internal predecessors, (32), 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:34,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2022-01-10 06:09:34,702 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 17 [2022-01-10 06:09:34,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:34,703 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2022-01-10 06:09:34,703 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:34,703 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2022-01-10 06:09:34,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 06:09:34,705 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:34,705 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:34,728 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:34,913 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:34,913 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:34,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:34,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1996757262, now seen corresponding path program 1 times [2022-01-10 06:09:34,915 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:34,915 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1734321225] [2022-01-10 06:09:34,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:34,915 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:34,915 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:34,931 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:34,943 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:35,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:35,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:09:35,076 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:35,151 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:35,152 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:09:35,152 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:35,152 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1734321225] [2022-01-10 06:09:35,152 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1734321225] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:09:35,152 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:09:35,153 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:09:35,153 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [611264274] [2022-01-10 06:09:35,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:09:35,154 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:09:35,154 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:35,154 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:09:35,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:09:35,155 INFO L87 Difference]: Start difference. First operand 29 states and 36 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:35,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:35,166 INFO L93 Difference]: Finished difference Result 56 states and 70 transitions. [2022-01-10 06:09:35,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:09:35,168 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:35,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:35,169 INFO L225 Difference]: With dead ends: 56 [2022-01-10 06:09:35,169 INFO L226 Difference]: Without dead ends: 33 [2022-01-10 06:09:35,169 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:35,170 INFO L933 BasicCegarLoop]: 35 mSDtfsCounter, 2 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 67 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:35,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 67 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:35,171 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-10 06:09:35,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2022-01-10 06:09:35,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 26 states have (on average 1.2692307692307692) internal successors, (33), 26 states have internal predecessors, (33), 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:35,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-01-10 06:09:35,179 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 17 [2022-01-10 06:09:35,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:35,179 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-01-10 06:09:35,180 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:35,180 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-01-10 06:09:35,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 06:09:35,182 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:35,182 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:35,190 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-01-10 06:09:35,389 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:35,392 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:35,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:35,393 INFO L85 PathProgramCache]: Analyzing trace with hash -1017886446, now seen corresponding path program 1 times [2022-01-10 06:09:35,393 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:35,393 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872563270] [2022-01-10 06:09:35,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:35,394 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:35,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:35,395 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:35,398 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:35,498 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:35,519 INFO L263 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 06:09:35,524 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:35,609 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:35,610 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:35,675 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:35,676 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:35,676 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872563270] [2022-01-10 06:09:35,676 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1872563270] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:09:35,677 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:09:35,677 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-10 06:09:35,679 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011333364] [2022-01-10 06:09:35,679 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:09:35,679 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 06:09:35,679 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:35,680 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 06:09:35,680 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:09:35,680 INFO L87 Difference]: Start difference. First operand 30 states and 37 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:35,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:35,728 INFO L93 Difference]: Finished difference Result 60 states and 75 transitions. [2022-01-10 06:09:35,728 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:09:35,729 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:35,729 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:35,730 INFO L225 Difference]: With dead ends: 60 [2022-01-10 06:09:35,730 INFO L226 Difference]: Without dead ends: 37 [2022-01-10 06:09:35,730 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:35,731 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 5 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:35,731 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 134 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:09:35,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-01-10 06:09:35,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 34. [2022-01-10 06:09:35,735 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2413793103448276) internal successors, (36), 29 states have internal predecessors, (36), 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:35,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 42 transitions. [2022-01-10 06:09:35,736 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 42 transitions. Word has length 26 [2022-01-10 06:09:35,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:35,736 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 42 transitions. [2022-01-10 06:09:35,736 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:35,736 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 42 transitions. [2022-01-10 06:09:35,737 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-10 06:09:35,737 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:35,737 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:35,762 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:35,938 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:35,938 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:35,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:35,939 INFO L85 PathProgramCache]: Analyzing trace with hash 1383615218, now seen corresponding path program 2 times [2022-01-10 06:09:35,939 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:35,939 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [641228469] [2022-01-10 06:09:35,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:09:35,939 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:35,940 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:35,940 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:35,942 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:36,163 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:09:36,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:09:36,174 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 18 conjunts are in the unsatisfiable core [2022-01-10 06:09:36,178 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:36,445 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:36,610 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:36,613 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:36,668 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:36,693 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:36,693 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:36,838 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:36,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [641228469] [2022-01-10 06:09:36,838 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [641228469] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:09:36,838 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2096047708] [2022-01-10 06:09:36,838 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:09:36,838 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 06:09:36,839 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 06:09:36,840 INFO L229 MonitoredProcess]: Starting monitored process 6 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:36,900 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Waiting until timeout for monitored process [2022-01-10 06:09:37,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-10 06:09:37,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:09:37,070 INFO L263 TraceCheckSpWp]: Trace formula consists of 215 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-10 06:09:37,074 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:37,662 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:37,798 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:37,800 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:37,894 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:37,905 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:37,905 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:38,051 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2096047708] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:09:38,051 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:09:38,051 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15] total 21 [2022-01-10 06:09:38,052 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1832848560] [2022-01-10 06:09:38,052 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:09:38,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2022-01-10 06:09:38,052 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:38,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2022-01-10 06:09:38,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=80, Invalid=418, Unknown=8, NotChecked=0, Total=506 [2022-01-10 06:09:38,053 INFO L87 Difference]: Start difference. First operand 34 states and 42 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:38,403 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:38,403 INFO L93 Difference]: Finished difference Result 44 states and 55 transitions. [2022-01-10 06:09:38,404 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-10 06:09:38,404 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:38,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:38,405 INFO L225 Difference]: With dead ends: 44 [2022-01-10 06:09:38,405 INFO L226 Difference]: Without dead ends: 34 [2022-01-10 06:09:38,406 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 57 SyntacticMatches, 4 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 193 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=115, Invalid=576, Unknown=11, NotChecked=0, Total=702 [2022-01-10 06:09:38,406 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 16 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 85 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 177 SdHoareTripleChecker+Invalid, 117 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 85 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 27 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:38,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 177 Invalid, 117 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 85 Invalid, 0 Unknown, 27 Unchecked, 0.2s Time] [2022-01-10 06:09:38,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-10 06:09:38,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-01-10 06:09:38,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 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:38,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 41 transitions. [2022-01-10 06:09:38,417 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 41 transitions. Word has length 35 [2022-01-10 06:09:38,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:38,417 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 41 transitions. [2022-01-10 06:09:38,418 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:38,418 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 41 transitions. [2022-01-10 06:09:38,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 06:09:38,418 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:38,419 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:38,433 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:38,636 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (6)] Forceful destruction successful, exit code 0 [2022-01-10 06:09:38,831 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-01-10 06:09:38,831 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:38,832 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:38,832 INFO L85 PathProgramCache]: Analyzing trace with hash 1699814766, now seen corresponding path program 1 times [2022-01-10 06:09:38,833 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:38,833 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [568308595] [2022-01-10 06:09:38,833 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:38,833 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:38,833 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:38,834 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:38,836 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-01-10 06:09:39,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:39,180 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 57 conjunts are in the unsatisfiable core [2022-01-10 06:09:39,188 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:39,404 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:39,576 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,938 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:39,942 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:09:39,942 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 30 treesize of output 15 [2022-01-10 06:09:39,954 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,240 INFO L353 Elim1Store]: treesize reduction 32, result has 31.9 percent of original size [2022-01-10 06:09:40,240 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 3 case distinctions, treesize of input 36 treesize of output 46 [2022-01-10 06:09:40,266 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 06:09:40,266 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 30 treesize of output 34 [2022-01-10 06:09:40,281 INFO L353 Elim1Store]: treesize reduction 4, result has 60.0 percent of original size [2022-01-10 06:09:40,282 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-01-10 06:09:40,292 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 20 treesize of output 16 [2022-01-10 06:09:40,331 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 23 treesize of output 19 [2022-01-10 06:09:40,399 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 17 treesize of output 13 [2022-01-10 06:09:41,096 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 9 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:09:41,096 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:41,178 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_261 (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| (store (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|) |c_ULTIMATE.start_sll_append_~new_last~0#1.base|)))) (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_261) |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:42,479 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:42,483 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [568308595] [2022-01-10 06:09:42,489 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [568308595] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:09:42,489 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1059570267] [2022-01-10 06:09:42,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:42,489 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 06:09:42,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 06:09:42,490 INFO L229 MonitoredProcess]: Starting monitored process 8 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:42,498 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Waiting until timeout for monitored process [2022-01-10 06:09:42,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:42,761 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-10 06:09:42,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:44,392 INFO L353 Elim1Store]: treesize reduction 55, result has 11.3 percent of original size [2022-01-10 06:09:44,393 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 68 treesize of output 44 [2022-01-10 06:09:44,448 INFO L353 Elim1Store]: treesize reduction 33, result has 17.5 percent of original size [2022-01-10 06:09:44,448 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 61 treesize of output 51 [2022-01-10 06:09:44,751 INFO L353 Elim1Store]: treesize reduction 3, result has 83.3 percent of original size [2022-01-10 06:09:44,751 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 53 treesize of output 29 [2022-01-10 06:09:44,756 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 11 [2022-01-10 06:09:44,891 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:44,891 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:09:44,891 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1059570267] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:09:44,892 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-10 06:09:44,892 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [21] total 31 [2022-01-10 06:09:44,892 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657884462] [2022-01-10 06:09:44,892 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:09:44,892 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 06:09:44,892 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:44,893 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 06:09:44,893 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=1262, Unknown=16, NotChecked=72, Total=1482 [2022-01-10 06:09:44,893 INFO L87 Difference]: Start difference. First operand 34 states and 41 transitions. Second operand has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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:45,201 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:45,201 INFO L93 Difference]: Finished difference Result 42 states and 50 transitions. [2022-01-10 06:09:45,201 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-01-10 06:09:45,201 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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:45,213 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:45,214 INFO L225 Difference]: With dead ends: 42 [2022-01-10 06:09:45,214 INFO L226 Difference]: Without dead ends: 39 [2022-01-10 06:09:45,215 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 86 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 39 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 494 ImplicationChecksByTransitivity, 3.9s TimeCoverageRelationStatistics Valid=145, Invalid=1403, Unknown=16, NotChecked=76, Total=1640 [2022-01-10 06:09:45,215 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 9 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 153 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 49 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:45,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 153 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 34 Invalid, 0 Unknown, 49 Unchecked, 0.1s Time] [2022-01-10 06:09:45,216 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-01-10 06:09:45,219 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-01-10 06:09:45,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 34 states have (on average 1.2058823529411764) internal successors, (41), 34 states have internal predecessors, (41), 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:45,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 47 transitions. [2022-01-10 06:09:45,221 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 47 transitions. Word has length 38 [2022-01-10 06:09:45,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:45,221 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 47 transitions. [2022-01-10 06:09:45,221 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 1.9230769230769231) internal successors, (25), 13 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:45,221 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 47 transitions. [2022-01-10 06:09:45,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 06:09:45,222 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:45,222 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:45,227 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (8)] Ended with exit code 0 [2022-01-10 06:09:45,432 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-01-10 06:09:45,633 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:45,634 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:45,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:45,635 INFO L85 PathProgramCache]: Analyzing trace with hash 1409627690, now seen corresponding path program 1 times [2022-01-10 06:09:45,635 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:45,635 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1602981914] [2022-01-10 06:09:45,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:45,636 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:45,636 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:45,637 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:45,639 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-01-10 06:09:45,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:45,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 43 conjunts are in the unsatisfiable core [2022-01-10 06:09:45,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:46,055 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:46,186 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:46,417 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:09:46,417 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:46,424 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:46,430 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:46,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:46,701 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 06:09:46,702 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:46,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:46,721 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 32 treesize of output 32 [2022-01-10 06:09:46,739 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-10 06:09:46,739 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:46,965 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 21 [2022-01-10 06:09:47,139 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:09:47,139 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:47,189 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:47,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:47,432 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_395 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_394 (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 (= (_ bv0 64) (select (let ((.cse0 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_22| v_ArrVal_395))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))) (bvadd (_ bv4 64) (select (select (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_22| v_ArrVal_394) |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|))))) (not (= (select |c_#valid| |v_node_create_~temp~0#1.base_22|) (_ bv0 1))))) is different from false [2022-01-10 06:09:47,437 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:47,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1602981914] [2022-01-10 06:09:47,438 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1602981914] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:09:47,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1015149222] [2022-01-10 06:09:47,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:47,438 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 06:09:47,438 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 06:09:47,439 INFO L229 MonitoredProcess]: Starting monitored process 10 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:47,455 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Waiting until timeout for monitored process [2022-01-10 06:09:47,943 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:47,952 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 58 conjunts are in the unsatisfiable core [2022-01-10 06:09:47,959 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:48,283 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,556 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:48,890 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:48,892 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:49,484 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:49,491 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:49,527 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:49,534 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:50,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:50,335 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:50,364 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:50,366 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:50,414 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-10 06:09:50,414 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:50,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:50,463 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 14 treesize of output 16 [2022-01-10 06:09:51,443 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 06:09:51,443 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:51,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:51,461 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:51,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:51,518 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:51,901 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:51,913 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:52,253 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:52,319 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:52,319 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:52,555 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_463 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_461 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_462 (_ BitVec 32))) (= |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_462)) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_append_~last~0#1.base| v_ArrVal_461) |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_463) |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:53,039 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_474 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_463 (Array (_ BitVec 64) (_ BitVec 64))) (|v_node_create_~temp~0#1.base_25| (_ BitVec 64)) (v_ArrVal_473 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_472 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_461 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_462 (_ BitVec 32))) (or (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|)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_25| v_ArrVal_473))) (let ((.cse2 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_25| v_ArrVal_472)) (.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_474))) (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_462))) (select (select (store .cse3 .cse1 v_ArrVal_461) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store .cse2 .cse1 v_ArrVal_463) |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:53,049 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1015149222] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:09:53,049 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:09:53,050 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18] total 35 [2022-01-10 06:09:53,050 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432951009] [2022-01-10 06:09:53,050 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:09:53,050 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2022-01-10 06:09:53,050 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:53,051 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2022-01-10 06:09:53,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=138, Invalid=1501, Unknown=13, NotChecked=240, Total=1892 [2022-01-10 06:09:53,052 INFO L87 Difference]: Start difference. First operand 39 states and 47 transitions. Second operand has 35 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 30 states have internal predecessors, (65), 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:56,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:56,551 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-01-10 06:09:56,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-01-10 06:09:56,552 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 30 states have internal predecessors, (65), 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 40 [2022-01-10 06:09:56,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:56,553 INFO L225 Difference]: With dead ends: 53 [2022-01-10 06:09:56,554 INFO L226 Difference]: Without dead ends: 42 [2022-01-10 06:09:56,555 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 56 SyntacticMatches, 4 SemanticMatches, 55 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 752 ImplicationChecksByTransitivity, 5.9s TimeCoverageRelationStatistics Valid=264, Invalid=2591, Unknown=19, NotChecked=318, Total=3192 [2022-01-10 06:09:56,555 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 21 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 431 SdHoareTripleChecker+Invalid, 436 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:56,555 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 431 Invalid, 436 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 329 Invalid, 0 Unknown, 99 Unchecked, 0.9s Time] [2022-01-10 06:09:56,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-10 06:09:56,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2022-01-10 06:09:56,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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:56,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 47 transitions. [2022-01-10 06:09:56,560 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 47 transitions. Word has length 40 [2022-01-10 06:09:56,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:56,560 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 47 transitions. [2022-01-10 06:09:56,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 33 states have (on average 1.9696969696969697) internal successors, (65), 30 states have internal predecessors, (65), 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:56,561 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 47 transitions. [2022-01-10 06:09:56,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-10 06:09:56,561 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:56,561 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:56,590 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-01-10 06:09:56,792 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (10)] Ended with exit code 0 [2022-01-10 06:09:56,992 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt [2022-01-10 06:09:56,992 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:56,993 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:56,993 INFO L85 PathProgramCache]: Analyzing trace with hash 968809289, now seen corresponding path program 1 times [2022-01-10 06:09:56,993 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:56,993 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1937476909] [2022-01-10 06:09:56,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:56,993 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:56,993 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:56,995 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:56,996 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-01-10 06:09:57,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:57,258 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 59 conjunts are in the unsatisfiable core [2022-01-10 06:09:57,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:57,270 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:57,290 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:57,389 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-01-10 06:09:57,390 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:57,498 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 10 [2022-01-10 06:09:57,640 INFO L353 Elim1Store]: treesize reduction 30, result has 45.5 percent of original size [2022-01-10 06:09:57,640 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 25 treesize of output 42 [2022-01-10 06:09:57,734 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:57,749 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:58,254 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-01-10 06:09:58,254 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 99 treesize of output 34 [2022-01-10 06:09:58,264 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:58,276 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 24 treesize of output 18 [2022-01-10 06:09:58,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:58,566 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 06:09:58,566 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 105 treesize of output 89 [2022-01-10 06:09:58,578 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:58,579 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 92 treesize of output 86 [2022-01-10 06:09:58,611 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:58,653 INFO L353 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-01-10 06:09:58,654 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 47 treesize of output 47 [2022-01-10 06:10:00,410 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-01-10 06:10:00,411 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:10:00,458 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 06:10:00,458 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:10:00,876 INFO L353 Elim1Store]: treesize reduction 17, result has 5.6 percent of original size [2022-01-10 06:10:00,876 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 110 treesize of output 31 [2022-01-10 06:10:00,894 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:10:01,120 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 5 proven. 17 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 06:10:01,120 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:10:01,252 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_539 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_540 (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_539))) (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_540) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))))) is different from false [2022-01-10 06:10:01,302 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_539 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_540 (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_539))) (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_540) |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:10:01,345 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_539 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_540 (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_539))) (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_540) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))))))) is different from false [2022-01-10 06:10:01,554 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_545 (Array (_ BitVec 64) (_ BitVec 64))) (|v_node_create_~temp~0#1.base_28| (_ BitVec 64)) (v_ArrVal_539 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_540 (Array (_ BitVec 64) (_ BitVec 64)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_node_create_~temp~0#1.base_28|))) (not (bvult |v_node_create_~temp~0#1.base_28| |c_#StackHeapBarrier|)) (not (= (_ bv0 64) (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_node_create_~temp~0#1.base_28| v_ArrVal_545)) (.cse3 (store |c_#memory_$Pointer$.offset| |v_node_create_~temp~0#1.base_28| v_ArrVal_546))) (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 (select (select .cse3 |c_ULTIMATE.start_sll_append_~head#1.base|) |c_ULTIMATE.start_sll_append_~head#1.offset|) (_ bv4 64))))) (select (let ((.cse0 (store .cse1 .cse2 v_ArrVal_539))) (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_540) |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:10:01,567 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:10:01,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1937476909] [2022-01-10 06:10:01,568 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1937476909] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:10:01,568 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1496023237] [2022-01-10 06:10:01,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:10:01,568 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 06:10:01,569 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 06:10:01,570 INFO L229 MonitoredProcess]: Starting monitored process 12 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:10:01,586 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (12)] Waiting until timeout for monitored process [2022-01-10 06:10:02,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:10:02,228 INFO L263 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 65 conjunts are in the unsatisfiable core [2022-01-10 06:10:02,232 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:10:02,420 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:10:03,324 INFO L353 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-01-10 06:10:03,325 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:10:03,528 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:10:04,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:10:04,513 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:10:04,514 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 87 treesize of output 32 [2022-01-10 06:10:04,522 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 14 treesize of output 10 [2022-01-10 06:10:04,529 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:10:05,167 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:10:05,218 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 06:10:05,218 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 93 treesize of output 81 [2022-01-10 06:10:05,259 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:10:05,262 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 76 treesize of output 72 [2022-01-10 06:10:05,332 INFO L353 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2022-01-10 06:10:05,333 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 37 treesize of output 39 [2022-01-10 06:10:08,837 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:10:08,952 INFO L353 Elim1Store]: treesize reduction 97, result has 24.8 percent of original size [2022-01-10 06:10:08,953 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:10:08,993 INFO L353 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2022-01-10 06:10:08,994 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:09,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:10:09,525 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 06:10:09,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 99 treesize of output 30 [2022-01-10 06:10:09,535 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:10:09,843 INFO L134 CoverageAnalysis]: Checked inductivity of 23 backedges. 13 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 06:10:09,843 INFO L328 TraceCheckSpWp]: Computing backward predicates...