/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/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf -i ../../../trunk/examples/svcomp/list-simple/dll2n_prepend_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 05:26:00,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 05:26:00,035 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 05:26:00,069 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 05:26:00,070 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 05:26:00,072 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 05:26:00,076 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 05:26:00,080 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 05:26:00,082 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 05:26:00,083 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 05:26:00,083 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 05:26:00,084 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 05:26:00,084 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 05:26:00,085 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 05:26:00,085 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 05:26:00,086 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 05:26:00,086 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 05:26:00,087 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 05:26:00,088 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 05:26:00,089 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 05:26:00,090 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 05:26:00,094 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 05:26:00,095 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 05:26:00,096 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 05:26:00,097 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 05:26:00,097 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 05:26:00,097 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 05:26:00,098 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 05:26:00,098 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 05:26:00,099 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 05:26:00,099 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 05:26:00,099 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 05:26:00,100 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 05:26:00,100 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 05:26:00,101 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 05:26:00,101 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 05:26:00,101 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 05:26:00,101 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 05:26:00,101 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 05:26:00,102 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 05:26:00,102 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 05:26:00,104 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_SUM.epf [2022-01-11 05:26:00,129 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 05:26:00,129 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 05:26:00,129 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 05:26:00,130 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 05:26:00,130 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 05:26:00,131 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 05:26:00,131 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 05:26:00,131 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 05:26:00,131 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 05:26:00,131 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 05:26:00,132 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 05:26:00,132 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 05:26:00,132 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 05:26:00,132 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 05:26:00,132 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 05:26:00,132 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 05:26:00,132 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 05:26:00,132 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 05:26:00,132 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 05:26:00,132 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 05:26:00,132 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 05:26:00,132 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:26:00,133 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 05:26:00,133 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 05:26:00,133 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 05:26:00,133 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 05:26:00,133 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 05:26:00,133 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 05:26:00,133 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 05:26:00,133 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 05:26:00,133 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 05:26:00,133 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 05:26:00,134 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 05:26:00,134 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_SUM 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-11 05:26:00,324 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 05:26:00,345 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 05:26:00,347 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 05:26:00,348 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 05:26:00,348 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 05:26:00,349 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_prepend_equal.i [2022-01-11 05:26:00,392 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01bda94f1/1314a1b9366c49ac8dfe29f8e568513f/FLAG7bb1779f2 [2022-01-11 05:26:00,788 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 05:26:00,789 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_prepend_equal.i [2022-01-11 05:26:00,807 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01bda94f1/1314a1b9366c49ac8dfe29f8e568513f/FLAG7bb1779f2 [2022-01-11 05:26:01,135 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/01bda94f1/1314a1b9366c49ac8dfe29f8e568513f [2022-01-11 05:26:01,137 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 05:26:01,138 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 05:26:01,140 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 05:26:01,140 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 05:26:01,142 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 05:26:01,144 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:26:01" (1/1) ... [2022-01-11 05:26:01,144 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7c713b17 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:26:01, skipping insertion in model container [2022-01-11 05:26:01,144 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:26:01" (1/1) ... [2022-01-11 05:26:01,149 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 05:26:01,191 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 05:26:01,468 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_prepend_equal.i[24361,24374] [2022-01-11 05:26:01,473 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:26:01,484 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 05:26:01,522 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_prepend_equal.i[24361,24374] [2022-01-11 05:26:01,523 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:26:01,554 INFO L208 MainTranslator]: Completed translation [2022-01-11 05:26:01,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:26:01 WrapperNode [2022-01-11 05:26:01,555 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 05:26:01,556 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 05:26:01,556 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 05:26:01,556 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 05:26:01,561 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:26:01" (1/1) ... [2022-01-11 05:26:01,589 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:26:01" (1/1) ... [2022-01-11 05:26:01,611 INFO L137 Inliner]: procedures = 130, calls = 38, calls flagged for inlining = 8, calls inlined = 8, statements flattened = 121 [2022-01-11 05:26:01,611 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 05:26:01,612 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 05:26:01,612 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 05:26:01,612 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 05:26:01,618 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:26:01" (1/1) ... [2022-01-11 05:26:01,618 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:26:01" (1/1) ... [2022-01-11 05:26:01,630 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:26:01" (1/1) ... [2022-01-11 05:26:01,630 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:26:01" (1/1) ... [2022-01-11 05:26:01,640 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:26:01" (1/1) ... [2022-01-11 05:26:01,642 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:26:01" (1/1) ... [2022-01-11 05:26:01,644 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:26:01" (1/1) ... [2022-01-11 05:26:01,646 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 05:26:01,646 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 05:26:01,646 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 05:26:01,646 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 05:26:01,654 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:26:01" (1/1) ... [2022-01-11 05:26:01,659 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:26:01,666 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:26:01,709 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-11 05:26:01,741 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-11 05:26:01,758 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-11 05:26:01,758 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-11 05:26:01,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 05:26:01,759 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-11 05:26:01,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-11 05:26:01,759 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-11 05:26:01,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-11 05:26:01,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-11 05:26:01,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-11 05:26:01,759 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 05:26:01,759 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 05:26:01,759 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 05:26:01,871 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 05:26:01,872 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 05:26:02,171 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 05:26:02,175 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 05:26:02,175 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-11 05:26:02,176 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:26:02 BoogieIcfgContainer [2022-01-11 05:26:02,176 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 05:26:02,177 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 05:26:02,177 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 05:26:02,178 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 05:26:02,182 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:26:02" (1/1) ... [2022-01-11 05:26:02,243 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:26:02 BasicIcfg [2022-01-11 05:26:02,243 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 05:26:02,244 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 05:26:02,244 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 05:26:02,246 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 05:26:02,246 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 05:26:01" (1/4) ... [2022-01-11 05:26:02,246 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2910fad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:26:02, skipping insertion in model container [2022-01-11 05:26:02,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:26:01" (2/4) ... [2022-01-11 05:26:02,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2910fad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:26:02, skipping insertion in model container [2022-01-11 05:26:02,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:26:02" (3/4) ... [2022-01-11 05:26:02,247 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2910fad8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 05:26:02, skipping insertion in model container [2022-01-11 05:26:02,247 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:26:02" (4/4) ... [2022-01-11 05:26:02,248 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2n_prepend_equal.iTransformedIcfg [2022-01-11 05:26:02,251 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 05:26:02,251 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 05:26:02,278 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 05:26:02,282 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-11 05:26:02,283 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 05:26:02,291 INFO L276 IsEmpty]: Start isEmpty. Operand has 27 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:02,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-11 05:26:02,294 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:26:02,294 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:26:02,295 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:02,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:02,298 INFO L85 PathProgramCache]: Analyzing trace with hash 528270610, now seen corresponding path program 1 times [2022-01-11 05:26:02,303 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:02,303 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1256246191] [2022-01-11 05:26:02,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:02,304 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:02,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:02,421 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-11 05:26:02,421 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:02,422 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1256246191] [2022-01-11 05:26:02,422 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1256246191] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:26:02,422 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:26:02,423 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 05:26:02,424 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230308696] [2022-01-11 05:26:02,425 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:26:02,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-11 05:26:02,427 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:26:02,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-11 05:26:02,449 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 05:26:02,450 INFO L87 Difference]: Start difference. First operand has 27 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:02,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:26:02,462 INFO L93 Difference]: Finished difference Result 46 states and 64 transitions. [2022-01-11 05:26:02,463 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-11 05:26:02,464 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-01-11 05:26:02,464 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:26:02,469 INFO L225 Difference]: With dead ends: 46 [2022-01-11 05:26:02,469 INFO L226 Difference]: Without dead ends: 20 [2022-01-11 05:26:02,471 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 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-11 05:26:02,474 INFO L933 BasicCegarLoop]: 34 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, 34 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-11 05:26:02,474 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:26:02,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-01-11 05:26:02,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-01-11 05:26:02,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.263157894736842) internal successors, (24), 19 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:02,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 24 transitions. [2022-01-11 05:26:02,495 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 24 transitions. Word has length 14 [2022-01-11 05:26:02,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:26:02,495 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 24 transitions. [2022-01-11 05:26:02,496 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:02,496 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 24 transitions. [2022-01-11 05:26:02,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-11 05:26:02,496 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:26:02,496 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:26:02,496 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 05:26:02,497 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:02,497 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:02,497 INFO L85 PathProgramCache]: Analyzing trace with hash 657354290, now seen corresponding path program 1 times [2022-01-11 05:26:02,497 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:02,497 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077749418] [2022-01-11 05:26:02,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:02,498 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:02,568 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:02,781 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-11 05:26:02,782 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:02,782 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077749418] [2022-01-11 05:26:02,782 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077749418] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:26:02,782 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:26:02,782 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-11 05:26:02,782 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157091064] [2022-01-11 05:26:02,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:26:02,784 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-11 05:26:02,784 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:26:02,785 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-11 05:26:02,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-01-11 05:26:02,785 INFO L87 Difference]: Start difference. First operand 20 states and 24 transitions. Second operand has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:02,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:26:02,922 INFO L93 Difference]: Finished difference Result 27 states and 31 transitions. [2022-01-11 05:26:02,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 05:26:02,923 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-01-11 05:26:02,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:26:02,923 INFO L225 Difference]: With dead ends: 27 [2022-01-11 05:26:02,924 INFO L226 Difference]: Without dead ends: 24 [2022-01-11 05:26:02,924 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=103, Unknown=0, NotChecked=0, Total=156 [2022-01-11 05:26:02,925 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 82 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 34 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:26:02,925 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [82 Valid, 65 Invalid, 34 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:26:02,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-01-11 05:26:02,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 21. [2022-01-11 05:26:02,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:02,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2022-01-11 05:26:02,933 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 14 [2022-01-11 05:26:02,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:26:02,934 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2022-01-11 05:26:02,934 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.75) internal successors, (14), 8 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:02,934 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2022-01-11 05:26:02,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-11 05:26:02,934 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:26:02,934 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:26:02,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 05:26:02,935 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:02,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:02,935 INFO L85 PathProgramCache]: Analyzing trace with hash 657355313, now seen corresponding path program 1 times [2022-01-11 05:26:02,935 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:02,935 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1006878746] [2022-01-11 05:26:02,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:02,936 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:02,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:03,209 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-11 05:26:03,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:03,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1006878746] [2022-01-11 05:26:03,210 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1006878746] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:26:03,210 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:26:03,211 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-11 05:26:03,211 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215611554] [2022-01-11 05:26:03,211 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:26:03,211 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-11 05:26:03,212 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:26:03,212 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-11 05:26:03,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-11 05:26:03,213 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:03,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:26:03,453 INFO L93 Difference]: Finished difference Result 59 states and 71 transitions. [2022-01-11 05:26:03,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-11 05:26:03,453 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-01-11 05:26:03,453 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:26:03,454 INFO L225 Difference]: With dead ends: 59 [2022-01-11 05:26:03,454 INFO L226 Difference]: Without dead ends: 40 [2022-01-11 05:26:03,454 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-01-11 05:26:03,455 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 23 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 69 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 69 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:26:03,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 74 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 69 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:26:03,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2022-01-11 05:26:03,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 31. [2022-01-11 05:26:03,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:03,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-01-11 05:26:03,459 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 14 [2022-01-11 05:26:03,459 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:26:03,459 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-01-11 05:26:03,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:03,460 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-01-11 05:26:03,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-11 05:26:03,460 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:26:03,460 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:26:03,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 05:26:03,460 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:03,461 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:03,461 INFO L85 PathProgramCache]: Analyzing trace with hash 685984464, now seen corresponding path program 1 times [2022-01-11 05:26:03,461 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:03,461 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [395313092] [2022-01-11 05:26:03,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:03,461 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:03,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:03,529 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-11 05:26:03,529 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:03,529 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [395313092] [2022-01-11 05:26:03,529 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [395313092] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:26:03,530 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:26:03,530 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:26:03,530 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [185136883] [2022-01-11 05:26:03,530 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:26:03,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:26:03,530 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:26:03,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:26:03,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:26:03,531 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:03,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:26:03,551 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-01-11 05:26:03,551 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:26:03,552 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-01-11 05:26:03,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:26:03,552 INFO L225 Difference]: With dead ends: 40 [2022-01-11 05:26:03,552 INFO L226 Difference]: Without dead ends: 26 [2022-01-11 05:26:03,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 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-11 05:26:03,553 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 4 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 42 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-11 05:26:03,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 42 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:26:03,554 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2022-01-11 05:26:03,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2022-01-11 05:26:03,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:03,556 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-01-11 05:26:03,556 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 14 [2022-01-11 05:26:03,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:26:03,557 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-01-11 05:26:03,557 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:03,557 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-01-11 05:26:03,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-01-11 05:26:03,557 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:26:03,557 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-11 05:26:03,557 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 05:26:03,557 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:03,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:03,558 INFO L85 PathProgramCache]: Analyzing trace with hash -318556874, now seen corresponding path program 1 times [2022-01-11 05:26:03,558 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:03,558 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104447477] [2022-01-11 05:26:03,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:03,558 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:03,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:03,641 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:26:03,642 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:03,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104447477] [2022-01-11 05:26:03,642 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1104447477] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:26:03,642 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1759824532] [2022-01-11 05:26:03,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:03,642 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:03,642 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:26:03,644 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:26:03,645 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-11 05:26:03,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:03,780 INFO L263 TraceCheckSpWp]: Trace formula consists of 476 conjuncts, 68 conjunts are in the unsatisfiable core [2022-01-11 05:26:03,786 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:26:03,841 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-11 05:26:04,003 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-11 05:26:04,004 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2022-01-11 05:26:04,079 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-11 05:26:04,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:04,089 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-11 05:26:04,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:04,150 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 23 treesize of output 22 [2022-01-11 05:26:04,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:04,164 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-11 05:26:04,219 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-01-11 05:26:04,224 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-11 05:26:04,286 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-11 05:26:04,293 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:04,295 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-11 05:26:04,300 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-11 05:26:04,371 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 32 treesize of output 20 [2022-01-11 05:26:04,375 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2022-01-11 05:26:04,408 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-11 05:26:04,427 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:26:04,427 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 05:26:04,427 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1759824532] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:26:04,427 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 05:26:04,427 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [13] imperfect sequences [4] total 15 [2022-01-11 05:26:04,427 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [864393615] [2022-01-11 05:26:04,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:26:04,428 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-01-11 05:26:04,428 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:26:04,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-01-11 05:26:04,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=178, Unknown=0, NotChecked=0, Total=210 [2022-01-11 05:26:04,428 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:04,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:26:04,917 INFO L93 Difference]: Finished difference Result 30 states and 34 transitions. [2022-01-11 05:26:04,917 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-01-11 05:26:04,917 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-01-11 05:26:04,917 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:26:04,918 INFO L225 Difference]: With dead ends: 30 [2022-01-11 05:26:04,918 INFO L226 Difference]: Without dead ends: 28 [2022-01-11 05:26:04,918 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=127, Invalid=425, Unknown=0, NotChecked=0, Total=552 [2022-01-11 05:26:04,919 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 68 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 41 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 05:26:04,919 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 41 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 05:26:04,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-11 05:26:04,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 26. [2022-01-11 05:26:04,922 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:04,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 30 transitions. [2022-01-11 05:26:04,922 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 30 transitions. Word has length 19 [2022-01-11 05:26:04,922 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:26:04,922 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 30 transitions. [2022-01-11 05:26:04,923 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 1.4615384615384615) internal successors, (19), 13 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:04,923 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 30 transitions. [2022-01-11 05:26:04,923 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-01-11 05:26:04,923 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:26:04,923 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:26:04,942 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-11 05:26:05,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:05,131 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:05,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:05,131 INFO L85 PathProgramCache]: Analyzing trace with hash -1190449997, now seen corresponding path program 1 times [2022-01-11 05:26:05,131 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:05,131 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1593887803] [2022-01-11 05:26:05,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:05,132 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:05,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:05,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:26:05,209 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:05,209 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1593887803] [2022-01-11 05:26:05,209 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1593887803] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:26:05,210 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1578186279] [2022-01-11 05:26:05,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:05,210 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:05,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:26:05,211 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:26:05,244 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-11 05:26:05,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:05,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 508 conjuncts, 54 conjunts are in the unsatisfiable core [2022-01-11 05:26:05,358 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:26:05,378 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-11 05:26:05,524 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-11 05:26:05,524 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 18 [2022-01-11 05:26:05,573 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:05,574 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 23 treesize of output 23 [2022-01-11 05:26:05,615 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:05,616 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2022-01-11 05:26:05,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:05,685 INFO L353 Elim1Store]: treesize reduction 24, result has 38.5 percent of original size [2022-01-11 05:26:05,685 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 50 treesize of output 56 [2022-01-11 05:26:05,697 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 19 treesize of output 15 [2022-01-11 05:26:05,761 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:05,762 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 34 [2022-01-11 05:26:05,766 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-11 05:26:05,804 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 52 treesize of output 40 [2022-01-11 05:26:05,859 INFO L353 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-01-11 05:26:05,859 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 61 treesize of output 20 [2022-01-11 05:26:05,904 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:26:05,904 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:26:05,983 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 86 treesize of output 82 [2022-01-11 05:26:06,075 WARN L838 $PredicateComparison]: unable to prove that (and (or (and (= |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|)) (forall ((v_arrayElimCell_24 Int) (v_ArrVal_368 (Array Int Int))) (not (= (select (let ((.cse0 (let ((.cse1 (store |c_#memory_$Pointer$.baseInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt|) v_ArrVal_368))) (store .cse1 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt| (store (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~new_head~1#1.baseInt|))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (mod (+ 4 v_arrayElimCell_24) 18446744073709551616)) 0)))) (forall ((v_ArrVal_368 (Array Int Int))) (not (= (select (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$.baseInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt|) v_ArrVal_368))) (store .cse3 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt| (store (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~new_head~1#1.baseInt|))))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (mod (+ 4 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~new_head~1#1.offsetInt|) 18446744073709551616)) 0)))) is different from false [2022-01-11 05:26:06,123 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_dll_prepend_~new_head~1#1.offsetInt_1| Int) (v_ArrVal_368 (Array Int Int))) (not (= 0 (let ((.cse3 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_dll_prepend_~new_head~1#1.offsetInt_1| 4) 18446744073709551616))) (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) .cse3 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt|))))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt|) v_ArrVal_368)))) (store .cse1 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt| (store (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) .cse3))))) (or (and (= |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|)) (forall ((v_arrayElimCell_24 Int) (|v_ULTIMATE.start_ULTIMATE.start_dll_prepend_~new_head~1#1.offsetInt_1| Int) (v_ArrVal_368 (Array Int Int))) (not (= (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|) (mod (+ |v_ULTIMATE.start_ULTIMATE.start_dll_prepend_~new_head~1#1.offsetInt_1| 4) 18446744073709551616) (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt|))))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt|) v_ArrVal_368)))) (store .cse5 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt| (store (select .cse5 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_#res#1.baseInt|))))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (mod (+ 4 v_arrayElimCell_24) 18446744073709551616)) 0))))) is different from false [2022-01-11 05:26:06,146 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_ULTIMATE.start_dll_prepend_~new_head~1#1.offsetInt_1| Int) (v_ArrVal_365 (Array Int Int)) (v_ArrVal_368 (Array Int Int))) (not (= (let ((.cse3 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_dll_prepend_~new_head~1#1.offsetInt_1| 4) 18446744073709551616))) (select (let ((.cse0 (let ((.cse1 (let ((.cse2 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| (store v_ArrVal_365 .cse3 (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_365) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt|))))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt|) v_ArrVal_368)))) (store .cse1 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt| (store (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|))))) (select .cse0 (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) .cse3)) 0))) (or (and (= |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|)) (forall ((v_arrayElimCell_24 Int) (|v_ULTIMATE.start_ULTIMATE.start_dll_prepend_~new_head~1#1.offsetInt_1| Int) (v_ArrVal_365 (Array Int Int)) (v_ArrVal_368 (Array Int Int))) (not (= (select (let ((.cse4 (let ((.cse5 (let ((.cse6 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| (store v_ArrVal_365 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_dll_prepend_~new_head~1#1.offsetInt_1| 4) 18446744073709551616) (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_365) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt|))))) (store .cse6 (select (select .cse6 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt|) v_ArrVal_368)))) (store .cse5 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt| (store (select .cse5 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|))))) (select .cse4 (select (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (mod (+ 4 v_arrayElimCell_24) 18446744073709551616)) 0))))) is different from false [2022-01-11 05:26:06,201 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 4246 treesize of output 3996 [2022-01-11 05:26:06,225 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:26:06,225 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 4224 treesize of output 3938 [2022-01-11 05:26:06,277 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 4681 treesize of output 4237 [2022-01-11 05:26:06,301 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 4784 treesize of output 4600 [2022-01-11 05:26:07,037 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 25 treesize of output 21 [2022-01-11 05:26:07,066 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:26:07,066 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1578186279] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:26:07,066 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:26:07,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 14, 14] total 26 [2022-01-11 05:26:07,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351311888] [2022-01-11 05:26:07,066 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:26:07,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-11 05:26:07,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:26:07,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-11 05:26:07,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=450, Unknown=3, NotChecked=132, Total=650 [2022-01-11 05:26:07,067 INFO L87 Difference]: Start difference. First operand 26 states and 30 transitions. Second operand has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:07,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:26:07,682 INFO L93 Difference]: Finished difference Result 53 states and 63 transitions. [2022-01-11 05:26:07,682 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-11 05:26:07,683 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-01-11 05:26:07,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:26:07,683 INFO L225 Difference]: With dead ends: 53 [2022-01-11 05:26:07,683 INFO L226 Difference]: Without dead ends: 33 [2022-01-11 05:26:07,684 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 22 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=136, Invalid=865, Unknown=3, NotChecked=186, Total=1190 [2022-01-11 05:26:07,684 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 47 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 167 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 117 SdHoareTripleChecker+Invalid, 335 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 167 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 145 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 05:26:07,684 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 117 Invalid, 335 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 167 Invalid, 0 Unknown, 145 Unchecked, 0.2s Time] [2022-01-11 05:26:07,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-11 05:26:07,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 29. [2022-01-11 05:26:07,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.1428571428571428) internal successors, (32), 28 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:07,688 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2022-01-11 05:26:07,689 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 21 [2022-01-11 05:26:07,689 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:26:07,689 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2022-01-11 05:26:07,689 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 2.1153846153846154) internal successors, (55), 26 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:07,689 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2022-01-11 05:26:07,689 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-11 05:26:07,689 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:26:07,689 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:26:07,709 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-11 05:26:07,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-11 05:26:07,899 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:07,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:07,900 INFO L85 PathProgramCache]: Analyzing trace with hash 666439726, now seen corresponding path program 1 times [2022-01-11 05:26:07,900 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:07,900 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [138833501] [2022-01-11 05:26:07,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:07,900 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:08,106 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:09,325 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 1 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:26:09,326 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:09,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [138833501] [2022-01-11 05:26:09,326 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [138833501] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:26:09,326 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [627009963] [2022-01-11 05:26:09,326 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:09,326 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:09,326 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:26:09,329 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:26:09,330 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-11 05:26:09,678 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:09,683 INFO L263 TraceCheckSpWp]: Trace formula consists of 640 conjuncts, 119 conjunts are in the unsatisfiable core [2022-01-11 05:26:09,687 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:26:09,708 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-11 05:26:09,850 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-11 05:26:09,850 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 24 treesize of output 26 [2022-01-11 05:26:09,950 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:09,951 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:09,952 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:09,953 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 30 [2022-01-11 05:26:10,014 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-01-11 05:26:10,269 INFO L353 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2022-01-11 05:26:10,272 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 25 [2022-01-11 05:26:10,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:10,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:10,394 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:10,416 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:10,418 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 57 [2022-01-11 05:26:10,425 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-01-11 05:26:10,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:10,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:10,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:10,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:10,435 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 5 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 54 [2022-01-11 05:26:10,591 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:10,592 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:10,593 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 56 [2022-01-11 05:26:10,599 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 24 [2022-01-11 05:26:10,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:10,606 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:10,607 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 71 treesize of output 53 [2022-01-11 05:26:10,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:10,745 INFO L353 Elim1Store]: treesize reduction 28, result has 28.2 percent of original size [2022-01-11 05:26:10,748 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 106 treesize of output 98 [2022-01-11 05:26:10,773 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:10,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, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 38 [2022-01-11 05:26:10,778 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:10,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:10,780 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 63 [2022-01-11 05:26:10,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:10,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:10,854 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 70 treesize of output 56 [2022-01-11 05:26:10,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:10,863 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 30 treesize of output 32 [2022-01-11 05:26:10,867 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:10,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:10,869 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 69 [2022-01-11 05:26:11,080 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:11,081 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:11,082 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:11,084 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:26:11,084 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 103 [2022-01-11 05:26:11,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:11,090 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-11 05:26:11,091 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 94 treesize of output 40 [2022-01-11 05:26:11,174 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-11 05:26:11,182 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:26:11,183 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:26:11,656 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_552 Int) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_550 (Array Int Int)) (v_ArrVal_553 (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt|))) (let ((.cse4 (let ((.cse9 (store |c_#memory_$Pointer$.offsetInt| .cse3 v_ArrVal_550))) (store .cse9 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt| (store (select .cse9 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~new_head~1#1.offsetInt|))))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (.cse7 (let ((.cse8 (store |c_#memory_$Pointer$.baseInt| .cse3 v_ArrVal_549))) (store .cse8 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt| (store (select .cse8 |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~new_head~1#1.baseInt|))))) (let ((.cse5 (select (select .cse7 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (.cse6 (mod (+ .cse2 4) 18446744073709551616))) (let ((.cse0 (select (select .cse7 .cse5) .cse6)) (.cse1 (select (select .cse4 .cse5) .cse6))) (or (and (= .cse0 0) (= .cse1 0)) (not (<= 0 .cse1)) (not (<= 0 .cse2)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (select (select (store (store |c_#memory_intInt| .cse3 (store (select |c_#memory_intInt| .cse3) (mod (+ (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.offsetInt|) 12) 18446744073709551616) v_ArrVal_552)) |c_ULTIMATE.start_ULTIMATE.start_dll_prepend_~head#1.baseInt| v_ArrVal_553) .cse0) .cse1))))))))) is different from false [2022-01-11 05:26:21,595 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:26:21,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:26:21,596 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:26:26,026 INFO L353 Elim1Store]: treesize reduction 439, result has 33.0 percent of original size [2022-01-11 05:26:26,027 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 311617 treesize of output 248788 [2022-01-11 05:26:26,425 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:26:26,426 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:26:26,427 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:26:34,611 WARN L228 SmtUtils]: Spent 8.17s on a formula simplification. DAG size of input: 98 DAG size of output: 74 (called from [L 350] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-01-11 05:26:34,611 INFO L353 Elim1Store]: treesize reduction 439, result has 33.0 percent of original size [2022-01-11 05:26:34,613 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 12 case distinctions, treesize of input 21963755 treesize of output 13893238 [2022-01-11 05:26:53,640 WARN L228 SmtUtils]: Spent 19.02s on a formula simplification. DAG size of input: 1759 DAG size of output: 1761 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-01-11 05:27:03,029 WARN L228 SmtUtils]: Spent 9.38s on a formula simplification that was a NOOP. DAG size: 1755 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-01-11 05:27:03,962 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:27:03,964 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 60632981 treesize of output 58364841