/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/dll2c_prepend_equal.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 05:25:22,901 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 05:25:22,903 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 05:25:22,929 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 05:25:22,929 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 05:25:22,933 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 05:25:22,937 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 05:25:22,938 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 05:25:22,940 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 05:25:22,940 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 05:25:22,941 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 05:25:22,942 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 05:25:22,942 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 05:25:22,943 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 05:25:22,944 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 05:25:22,945 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 05:25:22,945 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 05:25:22,946 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 05:25:22,951 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 05:25:22,959 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 05:25:22,967 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 05:25:22,968 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 05:25:22,969 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 05:25:22,969 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 05:25:22,971 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 05:25:22,972 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 05:25:22,972 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 05:25:22,972 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 05:25:22,973 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 05:25:22,974 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 05:25:22,974 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 05:25:22,974 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 05:25:22,975 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 05:25:22,976 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 05:25:22,976 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 05:25:22,977 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 05:25:22,977 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 05:25:22,977 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 05:25:22,978 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 05:25:22,978 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 05:25:22,986 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 05:25:22,988 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:25:23,026 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 05:25:23,027 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 05:25:23,045 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 05:25:23,046 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 05:25:23,047 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 05:25:23,047 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 05:25:23,047 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 05:25:23,047 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 05:25:23,047 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 05:25:23,047 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 05:25:23,048 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 05:25:23,048 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 05:25:23,048 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 05:25:23,048 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 05:25:23,048 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 05:25:23,048 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 05:25:23,048 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 05:25:23,049 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 05:25:23,049 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 05:25:23,049 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 05:25:23,050 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 05:25:23,050 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:25:23,050 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 05:25:23,050 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 05:25:23,050 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 05:25:23,050 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 05:25:23,051 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 05:25:23,051 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 05:25:23,051 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 05:25:23,051 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 05:25:23,051 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 05:25:23,052 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 05:25:23,052 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 05:25:23,053 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:25:23,266 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 05:25:23,284 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 05:25:23,286 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 05:25:23,287 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 05:25:23,290 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 05:25:23,291 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_prepend_equal.i [2022-01-11 05:25:23,353 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0672e3e89/f863f3fa9e1f45ada5049f93736ea055/FLAG79a4643bf [2022-01-11 05:25:23,727 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 05:25:23,727 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_prepend_equal.i [2022-01-11 05:25:23,742 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0672e3e89/f863f3fa9e1f45ada5049f93736ea055/FLAG79a4643bf [2022-01-11 05:25:24,100 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/0672e3e89/f863f3fa9e1f45ada5049f93736ea055 [2022-01-11 05:25:24,102 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 05:25:24,103 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 05:25:24,104 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 05:25:24,104 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 05:25:24,109 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 05:25:24,110 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:25:24" (1/1) ... [2022-01-11 05:25:24,111 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3cb694b7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:24, skipping insertion in model container [2022-01-11 05:25:24,111 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:25:24" (1/1) ... [2022-01-11 05:25:24,117 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 05:25:24,149 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 05:25:24,484 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_prepend_equal.i[24640,24653] [2022-01-11 05:25:24,488 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:25:24,498 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 05:25:24,561 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_prepend_equal.i[24640,24653] [2022-01-11 05:25:24,562 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:25:24,591 INFO L208 MainTranslator]: Completed translation [2022-01-11 05:25:24,593 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:24 WrapperNode [2022-01-11 05:25:24,593 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 05:25:24,594 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 05:25:24,594 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 05:25:24,594 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 05:25:24,600 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:25:24" (1/1) ... [2022-01-11 05:25:24,634 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:25:24" (1/1) ... [2022-01-11 05:25:24,663 INFO L137 Inliner]: procedures = 130, calls = 47, calls flagged for inlining = 9, calls inlined = 11, statements flattened = 163 [2022-01-11 05:25:24,664 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 05:25:24,665 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 05:25:24,665 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 05:25:24,665 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 05:25:24,672 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:24" (1/1) ... [2022-01-11 05:25:24,672 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:24" (1/1) ... [2022-01-11 05:25:24,687 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:24" (1/1) ... [2022-01-11 05:25:24,687 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:24" (1/1) ... [2022-01-11 05:25:24,696 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:24" (1/1) ... [2022-01-11 05:25:24,708 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:24" (1/1) ... [2022-01-11 05:25:24,713 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:24" (1/1) ... [2022-01-11 05:25:24,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 05:25:24,717 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 05:25:24,717 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 05:25:24,717 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 05:25:24,718 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:24" (1/1) ... [2022-01-11 05:25:24,725 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:25:24,736 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:25:24,752 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:25:24,757 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:25:24,782 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-11 05:25:24,782 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-11 05:25:24,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 05:25:24,783 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-01-11 05:25:24,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-11 05:25:24,783 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-11 05:25:24,783 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-11 05:25:24,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-11 05:25:24,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-01-11 05:25:24,783 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 05:25:24,784 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 05:25:24,784 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 05:25:24,894 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 05:25:24,895 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 05:25:25,366 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 05:25:25,372 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 05:25:25,372 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-01-11 05:25:25,375 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:25:25 BoogieIcfgContainer [2022-01-11 05:25:25,375 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 05:25:25,376 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 05:25:25,376 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 05:25:25,377 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 05:25:25,380 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:25:25" (1/1) ... [2022-01-11 05:25:25,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:25:25 BasicIcfg [2022-01-11 05:25:25,497 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 05:25:25,498 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 05:25:25,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 05:25:25,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 05:25:25,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 05:25:24" (1/4) ... [2022-01-11 05:25:25,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332fbac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:25:25, skipping insertion in model container [2022-01-11 05:25:25,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:24" (2/4) ... [2022-01-11 05:25:25,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332fbac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:25:25, skipping insertion in model container [2022-01-11 05:25:25,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:25:25" (3/4) ... [2022-01-11 05:25:25,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@332fbac8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 05:25:25, skipping insertion in model container [2022-01-11 05:25:25,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:25:25" (4/4) ... [2022-01-11 05:25:25,503 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_prepend_equal.iTransformedIcfg [2022-01-11 05:25:25,508 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 05:25:25,508 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 05:25:25,548 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 05:25:25,554 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:25:25,554 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 05:25:25,567 INFO L276 IsEmpty]: Start isEmpty. Operand has 35 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 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:25:25,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-11 05:25:25,572 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:25:25,572 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:25:25,573 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:25:25,581 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:25:25,582 INFO L85 PathProgramCache]: Analyzing trace with hash -1320976623, now seen corresponding path program 1 times [2022-01-11 05:25:25,589 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:25:25,590 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [767053019] [2022-01-11 05:25:25,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:25,592 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:25:25,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:25,856 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:25:25,856 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:25:25,857 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [767053019] [2022-01-11 05:25:25,858 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [767053019] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:25:25,858 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:25:25,858 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 05:25:25,860 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1716115426] [2022-01-11 05:25:25,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:25:25,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-11 05:25:25,864 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:25:25,889 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-11 05:25:25,890 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 05:25:25,892 INFO L87 Difference]: Start difference. First operand has 35 states, 33 states have (on average 1.4545454545454546) internal successors, (48), 34 states have internal predecessors, (48), 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.0) internal successors, (16), 2 states have internal predecessors, (16), 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:25:25,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:25:25,909 INFO L93 Difference]: Finished difference Result 57 states and 78 transitions. [2022-01-11 05:25:25,911 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-11 05:25:25,913 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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 16 [2022-01-11 05:25:25,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:25:25,920 INFO L225 Difference]: With dead ends: 57 [2022-01-11 05:25:25,920 INFO L226 Difference]: Without dead ends: 25 [2022-01-11 05:25:25,929 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:25:25,934 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:25:25,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:25:25,949 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2022-01-11 05:25:25,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 25. [2022-01-11 05:25:25,964 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:25:25,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 29 transitions. [2022-01-11 05:25:25,967 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 29 transitions. Word has length 16 [2022-01-11 05:25:25,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:25:25,968 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 29 transitions. [2022-01-11 05:25:25,968 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.0) internal successors, (16), 2 states have internal predecessors, (16), 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:25:25,970 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 29 transitions. [2022-01-11 05:25:25,970 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-11 05:25:25,970 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:25:25,970 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:25:25,971 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 05:25:25,971 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:25:25,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:25:25,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1177038291, now seen corresponding path program 1 times [2022-01-11 05:25:25,974 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:25:25,975 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [707684961] [2022-01-11 05:25:25,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:25,975 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:25:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:26,490 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:25:26,491 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:25:26,491 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [707684961] [2022-01-11 05:25:26,491 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [707684961] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:25:26,492 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:25:26,492 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-01-11 05:25:26,492 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1571229407] [2022-01-11 05:25:26,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:25:26,493 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-01-11 05:25:26,494 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:25:26,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-01-11 05:25:26,495 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-01-11 05:25:26,495 INFO L87 Difference]: Start difference. First operand 25 states and 29 transitions. Second operand has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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:25:27,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:25:27,196 INFO L93 Difference]: Finished difference Result 65 states and 77 transitions. [2022-01-11 05:25:27,197 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-11 05:25:27,197 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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 16 [2022-01-11 05:25:27,198 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:25:27,198 INFO L225 Difference]: With dead ends: 65 [2022-01-11 05:25:27,198 INFO L226 Difference]: Without dead ends: 45 [2022-01-11 05:25:27,199 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2022-01-11 05:25:27,200 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 105 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 105 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 135 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-11 05:25:27,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [105 Valid, 67 Invalid, 135 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-11 05:25:27,201 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-01-11 05:25:27,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 36. [2022-01-11 05:25:27,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 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:25:27,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-01-11 05:25:27,214 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 16 [2022-01-11 05:25:27,215 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:25:27,217 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-01-11 05:25:27,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 1.7777777777777777) internal successors, (16), 9 states have internal predecessors, (16), 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:25:27,218 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-01-11 05:25:27,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-11 05:25:27,220 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:25:27,220 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:25:27,220 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 05:25:27,220 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:25:27,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:25:27,220 INFO L85 PathProgramCache]: Analyzing trace with hash 1177961812, now seen corresponding path program 1 times [2022-01-11 05:25:27,221 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:25:27,221 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [516045522] [2022-01-11 05:25:27,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:27,221 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:25:27,415 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:27,464 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:25:27,465 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:25:27,465 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [516045522] [2022-01-11 05:25:27,466 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [516045522] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:25:27,466 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:25:27,466 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:25:27,467 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [683133986] [2022-01-11 05:25:27,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:25:27,467 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:25:27,467 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:25:27,468 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:25:27,468 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:25:27,468 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:25:27,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:25:27,486 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-01-11 05:25:27,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:25:27,487 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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 16 [2022-01-11 05:25:27,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:25:27,488 INFO L225 Difference]: With dead ends: 44 [2022-01-11 05:25:27,488 INFO L226 Difference]: Without dead ends: 30 [2022-01-11 05:25:27,492 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:25:27,495 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 6 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 44 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-11 05:25:27,496 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 44 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 4 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:25:27,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-11 05:25:27,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-01-11 05:25:27,507 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 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-11 05:25:27,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-01-11 05:25:27,511 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 16 [2022-01-11 05:25:27,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:25:27,511 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-01-11 05:25:27,511 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 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:25:27,512 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-01-11 05:25:27,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-11 05:25:27,513 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:25:27,513 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] [2022-01-11 05:25:27,513 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 05:25:27,514 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:25:27,514 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:25:27,514 INFO L85 PathProgramCache]: Analyzing trace with hash -1236854934, now seen corresponding path program 1 times [2022-01-11 05:25:27,515 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:25:27,515 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1642254490] [2022-01-11 05:25:27,515 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:27,515 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:25:27,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:27,893 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:25:27,893 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:25:27,894 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1642254490] [2022-01-11 05:25:27,894 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1642254490] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:25:27,894 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:25:27,894 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2022-01-11 05:25:27,894 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245590140] [2022-01-11 05:25:27,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:25:27,895 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-01-11 05:25:27,895 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:25:27,896 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-01-11 05:25:27,896 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2022-01-11 05:25:27,896 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 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:25:28,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:25:28,545 INFO L93 Difference]: Finished difference Result 50 states and 58 transitions. [2022-01-11 05:25:28,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-01-11 05:25:28,546 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 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 22 [2022-01-11 05:25:28,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:25:28,547 INFO L225 Difference]: With dead ends: 50 [2022-01-11 05:25:28,547 INFO L226 Difference]: Without dead ends: 30 [2022-01-11 05:25:28,547 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=121, Invalid=259, Unknown=0, NotChecked=0, Total=380 [2022-01-11 05:25:28,548 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 78 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 142 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-01-11 05:25:28,548 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 36 Invalid, 142 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-01-11 05:25:28,551 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-01-11 05:25:28,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 26. [2022-01-11 05:25:28,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 26 states, 25 states have (on average 1.12) internal successors, (28), 25 states have internal predecessors, (28), 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:25:28,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2022-01-11 05:25:28,555 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 22 [2022-01-11 05:25:28,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:25:28,555 INFO L470 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2022-01-11 05:25:28,555 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.0) internal successors, (22), 11 states have internal predecessors, (22), 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:25:28,555 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2022-01-11 05:25:28,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-11 05:25:28,556 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:25:28,556 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] [2022-01-11 05:25:28,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 05:25:28,556 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:25:28,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:25:28,557 INFO L85 PathProgramCache]: Analyzing trace with hash -1235931413, now seen corresponding path program 1 times [2022-01-11 05:25:28,557 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:25:28,557 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1001370374] [2022-01-11 05:25:28,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:28,557 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:25:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:30,789 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:25:30,789 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:25:30,790 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1001370374] [2022-01-11 05:25:30,790 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1001370374] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:25:30,790 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:25:30,790 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [16] imperfect sequences [] total 16 [2022-01-11 05:25:30,790 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1393889894] [2022-01-11 05:25:30,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:25:30,791 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-11 05:25:30,791 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:25:30,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-11 05:25:30,791 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=205, Unknown=0, NotChecked=0, Total=240 [2022-01-11 05:25:30,792 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand has 16 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 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:25:32,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:25:32,771 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2022-01-11 05:25:32,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-01-11 05:25:32,772 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 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 22 [2022-01-11 05:25:32,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:25:32,772 INFO L225 Difference]: With dead ends: 35 [2022-01-11 05:25:32,772 INFO L226 Difference]: Without dead ends: 33 [2022-01-11 05:25:32,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=203, Invalid=609, Unknown=0, NotChecked=0, Total=812 [2022-01-11 05:25:32,773 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 103 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2022-01-11 05:25:32,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 38 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2022-01-11 05:25:32,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2022-01-11 05:25:32,781 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 28. [2022-01-11 05:25:32,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1111111111111112) internal successors, (30), 27 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:25:32,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 30 transitions. [2022-01-11 05:25:32,781 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 30 transitions. Word has length 22 [2022-01-11 05:25:32,782 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:25:32,782 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 30 transitions. [2022-01-11 05:25:32,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.375) internal successors, (22), 16 states have internal predecessors, (22), 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:25:32,782 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 30 transitions. [2022-01-11 05:25:32,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-11 05:25:32,783 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:25:32,783 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, 1] [2022-01-11 05:25:32,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-11 05:25:32,783 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:25:32,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:25:32,783 INFO L85 PathProgramCache]: Analyzing trace with hash 1123040689, now seen corresponding path program 1 times [2022-01-11 05:25:32,784 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:25:32,784 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [284628757] [2022-01-11 05:25:32,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:32,784 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:25:33,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:34,318 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:25:34,318 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:25:34,318 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [284628757] [2022-01-11 05:25:34,319 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [284628757] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:25:34,319 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871945826] [2022-01-11 05:25:34,319 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:34,319 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:25:34,319 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:25:34,321 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:25:34,328 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:25:34,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:34,837 INFO L263 TraceCheckSpWp]: Trace formula consists of 889 conjuncts, 151 conjunts are in the unsatisfiable core [2022-01-11 05:25:34,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:25:34,917 INFO L353 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-01-11 05:25:34,918 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 1 case distinctions, treesize of input 9 treesize of output 15 [2022-01-11 05:25:35,134 INFO L353 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-01-11 05:25:35,134 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-11 05:25:35,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:35,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:35,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:35,273 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:25:35,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:35,421 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-11 05:25:35,605 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-11 05:25:35,605 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 46 treesize of output 43 [2022-01-11 05:25:35,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:36,038 INFO L353 Elim1Store]: treesize reduction 156, result has 19.6 percent of original size [2022-01-11 05:25:36,038 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 80 treesize of output 64 [2022-01-11 05:25:37,020 INFO L353 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2022-01-11 05:25:37,021 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 38 [2022-01-11 05:25:38,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:38,566 INFO L353 Elim1Store]: treesize reduction 52, result has 17.5 percent of original size [2022-01-11 05:25:38,567 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 121 treesize of output 97 [2022-01-11 05:25:38,580 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:38,581 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 14 treesize of output 16 [2022-01-11 05:25:39,826 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:39,827 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:39,833 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 0 case distinctions, treesize of input 379 treesize of output 306 [2022-01-11 05:25:39,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:39,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:39,847 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:25:39,849 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:39,851 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:25:39,940 INFO L353 Elim1Store]: treesize reduction 99, result has 18.9 percent of original size [2022-01-11 05:25:39,940 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 12 case distinctions, treesize of input 703 treesize of output 300 [2022-01-11 05:25:39,958 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:40,828 INFO L353 Elim1Store]: treesize reduction 1672, result has 12.0 percent of original size [2022-01-11 05:25:40,829 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 9 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 17 new quantified variables, introduced 63 case distinctions, treesize of input 1538 treesize of output 971 [2022-01-11 05:25:40,861 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:25:40,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:40,865 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 1013 treesize of output 615 [2022-01-11 05:25:40,907 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 31 treesize of output 32 [2022-01-11 05:25:40,942 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 49 treesize of output 54 [2022-01-11 05:25:40,969 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 58 treesize of output 47 [2022-01-11 05:25:40,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:40,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:40,998 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:40,999 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:41,034 INFO L353 Elim1Store]: treesize reduction 38, result has 54.2 percent of original size [2022-01-11 05:25:41,035 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 124 treesize of output 152 [2022-01-11 05:25:41,119 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 49 treesize of output 38 [2022-01-11 05:25:41,152 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 49 treesize of output 54 [2022-01-11 05:25:41,185 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 10 treesize of output 9 [2022-01-11 05:25:41,229 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 16 treesize of output 15 [2022-01-11 05:25:41,290 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:41,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:41,300 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:25:41,300 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 65 treesize of output 57 [2022-01-11 05:25:41,386 INFO L353 Elim1Store]: treesize reduction 27, result has 46.0 percent of original size [2022-01-11 05:25:41,387 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 1 case distinctions, treesize of input 78 treesize of output 92 [2022-01-11 05:25:41,491 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:41,492 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:41,507 INFO L353 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-01-11 05:25:41,507 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 562 treesize of output 413 [2022-01-11 05:25:41,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:41,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:41,538 INFO L353 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-01-11 05:25:41,539 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 552 treesize of output 395 [2022-01-11 05:25:41,555 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 381 treesize of output 315 [2022-01-11 05:25:41,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:41,570 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:41,583 INFO L353 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-01-11 05:25:41,584 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 539 treesize of output 398 [2022-01-11 05:25:41,602 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:41,603 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:41,619 INFO L353 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-01-11 05:25:41,620 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 586 treesize of output 425 [2022-01-11 05:25:41,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:41,639 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:41,652 INFO L353 Elim1Store]: treesize reduction 25, result has 24.2 percent of original size [2022-01-11 05:25:41,652 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 552 treesize of output 403 [2022-01-11 05:25:41,668 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 372 treesize of output 310 [2022-01-11 05:25:41,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:41,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:41,697 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:25:41,697 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 73 [2022-01-11 05:25:41,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:41,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:41,725 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:25:41,729 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 111 treesize of output 87 [2022-01-11 05:25:41,899 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 13 treesize of output 5 [2022-01-11 05:25:41,969 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 13 treesize of output 5 [2022-01-11 05:25:41,996 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 41 treesize of output 39 [2022-01-11 05:25:42,143 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 13 treesize of output 5 [2022-01-11 05:25:42,161 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:42,165 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:42,175 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:25:42,176 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 117 [2022-01-11 05:25:42,214 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 11 treesize of output 9 [2022-01-11 05:25:42,338 INFO L353 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2022-01-11 05:25:42,339 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 180 treesize of output 1 [2022-01-11 05:25:42,590 INFO L353 Elim1Store]: treesize reduction 41, result has 26.8 percent of original size [2022-01-11 05:25:42,591 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 30 treesize of output 42 [2022-01-11 05:25:43,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:43,068 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:25:43,080 INFO L353 Elim1Store]: treesize reduction 69, result has 4.2 percent of original size [2022-01-11 05:25:43,081 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 8 new quantified variables, introduced 10 case distinctions, treesize of input 170 treesize of output 74 [2022-01-11 05:25:43,088 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:43,091 INFO L353 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-01-11 05:25:43,091 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 5 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 19 [2022-01-11 05:25:43,147 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:25:43,147 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:25:43,436 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1108 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~last~1#1.offsetInt_1| Int) (v_ArrVal_1118 (Array Int Int)) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1099 (Array Int Int)) (v_ArrVal_1098 (Array Int Int)) (v_ArrVal_1120 (Array Int Int)) (v_ArrVal_1084 (Array Int Int)) (v_ArrVal_1095 (Array Int Int)) (v_ArrVal_1092 (Array Int Int)) (v_ArrVal_1090 (Array Int Int))) (let ((.cse8 (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~head#1.baseInt|))) (let ((.cse5 (select .cse8 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~head#1.offsetInt|)) (.cse10 (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~head#1.baseInt|))) (let ((.cse6 (select (select |c_#memory_$Pointer$.baseInt| .cse5) (mod (+ 8 (select .cse10 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~head#1.offsetInt|)) 18446744073709551616))) (.cse7 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offsetInt| 8) 18446744073709551616))) (let ((.cse3 (store (let ((.cse9 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~head#1.baseInt| (store .cse10 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~head#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offsetInt|)))) (store (store (store .cse9 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.baseInt| v_ArrVal_1099) .cse5 v_ArrVal_1105) .cse6 (store (select (store (store .cse9 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.baseInt| v_ArrVal_1118) .cse5 v_ArrVal_1098) .cse6) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~last~1#1.offsetInt_1| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offsetInt|))) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.baseInt| (store (select (store (store (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~head#1.baseInt| v_ArrVal_1103) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.baseInt| v_ArrVal_1092) .cse5 v_ArrVal_1120) .cse6 v_ArrVal_1095) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.baseInt|) .cse7 |v_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~last~1#1.offsetInt_1|))) (.cse0 (let ((.cse4 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~head#1.baseInt| (store .cse8 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~head#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.baseInt|)))) (store (store (store (store .cse4 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.baseInt| v_ArrVal_1108) .cse5 v_ArrVal_1090) .cse6 (store (select (store (store .cse4 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.baseInt| v_ArrVal_1084) .cse5 v_ArrVal_1109) .cse6) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~last~1#1.offsetInt_1| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.baseInt| (store (select (store (store (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~head#1.baseInt| v_ArrVal_1106) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.baseInt| (store (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.offsetInt| .cse5)) .cse5 v_ArrVal_1112) .cse6 v_ArrVal_1088) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~new_head~1#1.baseInt|) .cse7 .cse6))))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (or (not (= (select (select .cse0 .cse1) .cse2) .cse1)) (not (= .cse2 (select (select .cse3 .cse1) .cse2)))))))))) is different from false [2022-01-11 05:25:43,860 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1109 (Array Int Int)) (v_ArrVal_1108 (Array Int Int)) (v_ArrVal_1118 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~last~1#1.offsetInt_1| Int) (v_ArrVal_1106 (Array Int Int)) (v_ArrVal_1105 (Array Int Int)) (v_ArrVal_1103 (Array Int Int)) (v_ArrVal_1112 (Array Int Int)) (v_ArrVal_1099 (Array Int Int)) (v_ArrVal_1088 (Array Int Int)) (v_ArrVal_1098 (Array Int Int)) (v_ArrVal_1120 (Array Int Int)) (v_ArrVal_1095 (Array Int Int)) (v_ArrVal_1084 (Array Int Int)) (v_ArrVal_1083 (Array Int Int)) (v_ArrVal_1082 (Array Int Int)) (v_ArrVal_1092 (Array Int Int)) (v_ArrVal_1090 (Array Int Int))) (let ((.cse8 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_1083)) (.cse12 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_1082))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~head#1.baseInt|)) (.cse10 (select .cse8 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~head#1.baseInt|))) (let ((.cse6 (select .cse10 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~head#1.offsetInt|)) (.cse0 (select .cse13 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~head#1.offsetInt|))) (let ((.cse7 (select (select .cse8 .cse6) (mod (+ .cse0 8) 18446744073709551616))) (.cse9 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| 8) 18446744073709551616))) (let ((.cse2 (store (let ((.cse11 (store .cse12 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~head#1.baseInt| (store .cse13 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~head#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|)))) (store (store (store .cse11 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_1099) .cse6 v_ArrVal_1105) .cse7 (store (select (store (store .cse11 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_1118) .cse6 v_ArrVal_1098) .cse7) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~last~1#1.offsetInt_1| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt|))) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| (store (select (store (store (store (store .cse12 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~head#1.baseInt| v_ArrVal_1103) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_1092) .cse6 v_ArrVal_1120) .cse7 v_ArrVal_1095) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) .cse9 |v_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~last~1#1.offsetInt_1|))) (.cse4 (let ((.cse5 (store .cse8 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~head#1.baseInt| (store .cse10 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~head#1.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|)))) (store (store (store (store .cse5 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_1108) .cse6 v_ArrVal_1090) .cse7 (store (select (store (store .cse5 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| v_ArrVal_1084) .cse6 v_ArrVal_1109) .cse7) |v_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~last~1#1.offsetInt_1| |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|)) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| (store (select (store (store (store (store .cse8 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_prepend_~head#1.baseInt| v_ArrVal_1106) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt| (store (select .cse5 |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.offsetInt| .cse6)) .cse6 v_ArrVal_1112) .cse7 v_ArrVal_1088) |c_ULTIMATE.start_ULTIMATE.start_node_create_~temp~0#1.baseInt|) .cse9 .cse7))))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|)) (.cse1 (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~#s~0#1.offsetInt|))) (or (not (<= 0 .cse0)) (not (= .cse1 (select (select .cse2 .cse3) .cse1))) (not (= .cse3 (select (select .cse4 .cse3) .cse1))))))))))) is different from false [2022-01-11 05:25:57,054 WARN L228 SmtUtils]: Spent 9.41s on a formula simplification. DAG size of input: 93 DAG size of output: 89 (called from [L 350] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-01-11 05:25:57,055 INFO L353 Elim1Store]: treesize reduction 8, result has 99.2 percent of original size [2022-01-11 05:25:57,120 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 7 new quantified variables, introduced 10 case distinctions, treesize of input 1325279686425 treesize of output 1272200097083