/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_insert_unequal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 06:09:37,332 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 06:09:37,334 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 06:09:37,395 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 06:09:37,396 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 06:09:37,396 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 06:09:37,397 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 06:09:37,398 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 06:09:37,399 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 06:09:37,410 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 06:09:37,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 06:09:37,411 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 06:09:37,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 06:09:37,412 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 06:09:37,412 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 06:09:37,413 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 06:09:37,413 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 06:09:37,414 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 06:09:37,415 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 06:09:37,416 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 06:09:37,417 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 06:09:37,420 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 06:09:37,423 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 06:09:37,424 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 06:09:37,433 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 06:09:37,433 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 06:09:37,433 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 06:09:37,434 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 06:09:37,434 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 06:09:37,434 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 06:09:37,434 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 06:09:37,435 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 06:09:37,435 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 06:09:37,436 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 06:09:37,436 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 06:09:37,436 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 06:09:37,437 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 06:09:37,437 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 06:09:37,437 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 06:09:37,439 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 06:09:37,440 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 06:09:37,443 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:37,461 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 06:09:37,462 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 06:09:37,462 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 06:09:37,462 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 06:09:37,463 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-01-10 06:09:37,463 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-01-10 06:09:37,465 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 06:09:37,465 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 06:09:37,465 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 06:09:37,465 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 06:09:37,466 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 06:09:37,466 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 06:09:37,466 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 06:09:37,466 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 06:09:37,467 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 06:09:37,467 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 06:09:37,467 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 06:09:37,467 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 06:09:37,467 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 06:09:37,467 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 06:09:37,467 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 06:09:37,467 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 06:09:37,467 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 06:09:37,468 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:09:37,469 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 06:09:37,469 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 06:09:37,469 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 06:09:37,469 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-01-10 06:09:37,469 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-01-10 06:09:37,469 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 06:09:37,469 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 06:09:37,469 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 06:09:37,470 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 06:09:37,470 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:37,673 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 06:09:37,694 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 06:09:37,696 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 06:09:37,697 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 06:09:37,698 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 06:09:37,699 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/sll2n_insert_unequal.i [2022-01-10 06:09:37,763 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4aec3c762/679f127c0d06441d9b3bf33ae751e6f8/FLAGf9377d598 [2022-01-10 06:09:38,167 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 06:09:38,167 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/sll2n_insert_unequal.i [2022-01-10 06:09:38,184 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4aec3c762/679f127c0d06441d9b3bf33ae751e6f8/FLAGf9377d598 [2022-01-10 06:09:38,196 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4aec3c762/679f127c0d06441d9b3bf33ae751e6f8 [2022-01-10 06:09:38,198 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 06:09:38,199 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2022-01-10 06:09:38,200 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 06:09:38,200 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 06:09:38,203 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 06:09:38,203 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:09:38" (1/1) ... [2022-01-10 06:09:38,204 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@33043e3f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:38, skipping insertion in model container [2022-01-10 06:09:38,204 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 06:09:38" (1/1) ... [2022-01-10 06:09:38,209 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 06:09:38,261 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 06:09:38,581 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_insert_unequal.i[24620,24633] [2022-01-10 06:09:38,586 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:09:38,598 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 06:09:38,643 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_insert_unequal.i[24620,24633] [2022-01-10 06:09:38,644 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 06:09:38,670 INFO L208 MainTranslator]: Completed translation [2022-01-10 06:09:38,671 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:38 WrapperNode [2022-01-10 06:09:38,671 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 06:09:38,672 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 06:09:38,672 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 06:09:38,672 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 06:09:38,677 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:38" (1/1) ... [2022-01-10 06:09:38,706 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:38" (1/1) ... [2022-01-10 06:09:38,732 INFO L137 Inliner]: procedures = 131, calls = 36, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 149 [2022-01-10 06:09:38,732 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 06:09:38,733 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 06:09:38,733 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 06:09:38,733 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 06:09:38,739 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:38" (1/1) ... [2022-01-10 06:09:38,740 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:38" (1/1) ... [2022-01-10 06:09:38,753 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:38" (1/1) ... [2022-01-10 06:09:38,753 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:38" (1/1) ... [2022-01-10 06:09:38,763 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:38" (1/1) ... [2022-01-10 06:09:38,766 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:38" (1/1) ... [2022-01-10 06:09:38,768 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:38" (1/1) ... [2022-01-10 06:09:38,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 06:09:38,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 06:09:38,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 06:09:38,780 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 06:09:38,781 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:38" (1/1) ... [2022-01-10 06:09:38,785 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 06:09:38,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 06:09:38,807 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:38,831 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:38,843 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 06:09:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-01-10 06:09:38,844 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-01-10 06:09:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 06:09:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 06:09:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 06:09:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 06:09:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 06:09:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 06:09:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 06:09:38,844 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 06:09:38,845 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 06:09:38,845 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 06:09:38,845 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 06:09:38,975 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 06:09:38,976 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 06:09:39,215 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 06:09:39,219 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 06:09:39,219 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-10 06:09:39,220 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:09:39 BoogieIcfgContainer [2022-01-10 06:09:39,221 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 06:09:39,222 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 06:09:39,222 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 06:09:39,224 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 06:09:39,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 06:09:38" (1/3) ... [2022-01-10 06:09:39,225 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589b2102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:09:39, skipping insertion in model container [2022-01-10 06:09:39,225 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 06:09:38" (2/3) ... [2022-01-10 06:09:39,226 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@589b2102 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 06:09:39, skipping insertion in model container [2022-01-10 06:09:39,226 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 06:09:39" (3/3) ... [2022-01-10 06:09:39,227 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_insert_unequal.i [2022-01-10 06:09:39,230 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 06:09:39,231 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 06:09:39,273 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 06:09:39,279 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:39,279 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 06:09:39,294 INFO L276 IsEmpty]: Start isEmpty. Operand has 34 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 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:39,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 06:09:39,299 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:39,300 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:39,300 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:39,304 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:39,305 INFO L85 PathProgramCache]: Analyzing trace with hash -246443823, now seen corresponding path program 1 times [2022-01-10 06:09:39,315 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:39,316 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1838506067] [2022-01-10 06:09:39,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:39,317 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:39,317 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:39,319 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:39,320 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:39,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:39,467 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 1 conjunts are in the unsatisfiable core [2022-01-10 06:09:39,470 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:39,530 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:39,530 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:09:39,531 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:39,531 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1838506067] [2022-01-10 06:09:39,532 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1838506067] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:09:39,532 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:09:39,532 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 06:09:39,534 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1194604668] [2022-01-10 06:09:39,534 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:09:39,537 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 06:09:39,538 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:39,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 06:09:39,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 06:09:39,567 INFO L87 Difference]: Start difference. First operand has 34 states, 29 states have (on average 1.5862068965517242) internal successors, (46), 30 states have internal predecessors, (46), 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 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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:39,587 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:39,587 INFO L93 Difference]: Finished difference Result 62 states and 91 transitions. [2022-01-10 06:09:39,588 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 06:09:39,589 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 19 [2022-01-10 06:09:39,589 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:39,594 INFO L225 Difference]: With dead ends: 62 [2022-01-10 06:09:39,594 INFO L226 Difference]: Without dead ends: 28 [2022-01-10 06:09:39,597 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 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:39,600 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:39,601 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:39,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-10 06:09:39,631 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-01-10 06:09:39,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 24 states have (on average 1.3333333333333333) internal successors, (32), 24 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:39,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 36 transitions. [2022-01-10 06:09:39,635 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 36 transitions. Word has length 19 [2022-01-10 06:09:39,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:39,636 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 36 transitions. [2022-01-10 06:09:39,636 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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:39,637 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 36 transitions. [2022-01-10 06:09:39,638 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-10 06:09:39,638 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:39,638 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:39,648 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Ended with exit code 0 [2022-01-10 06:09:39,848 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:39,849 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:39,850 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:39,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1738034235, now seen corresponding path program 1 times [2022-01-10 06:09:39,852 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:39,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [927850985] [2022-01-10 06:09:39,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:39,852 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:39,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:39,853 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:39,855 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:39,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:39,942 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 4 conjunts are in the unsatisfiable core [2022-01-10 06:09:39,943 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:40,007 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:40,007 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:09:40,008 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:40,008 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [927850985] [2022-01-10 06:09:40,008 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [927850985] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:09:40,008 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:09:40,008 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 06:09:40,009 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2060359585] [2022-01-10 06:09:40,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:09:40,010 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 06:09:40,010 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:40,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 06:09:40,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 06:09:40,011 INFO L87 Difference]: Start difference. First operand 28 states and 36 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:40,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:40,026 INFO L93 Difference]: Finished difference Result 54 states and 70 transitions. [2022-01-10 06:09:40,027 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 06:09:40,027 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 19 [2022-01-10 06:09:40,027 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:40,029 INFO L225 Difference]: With dead ends: 54 [2022-01-10 06:09:40,029 INFO L226 Difference]: Without dead ends: 32 [2022-01-10 06:09:40,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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:40,030 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:40,033 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:40,034 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-01-10 06:09:40,037 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-01-10 06:09:40,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 25 states have (on average 1.32) internal successors, (33), 25 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:40,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 37 transitions. [2022-01-10 06:09:40,038 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 37 transitions. Word has length 19 [2022-01-10 06:09:40,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:40,038 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 37 transitions. [2022-01-10 06:09:40,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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:40,038 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 37 transitions. [2022-01-10 06:09:40,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 06:09:40,039 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:40,039 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:40,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-01-10 06:09:40,240 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:40,240 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:40,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:40,241 INFO L85 PathProgramCache]: Analyzing trace with hash 1368908325, now seen corresponding path program 1 times [2022-01-10 06:09:40,241 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:40,241 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1711202311] [2022-01-10 06:09:40,241 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:40,241 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:40,242 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:40,243 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:40,244 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:40,351 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:40,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 06:09:40,359 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:40,425 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:40,425 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:40,511 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:40,511 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:40,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1711202311] [2022-01-10 06:09:40,512 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1711202311] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 06:09:40,512 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:09:40,512 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-01-10 06:09:40,512 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [816881446] [2022-01-10 06:09:40,512 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:09:40,512 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 06:09:40,513 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:40,513 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 06:09:40,513 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-01-10 06:09:40,513 INFO L87 Difference]: Start difference. First operand 29 states and 37 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 06:09:40,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:40,546 INFO L93 Difference]: Finished difference Result 58 states and 75 transitions. [2022-01-10 06:09:40,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 06:09:40,547 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-01-10 06:09:40,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:40,548 INFO L225 Difference]: With dead ends: 58 [2022-01-10 06:09:40,548 INFO L226 Difference]: Without dead ends: 36 [2022-01-10 06:09:40,548 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 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:40,549 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 5 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 165 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:40,549 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 165 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:09:40,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-01-10 06:09:40,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 33. [2022-01-10 06:09:40,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 33 states, 28 states have (on average 1.2857142857142858) internal successors, (36), 28 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:40,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 42 transitions. [2022-01-10 06:09:40,554 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 42 transitions. Word has length 28 [2022-01-10 06:09:40,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:40,554 INFO L470 AbstractCegarLoop]: Abstraction has 33 states and 42 transitions. [2022-01-10 06:09:40,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-01-10 06:09:40,555 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 42 transitions. [2022-01-10 06:09:40,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-01-10 06:09:40,555 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:40,556 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 06:09:40,566 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:40,764 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:40,764 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:40,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:40,765 INFO L85 PathProgramCache]: Analyzing trace with hash -1136271419, now seen corresponding path program 2 times [2022-01-10 06:09:40,765 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:40,765 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1872292876] [2022-01-10 06:09:40,766 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-10 06:09:40,766 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:40,766 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:40,767 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:40,798 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:40,872 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-01-10 06:09:40,873 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-10 06:09:40,878 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 5 conjunts are in the unsatisfiable core [2022-01-10 06:09:40,880 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:40,981 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-01-10 06:09:40,981 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-10 06:09:40,981 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:40,981 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1872292876] [2022-01-10 06:09:40,984 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1872292876] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 06:09:40,984 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 06:09:40,984 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 06:09:40,985 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [200863749] [2022-01-10 06:09:40,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 06:09:40,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 06:09:40,985 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:40,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 06:09:40,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 06:09:40,986 INFO L87 Difference]: Start difference. First operand 33 states and 42 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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:41,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:41,038 INFO L93 Difference]: Finished difference Result 46 states and 61 transitions. [2022-01-10 06:09:41,039 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 06:09:41,039 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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) Word has length 37 [2022-01-10 06:09:41,039 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:41,041 INFO L225 Difference]: With dead ends: 46 [2022-01-10 06:09:41,041 INFO L226 Difference]: Without dead ends: 34 [2022-01-10 06:09:41,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 06:09:41,047 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 21 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 70 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:41,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 70 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 06:09:41,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-01-10 06:09:41,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2022-01-10 06:09:41,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-01-10 06:09:41,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 43 transitions. [2022-01-10 06:09:41,055 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 43 transitions. Word has length 37 [2022-01-10 06:09:41,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:41,055 INFO L470 AbstractCegarLoop]: Abstraction has 34 states and 43 transitions. [2022-01-10 06:09:41,058 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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:41,058 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 43 transitions. [2022-01-10 06:09:41,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 06:09:41,060 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:41,060 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:41,068 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:41,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:41,269 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:41,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:41,269 INFO L85 PathProgramCache]: Analyzing trace with hash -300753136, now seen corresponding path program 1 times [2022-01-10 06:09:41,269 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:41,270 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1832775419] [2022-01-10 06:09:41,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:41,270 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:41,270 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:41,271 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:41,273 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-01-10 06:09:41,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:41,646 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 65 conjunts are in the unsatisfiable core [2022-01-10 06:09:41,650 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:41,805 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:41,877 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:42,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:42,031 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:42,041 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 06:09:42,340 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 18 [2022-01-10 06:09:42,350 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:42,359 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:42,364 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:42,717 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 06:09:42,717 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-01-10 06:09:42,727 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:42,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:42,760 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:42,772 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:42,773 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:42,795 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-10 06:09:42,795 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:43,361 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 06:09:43,361 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:43,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:43,374 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:43,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:43,394 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:43,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:43,513 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 33 treesize of output 31 [2022-01-10 06:09:43,525 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:43,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:43,547 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:43,889 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:43,897 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:44,021 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:44,067 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 06:09:44,067 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:44,198 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_236 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_237 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_235 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_237) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_236) |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_insert_~new_node~0#1.base| v_ArrVal_235) |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:44,220 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_236 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_237 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_231 (_ BitVec 32)) (v_ArrVal_235 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_234 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_233 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (bvadd (_ bv4 64) |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset|) v_ArrVal_231)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_237) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_234) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_236) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_235) |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:44,254 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_236 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_237 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_231 (_ BitVec 32)) (v_ArrVal_235 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_234 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_233 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) (bvadd (_ bv4 64) |c_ULTIMATE.start_sll_insert_~last~0#1.offset|) v_ArrVal_231)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_237) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_234) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_236) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_233) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_235) |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:44,277 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_237 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_236 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_231 (_ BitVec 32)) (v_ArrVal_235 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_234 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_233 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (_ bv4 64) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) v_ArrVal_231)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_237) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_234) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_236) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_233) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_235) |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:44,878 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:44,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1832775419] [2022-01-10 06:09:44,878 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1832775419] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:09:44,878 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1697598261] [2022-01-10 06:09:44,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:44,878 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 06:09:44,878 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 06:09:44,879 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-01-10 06:09:44,880 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-01-10 06:09:45,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:45,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 236 conjuncts, 70 conjunts are in the unsatisfiable core [2022-01-10 06:09:45,344 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:45,587 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:45,625 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:45,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:45,845 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:46,417 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:46,448 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:46,454 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,459 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:46,993 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 06:09:46,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 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-01-10 06:09:47,003 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:47,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:47,031 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:47,052 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:47,054 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:47,075 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-10 06:09:47,076 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:47,830 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 06:09:47,830 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:47,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:47,839 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:47,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:47,858 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:48,021 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:48,022 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 33 treesize of output 31 [2022-01-10 06:09:48,031 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:48,050 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:48,051 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:48,360 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:48,367 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:48,420 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:48,428 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 10 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 06:09:48,428 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:48,448 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_325 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_324 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_326 (Array (_ BitVec 64) (_ BitVec 32)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_326) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_324) |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_insert_~new_node~0#1.base| v_ArrVal_325) |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:48,467 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_325 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_322 (_ BitVec 32)) (v_ArrVal_324 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_323 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_326 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_321 (Array (_ BitVec 64) (_ BitVec 64)))) (= (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base|) (bvadd (_ bv4 64) |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset|) v_ArrVal_322)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_326) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-01-10 06:09:48,498 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_325 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_322 (_ BitVec 32)) (v_ArrVal_324 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_323 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_326 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_321 (Array (_ BitVec 64) (_ BitVec 64)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_sll_insert_~last~0#1.base|) (bvadd (_ bv4 64) |c_ULTIMATE.start_sll_insert_~last~0#1.offset|) v_ArrVal_322)) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_326) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_323) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_321) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_325) |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:48,523 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_325 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_322 (_ BitVec 32)) (v_ArrVal_324 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_326 (Array (_ BitVec 64) (_ BitVec 32))) (v_ArrVal_323 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_321 (Array (_ BitVec 64) (_ BitVec 64)))) (= (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|))) (select (select (store (store |c_#memory_int| .cse0 (store (select |c_#memory_int| .cse0) (bvadd (_ bv4 64) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|)) v_ArrVal_322)) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_326) (select (select (store (store |c_#memory_$Pointer$.base| .cse0 v_ArrVal_323) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_324) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (select (select (store (store |c_#memory_$Pointer$.offset| .cse0 v_ArrVal_321) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_325) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) |c_ULTIMATE.start_main_~data~0#1|)) is different from false [2022-01-10 06:09:49,403 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [1697598261] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:09:49,403 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:09:49,403 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20] total 32 [2022-01-10 06:09:49,403 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [318020558] [2022-01-10 06:09:49,403 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:09:49,404 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2022-01-10 06:09:49,404 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:49,404 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2022-01-10 06:09:49,406 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1180, Unknown=32, NotChecked=616, Total=1980 [2022-01-10 06:09:49,406 INFO L87 Difference]: Start difference. First operand 34 states and 43 transitions. Second operand has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 27 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-10 06:09:50,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:50,766 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2022-01-10 06:09:50,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-01-10 06:09:50,767 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 27 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2022-01-10 06:09:50,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:50,768 INFO L225 Difference]: With dead ends: 47 [2022-01-10 06:09:50,768 INFO L226 Difference]: Without dead ends: 45 [2022-01-10 06:09:50,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 50 ConstructedPredicates, 8 IntricatePredicates, 0 DeprecatedPredicates, 444 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=211, Invalid=1681, Unknown=32, NotChecked=728, Total=2652 [2022-01-10 06:09:50,769 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 17 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 232 SdHoareTripleChecker+Invalid, 367 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 137 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:50,770 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [17 Valid, 232 Invalid, 367 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 225 Invalid, 0 Unknown, 137 Unchecked, 0.6s Time] [2022-01-10 06:09:50,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-10 06:09:50,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 45. [2022-01-10 06:09:50,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.2820512820512822) internal successors, (50), 39 states have internal predecessors, (50), 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:50,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 56 transitions. [2022-01-10 06:09:50,775 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 56 transitions. Word has length 38 [2022-01-10 06:09:50,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:50,775 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 56 transitions. [2022-01-10 06:09:50,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 30 states have (on average 1.6666666666666667) internal successors, (50), 27 states have internal predecessors, (50), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2022-01-10 06:09:50,775 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 56 transitions. [2022-01-10 06:09:50,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-01-10 06:09:50,776 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:50,776 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:50,790 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Ended with exit code 0 [2022-01-10 06:09:50,990 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-01-10 06:09:51,176 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:51,177 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:51,177 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:51,178 INFO L85 PathProgramCache]: Analyzing trace with hash -243494834, now seen corresponding path program 1 times [2022-01-10 06:09:51,178 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:51,178 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1768508605] [2022-01-10 06:09:51,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:51,178 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:51,178 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:51,179 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:51,181 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-01-10 06:09:51,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:51,444 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 20 conjunts are in the unsatisfiable core [2022-01-10 06:09:51,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:51,559 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:51,647 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:51,792 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:51,793 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:51,843 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-01-10 06:09:51,887 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 06:09:51,887 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:52,029 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:52,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1768508605] [2022-01-10 06:09:52,030 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1768508605] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:09:52,030 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [2073631162] [2022-01-10 06:09:52,030 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:52,030 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 06:09:52,030 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 06:09:52,031 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-01-10 06:09:52,032 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Waiting until timeout for monitored process [2022-01-10 06:09:52,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:52,316 INFO L263 TraceCheckSpWp]: Trace formula consists of 237 conjuncts, 21 conjunts are in the unsatisfiable core [2022-01-10 06:09:52,318 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:52,683 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:52,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:52,794 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:52,867 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:52,878 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 06:09:52,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:53,001 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleCvc4 [2073631162] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:09:53,001 INFO L186 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-01-10 06:09:53,001 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16] total 22 [2022-01-10 06:09:53,001 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140785722] [2022-01-10 06:09:53,001 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-01-10 06:09:53,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-01-10 06:09:53,002 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-01-10 06:09:53,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-01-10 06:09:53,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=462, Unknown=8, NotChecked=0, Total=552 [2022-01-10 06:09:53,003 INFO L87 Difference]: Start difference. First operand 45 states and 56 transitions. Second operand has 22 states, 20 states have (on average 2.05) internal successors, (41), 17 states have internal predecessors, (41), 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:53,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 06:09:53,474 INFO L93 Difference]: Finished difference Result 65 states and 84 transitions. [2022-01-10 06:09:53,474 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-10 06:09:53,475 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 20 states have (on average 2.05) internal successors, (41), 17 states have internal predecessors, (41), 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 38 [2022-01-10 06:09:53,475 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 06:09:53,475 INFO L225 Difference]: With dead ends: 65 [2022-01-10 06:09:53,476 INFO L226 Difference]: Without dead ends: 54 [2022-01-10 06:09:53,476 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 68 SyntacticMatches, 4 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=117, Invalid=628, Unknown=11, NotChecked=0, Total=756 [2022-01-10 06:09:53,476 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 31 mSDsluCounter, 182 mSDsCounter, 0 mSdLazyCounter, 122 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 211 SdHoareTripleChecker+Invalid, 173 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 122 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 46 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-10 06:09:53,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 211 Invalid, 173 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 122 Invalid, 0 Unknown, 46 Unchecked, 0.3s Time] [2022-01-10 06:09:53,477 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-10 06:09:53,480 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 45. [2022-01-10 06:09:53,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 45 states, 39 states have (on average 1.2564102564102564) internal successors, (49), 39 states have internal predecessors, (49), 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:53,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45 states to 45 states and 55 transitions. [2022-01-10 06:09:53,481 INFO L78 Accepts]: Start accepts. Automaton has 45 states and 55 transitions. Word has length 38 [2022-01-10 06:09:53,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 06:09:53,482 INFO L470 AbstractCegarLoop]: Abstraction has 45 states and 55 transitions. [2022-01-10 06:09:53,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 20 states have (on average 2.05) internal successors, (41), 17 states have internal predecessors, (41), 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:53,482 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 55 transitions. [2022-01-10 06:09:53,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-01-10 06:09:53,482 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 06:09:53,482 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] [2022-01-10 06:09:53,486 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (9)] Ended with exit code 0 [2022-01-10 06:09:53,696 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-01-10 06:09:53,886 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:53,887 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 06:09:53,887 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 06:09:53,887 INFO L85 PathProgramCache]: Analyzing trace with hash -733467546, now seen corresponding path program 1 times [2022-01-10 06:09:53,888 INFO L121 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-01-10 06:09:53,888 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1661955461] [2022-01-10 06:09:53,888 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:53,888 INFO L168 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-01-10 06:09:53,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-01-10 06:09:53,889 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-01-10 06:09:53,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-01-10 06:09:54,198 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:54,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-10 06:09:54,217 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:54,559 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:54,793 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:54,794 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-01-10 06:09:55,322 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 06:09:55,322 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 26 treesize of output 27 [2022-01-10 06:09:55,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:55,486 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 22 [2022-01-10 06:09:55,876 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-01-10 06:09:56,002 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-10 06:09:56,003 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 06:09:56,096 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_534 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (_ bv0 64) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= (_ bv0 32) |c_ULTIMATE.start_main_~mid_index~0#1|))) is different from false [2022-01-10 06:09:56,107 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_534 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_533 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (_ bv0 64) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_533) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= (_ bv0 32) |c_ULTIMATE.start_main_~mid_index~0#1|))) is different from false [2022-01-10 06:09:56,122 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_534 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_533 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (_ bv0 64) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_533) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_534) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= (_ bv0 32) |c_ULTIMATE.start_main_~mid_index~0#1|))) is different from false [2022-01-10 06:09:56,133 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_534 (Array (_ BitVec 64) (_ BitVec 64))) (v_ArrVal_533 (Array (_ BitVec 64) (_ BitVec 64)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) v_ArrVal_533) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_534) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 64)))) (not (= (_ bv0 32) |c_ULTIMATE.start_main_~mid_index~0#1|))) is different from false [2022-01-10 06:09:56,380 INFO L139 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-01-10 06:09:56,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1661955461] [2022-01-10 06:09:56,381 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1661955461] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 06:09:56,381 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1099361520] [2022-01-10 06:09:56,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 06:09:56,381 INFO L168 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-01-10 06:09:56,381 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-01-10 06:09:56,382 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-01-10 06:09:56,383 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Waiting until timeout for monitored process [2022-01-10 06:09:56,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 06:09:56,703 INFO L263 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 30 conjunts are in the unsatisfiable core [2022-01-10 06:09:56,706 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 06:09:57,437 INFO L353 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-01-10 06:09:57,437 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 57 [2022-01-10 06:09:57,459 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-10 06:09:57,460 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 56 [2022-01-10 06:09:57,465 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 30 treesize of output 24 [2022-01-10 06:09:57,475 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 31 treesize of output 27 [2022-01-10 06:09:57,838 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 06:09:57,889 INFO L353 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-01-10 06:09:57,890 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 82 [2022-01-10 06:09:57,896 WARN L320 FreeRefinementEngine]: Global settings require throwing the following exception [2022-01-10 06:09:57,903 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (11)] Forceful destruction successful, exit code 0 [2022-01-10 06:09:58,105 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Ended with exit code 0 [2022-01-10 06:09:58,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-01-10 06:09:58,297 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:108) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:166) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:154) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:142) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:126) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:110) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:90) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:904) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:268) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:150) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:140) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:88) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:393) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:303) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:263) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:176) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-01-10 06:09:58,300 INFO L158 Benchmark]: Toolchain (without parser) took 20101.59ms. Allocated memory was 191.9MB in the beginning and 330.3MB in the end (delta: 138.4MB). Free memory was 133.6MB in the beginning and 161.0MB in the end (delta: -27.4MB). Peak memory consumption was 111.8MB. Max. memory is 8.0GB. [2022-01-10 06:09:58,301 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 191.9MB. Free memory is still 151.1MB. There was no memory consumed. Max. memory is 8.0GB. [2022-01-10 06:09:58,301 INFO L158 Benchmark]: CACSL2BoogieTranslator took 470.97ms. Allocated memory was 191.9MB in the beginning and 330.3MB in the end (delta: 138.4MB). Free memory was 133.4MB in the beginning and 290.8MB in the end (delta: -157.4MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. [2022-01-10 06:09:58,301 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.60ms. Allocated memory is still 330.3MB. Free memory was 290.8MB in the beginning and 288.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. [2022-01-10 06:09:58,301 INFO L158 Benchmark]: Boogie Preprocessor took 45.45ms. Allocated memory is still 330.3MB. Free memory was 288.7MB in the beginning and 286.2MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. [2022-01-10 06:09:58,301 INFO L158 Benchmark]: RCFGBuilder took 441.47ms. Allocated memory is still 330.3MB. Free memory was 286.2MB in the beginning and 269.3MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. [2022-01-10 06:09:58,301 INFO L158 Benchmark]: TraceAbstraction took 19078.26ms. Allocated memory is still 330.3MB. Free memory was 268.8MB in the beginning and 161.0MB in the end (delta: 107.7MB). Peak memory consumption was 109.1MB. Max. memory is 8.0GB. [2022-01-10 06:09:58,302 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.12ms. Allocated memory is still 191.9MB. Free memory is still 151.1MB. There was no memory consumed. Max. memory is 8.0GB. * CACSL2BoogieTranslator took 470.97ms. Allocated memory was 191.9MB in the beginning and 330.3MB in the end (delta: 138.4MB). Free memory was 133.4MB in the beginning and 290.8MB in the end (delta: -157.4MB). Peak memory consumption was 7.0MB. Max. memory is 8.0GB. * Boogie Procedure Inliner took 60.60ms. Allocated memory is still 330.3MB. Free memory was 290.8MB in the beginning and 288.7MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 8.0GB. * Boogie Preprocessor took 45.45ms. Allocated memory is still 330.3MB. Free memory was 288.7MB in the beginning and 286.2MB in the end (delta: 2.4MB). Peak memory consumption was 3.1MB. Max. memory is 8.0GB. * RCFGBuilder took 441.47ms. Allocated memory is still 330.3MB. Free memory was 286.2MB in the beginning and 269.3MB in the end (delta: 17.0MB). Peak memory consumption was 16.8MB. Max. memory is 8.0GB. * TraceAbstraction took 19078.26ms. Allocated memory is still 330.3MB. Free memory was 268.8MB in the beginning and 161.0MB in the end (delta: 107.7MB). Peak memory consumption was 109.1MB. Max. memory is 8.0GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:108) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-01-10 06:09:58,333 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...