/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_NONE.epf -i ../../../trunk/examples/svcomp/list-simple/dll2c_insert_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 23:37:17,444 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 23:37:17,446 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 23:37:17,488 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 23:37:17,489 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 23:37:17,503 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 23:37:17,504 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 23:37:17,506 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 23:37:17,507 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 23:37:17,508 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 23:37:17,508 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 23:37:17,509 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 23:37:17,509 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 23:37:17,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 23:37:17,510 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 23:37:17,511 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 23:37:17,512 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 23:37:17,512 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 23:37:17,513 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 23:37:17,514 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 23:37:17,515 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 23:37:17,520 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 23:37:17,520 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 23:37:17,521 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 23:37:17,522 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 23:37:17,522 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 23:37:17,522 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 23:37:17,523 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 23:37:17,523 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 23:37:17,524 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 23:37:17,524 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 23:37:17,524 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 23:37:17,525 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 23:37:17,525 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 23:37:17,526 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 23:37:17,526 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 23:37:17,526 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 23:37:17,526 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 23:37:17,527 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 23:37:17,527 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 23:37:17,527 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 23:37:17,534 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 23:37:17,552 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 23:37:17,552 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 23:37:17,553 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 23:37:17,553 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 23:37:17,554 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 23:37:17,554 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 23:37:17,554 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 23:37:17,554 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 23:37:17,554 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 23:37:17,554 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 23:37:17,555 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 23:37:17,555 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 23:37:17,555 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 23:37:17,555 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 23:37:17,555 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 23:37:17,555 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 23:37:17,555 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 23:37:17,555 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 23:37:17,555 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 23:37:17,555 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 23:37:17,555 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 23:37:17,556 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:37:17,556 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 23:37:17,557 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 23:37:17,557 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 23:37:17,557 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 23:37:17,557 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 23:37:17,557 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 23:37:17,557 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 23:37:17,557 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 23:37:17,557 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 23:37:17,557 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 23:37:17,558 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 23:37:17,558 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 23:37:17,748 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 23:37:17,768 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 23:37:17,770 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 23:37:17,771 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 23:37:17,772 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 23:37:17,773 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_insert_equal.i [2022-01-10 23:37:17,823 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d47ae6d76/5605b579c53140fa994dada98038e360/FLAG1ec768203 [2022-01-10 23:37:18,186 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 23:37:18,186 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_insert_equal.i [2022-01-10 23:37:18,196 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d47ae6d76/5605b579c53140fa994dada98038e360/FLAG1ec768203 [2022-01-10 23:37:18,213 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d47ae6d76/5605b579c53140fa994dada98038e360 [2022-01-10 23:37:18,216 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 23:37:18,217 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 23:37:18,219 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 23:37:18,219 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 23:37:18,221 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 23:37:18,222 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:37:18" (1/1) ... [2022-01-10 23:37:18,222 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1805f127 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:18, skipping insertion in model container [2022-01-10 23:37:18,222 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:37:18" (1/1) ... [2022-01-10 23:37:18,226 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 23:37:18,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 23:37:18,529 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/dll2c_insert_equal.i[24877,24890] [2022-01-10 23:37:18,530 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:37:18,538 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 23:37:18,577 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/dll2c_insert_equal.i[24877,24890] [2022-01-10 23:37:18,577 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:37:18,602 INFO L208 MainTranslator]: Completed translation [2022-01-10 23:37:18,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:18 WrapperNode [2022-01-10 23:37:18,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 23:37:18,603 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 23:37:18,603 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 23:37:18,603 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 23:37:18,607 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:18" (1/1) ... [2022-01-10 23:37:18,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:18" (1/1) ... [2022-01-10 23:37:18,637 INFO L137 Inliner]: procedures = 130, calls = 53, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 183 [2022-01-10 23:37:18,637 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 23:37:18,637 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 23:37:18,637 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 23:37:18,638 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 23:37:18,646 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:18" (1/1) ... [2022-01-10 23:37:18,646 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:18" (1/1) ... [2022-01-10 23:37:18,649 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:18" (1/1) ... [2022-01-10 23:37:18,649 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:18" (1/1) ... [2022-01-10 23:37:18,659 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:18" (1/1) ... [2022-01-10 23:37:18,664 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:18" (1/1) ... [2022-01-10 23:37:18,667 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:18" (1/1) ... [2022-01-10 23:37:18,669 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 23:37:18,670 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 23:37:18,670 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 23:37:18,670 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 23:37:18,671 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:18" (1/1) ... [2022-01-10 23:37:18,690 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:37:18,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:37:18,714 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 23:37:18,719 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 23:37:18,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 23:37:18,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 23:37:18,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 23:37:18,737 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-10 23:37:18,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 23:37:18,737 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 23:37:18,737 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 23:37:18,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 23:37:18,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-10 23:37:18,737 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 23:37:18,738 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 23:37:18,738 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 23:37:18,814 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 23:37:18,815 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 23:37:19,301 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 23:37:19,305 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 23:37:19,305 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-01-10 23:37:19,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:37:19 BoogieIcfgContainer [2022-01-10 23:37:19,307 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 23:37:19,307 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 23:37:19,307 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 23:37:19,308 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 23:37:19,310 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:37:19" (1/1) ... [2022-01-10 23:37:19,401 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:37:19 BasicIcfg [2022-01-10 23:37:19,401 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 23:37:19,402 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 23:37:19,402 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 23:37:19,405 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 23:37:19,405 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:37:18" (1/4) ... [2022-01-10 23:37:19,405 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3470c62f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:37:19, skipping insertion in model container [2022-01-10 23:37:19,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:37:18" (2/4) ... [2022-01-10 23:37:19,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3470c62f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:37:19, skipping insertion in model container [2022-01-10 23:37:19,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:37:19" (3/4) ... [2022-01-10 23:37:19,406 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3470c62f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:37:19, skipping insertion in model container [2022-01-10 23:37:19,406 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:37:19" (4/4) ... [2022-01-10 23:37:19,407 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_insert_equal.iTransformedIcfg [2022-01-10 23:37:19,413 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 23:37:19,413 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 23:37:19,438 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 23:37:19,442 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 23:37:19,442 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 23:37:19,450 INFO L276 IsEmpty]: Start isEmpty. Operand has 38 states, 36 states have (on average 1.5) internal successors, (54), 37 states have internal predecessors, (54), 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-10 23:37:19,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 23:37:19,453 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:37:19,453 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:37:19,454 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:37:19,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:37:19,460 INFO L85 PathProgramCache]: Analyzing trace with hash -606815941, now seen corresponding path program 1 times [2022-01-10 23:37:19,464 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:37:19,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314415900] [2022-01-10 23:37:19,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:37:19,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:37:19,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:37:19,695 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:37:19,696 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:37:19,696 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314415900] [2022-01-10 23:37:19,696 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314415900] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:37:19,697 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:37:19,697 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 23:37:19,698 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803269808] [2022-01-10 23:37:19,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:37:19,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 23:37:19,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:37:19,722 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 23:37:19,722 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 23:37:19,724 INFO L87 Difference]: Start difference. First operand has 38 states, 36 states have (on average 1.5) internal successors, (54), 37 states have internal predecessors, (54), 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 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-10 23:37:19,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:37:19,738 INFO L93 Difference]: Finished difference Result 63 states and 90 transitions. [2022-01-10 23:37:19,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 23:37:19,739 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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 17 [2022-01-10 23:37:19,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:37:19,744 INFO L225 Difference]: With dead ends: 63 [2022-01-10 23:37:19,744 INFO L226 Difference]: Without dead ends: 28 [2022-01-10 23:37:19,746 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-10 23:37:19,748 INFO L933 BasicCegarLoop]: 49 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, 49 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:37:19,749 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:37:19,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-10 23:37:19,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-01-10 23:37:19,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 states have internal predecessors, (34), 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-10 23:37:19,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-01-10 23:37:19,774 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 17 [2022-01-10 23:37:19,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:37:19,774 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-01-10 23:37:19,774 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 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-10 23:37:19,775 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-01-10 23:37:19,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 23:37:19,776 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:37:19,776 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:37:19,776 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 23:37:19,777 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:37:19,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:37:19,778 INFO L85 PathProgramCache]: Analyzing trace with hash -477733222, now seen corresponding path program 1 times [2022-01-10 23:37:19,778 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:37:19,779 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1237913399] [2022-01-10 23:37:19,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:37:19,779 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:37:19,884 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:37:19,972 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:37:19,973 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:37:19,973 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1237913399] [2022-01-10 23:37:19,973 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1237913399] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:37:19,973 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:37:19,973 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:37:19,973 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725390566] [2022-01-10 23:37:19,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:37:19,974 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:37:19,974 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:37:19,975 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:37:19,975 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:37:19,975 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-10 23:37:20,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:37:20,012 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-01-10 23:37:20,013 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:37:20,013 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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 17 [2022-01-10 23:37:20,013 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:37:20,014 INFO L225 Difference]: With dead ends: 46 [2022-01-10 23:37:20,014 INFO L226 Difference]: Without dead ends: 38 [2022-01-10 23:37:20,014 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-10 23:37:20,015 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 13 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:37:20,016 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 68 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:37:20,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-01-10 23:37:20,018 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 30. [2022-01-10 23:37:20,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.2758620689655173) internal successors, (37), 29 states have internal predecessors, (37), 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-10 23:37:20,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2022-01-10 23:37:20,019 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 17 [2022-01-10 23:37:20,019 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:37:20,020 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2022-01-10 23:37:20,020 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 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-10 23:37:20,020 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2022-01-10 23:37:20,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 23:37:20,020 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:37:20,020 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:37:20,020 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 23:37:20,021 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:37:20,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:37:20,021 INFO L85 PathProgramCache]: Analyzing trace with hash -1096521863, now seen corresponding path program 1 times [2022-01-10 23:37:20,021 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:37:20,021 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1137687827] [2022-01-10 23:37:20,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:37:20,022 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:37:20,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:37:20,179 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-10 23:37:20,179 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:37:20,179 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1137687827] [2022-01-10 23:37:20,179 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1137687827] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:37:20,180 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:37:20,180 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:37:20,180 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [504567597] [2022-01-10 23:37:20,180 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:37:20,180 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:37:20,180 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:37:20,181 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:37:20,181 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:37:20,181 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10 23:37:20,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:37:20,191 INFO L93 Difference]: Finished difference Result 50 states and 63 transitions. [2022-01-10 23:37:20,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:37:20,192 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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 18 [2022-01-10 23:37:20,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:37:20,192 INFO L225 Difference]: With dead ends: 50 [2022-01-10 23:37:20,192 INFO L226 Difference]: Without dead ends: 31 [2022-01-10 23:37:20,193 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-10 23:37:20,194 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 6 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 4 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:37:20,194 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 54 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:37:20,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-01-10 23:37:20,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 31. [2022-01-10 23:37:20,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2666666666666666) internal successors, (38), 30 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-10 23:37:20,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-01-10 23:37:20,198 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 18 [2022-01-10 23:37:20,198 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:37:20,198 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-01-10 23:37:20,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 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-10 23:37:20,199 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-01-10 23:37:20,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 23:37:20,200 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:37:20,200 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, 1, 1, 1] [2022-01-10 23:37:20,200 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 23:37:20,201 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:37:20,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:37:20,201 INFO L85 PathProgramCache]: Analyzing trace with hash 946503280, now seen corresponding path program 1 times [2022-01-10 23:37:20,201 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:37:20,201 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1654786820] [2022-01-10 23:37:20,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:37:20,202 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:37:20,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:37:22,321 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-10 23:37:22,322 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:37:22,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1654786820] [2022-01-10 23:37:22,322 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1654786820] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:37:22,322 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1497780925] [2022-01-10 23:37:22,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:37:22,322 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:37:22,323 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:37:22,335 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-10 23:37:22,336 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-10 23:37:23,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:37:23,463 INFO L263 TraceCheckSpWp]: Trace formula consists of 719 conjuncts, 167 conjunts are in the unsatisfiable core [2022-01-10 23:37:23,472 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:37:23,552 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:23,558 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 9 treesize of output 11 [2022-01-10 23:37:23,812 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-10 23:37:23,814 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-01-10 23:37:23,970 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-01-10 23:37:24,087 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-10 23:37:24,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:24,100 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 23 treesize of output 22 [2022-01-10 23:37:24,233 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 23:37:24,234 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2022-01-10 23:37:24,240 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-10 23:37:24,517 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:24,518 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:37:24,528 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-01-10 23:37:24,529 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 114 treesize of output 71 [2022-01-10 23:37:24,541 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 15 [2022-01-10 23:37:24,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:24,556 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 34 treesize of output 31 [2022-01-10 23:37:24,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:24,564 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 26 [2022-01-10 23:37:24,720 INFO L353 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2022-01-10 23:37:24,720 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 32 treesize of output 34 [2022-01-10 23:37:24,945 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:24,961 INFO L353 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-01-10 23:37:24,962 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 119 treesize of output 105 [2022-01-10 23:37:24,969 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 29 treesize of output 31 [2022-01-10 23:37:24,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:24,975 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 116 treesize of output 106 [2022-01-10 23:37:24,984 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 8 treesize of output 7 [2022-01-10 23:37:25,705 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:37:25,706 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:37:25,736 INFO L353 Elim1Store]: treesize reduction 56, result has 21.1 percent of original size [2022-01-10 23:37:25,737 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 326 treesize of output 161 [2022-01-10 23:37:25,765 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:25,840 INFO L353 Elim1Store]: treesize reduction 184, result has 14.4 percent of original size [2022-01-10 23:37:25,840 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 7 new quantified variables, introduced 8 case distinctions, treesize of input 376 treesize of output 296 [2022-01-10 23:37:25,869 INFO L353 Elim1Store]: treesize reduction 25, result has 37.5 percent of original size [2022-01-10 23:37:25,870 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 340 treesize of output 300 [2022-01-10 23:37:25,883 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:25,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 7 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 104 [2022-01-10 23:37:25,895 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:25,898 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:25,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:25,935 INFO L353 Elim1Store]: treesize reduction 122, result has 24.2 percent of original size [2022-01-10 23:37:25,935 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 330 treesize of output 309 [2022-01-10 23:37:25,951 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 45 treesize of output 50 [2022-01-10 23:37:25,965 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 12 treesize of output 11 [2022-01-10 23:37:25,977 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 23 [2022-01-10 23:37:25,986 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 12 treesize of output 11 [2022-01-10 23:37:26,314 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:26,315 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:26,319 INFO L353 Elim1Store]: treesize reduction 28, result has 3.4 percent of original size [2022-01-10 23:37:26,320 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 247 treesize of output 212 [2022-01-10 23:37:26,359 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2022-01-10 23:37:26,393 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:26,397 INFO L353 Elim1Store]: treesize reduction 40, result has 2.4 percent of original size [2022-01-10 23:37:26,402 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 227 treesize of output 163 [2022-01-10 23:37:26,408 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 21 treesize of output 15 [2022-01-10 23:37:26,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:26,873 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:37:26,873 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 23:37:26,885 INFO L353 Elim1Store]: treesize reduction 37, result has 24.5 percent of original size [2022-01-10 23:37:26,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 158 treesize of output 77 [2022-01-10 23:37:26,894 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:37:26,895 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 24 [2022-01-10 23:37:27,001 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 10 [2022-01-10 23:37:27,030 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-10 23:37:27,030 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:37:27,191 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_557 (Array Int Int)) (v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_564 Int) (v_ArrVal_563 Int) (v_ArrVal_550 Int) (v_ArrVal_549 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~last~1#1.offsetInt| Int) (v_ArrVal_554 (Array Int Int))) (let ((.cse2 (mod (+ 8 |ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~last~1#1.offsetInt|) 18446744073709551616))) (let ((.cse3 (select (select (store (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.baseInt| v_ArrVal_545) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_549) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~last~1#1.baseInt| (store (select (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.baseInt| v_ArrVal_551) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_554) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~last~1#1.baseInt|) .cse2 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offsetInt|)) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (or (= (select (select (store (let ((.cse0 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.baseInt| (store (select |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offsetInt| v_ArrVal_564)))) (store .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~new_node~0#1.baseInt| (store (store (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~new_node~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_550) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~new_node~0#1.offsetInt| v_ArrVal_563))) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~last~1#1.baseInt| v_ArrVal_540) (select (select (let ((.cse1 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~snd_to_last~0#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~new_node~0#1.baseInt|)))) (store (store .cse1 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_546) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~last~1#1.baseInt| (store (select (store .cse1 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~new_node~0#1.baseInt| v_ArrVal_557) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~last~1#1.baseInt|) .cse2 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~new_node~0#1.baseInt|))) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (mod (+ 16 .cse3) 18446744073709551616)) |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int|) (not (<= 0 .cse3)))))) is different from false [2022-01-10 23:37:27,582 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:37:27,583 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 372 treesize of output 355 [2022-01-10 23:37:27,877 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_7 (Array Int Int)) (v_ArrVal_540 (Array Int Int)) (v_ArrVal_551 (Array Int Int)) (v_ArrVal_554 (Array Int Int)) (v_ArrVal_557 (Array Int Int)) (v_ArrVal_546 (Array Int Int)) (v_ArrVal_534 (Array Int Int)) (v_ArrVal_545 (Array Int Int)) (v_ArrVal_564 Int) (v_ArrVal_563 Int) (v_ArrVal_539 (Array Int Int)) (v_ArrVal_550 Int) (v_ArrVal_549 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~last~1#1.offsetInt_3| Int)) (let ((.cse8 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_534))) (let ((.cse10 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_539)) (.cse3 (select (select .cse8 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~head#1.offsetInt|))) (let ((.cse9 (select .cse8 .cse3)) (.cse4 (select (select .cse10 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~head#1.offsetInt|))) (let ((.cse5 (select .cse9 .cse4)) (.cse7 (mod (+ |v_ULTIMATE.start_ULTIMATE.start_dll_circular_insert_~last~1#1.offsetInt_3| 8) 18446744073709551616))) (let ((.cse0 (select (select (store (store (store .cse10 .cse3 v_ArrVal_545) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_549) .cse5 (store (select (store (store .cse10 .cse3 v_ArrVal_551) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_554) .cse5) .cse7 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|)) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (or (not (<= 0 .cse0)) (= |c_ULTIMATE.start_ULTIMATE.start_main_~data~0#1Int| (select (select (store (let ((.cse1 (let ((.cse2 (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_arrayElimArr_7))) (store .cse2 .cse3 (store (select .cse2 .cse3) .cse4 v_ArrVal_564))))) (store .cse1 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| (store (store (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_550) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| v_ArrVal_563))) .cse5 v_ArrVal_540) (select (select (let ((.cse6 (store .cse8 .cse3 (store .cse9 .cse4 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|)))) (store (store .cse6 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_546) .cse5 (store (select (store .cse6 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_557) .cse5) .cse7 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|))) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (mod (+ 16 .cse0) 18446744073709551616))) (not (= (select v_arrayElimArr_7 (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|) 18446744073709551616)) |c_ULTIMATE.start_ULTIMATE.start_node_create_~data#1Int|)) (not (<= 0 .cse4))))))))) is different from false [2022-01-10 23:37:51,230 WARN L228 SmtUtils]: Spent 22.34s on a formula simplification that was a NOOP. DAG size: 80 (called from [L 350] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-01-10 23:37:51,230 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:37:51,235 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 26366387292 treesize of output 26236485136