/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_update_all_reverse.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-11 05:25:50,719 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-11 05:25:50,721 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-11 05:25:50,776 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-11 05:25:50,777 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-11 05:25:50,781 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-11 05:25:50,783 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-11 05:25:50,785 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-11 05:25:50,800 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-11 05:25:50,805 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-11 05:25:50,805 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-11 05:25:50,806 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-11 05:25:50,807 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-11 05:25:50,808 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-11 05:25:50,809 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-11 05:25:50,812 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-11 05:25:50,812 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-11 05:25:50,813 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-11 05:25:50,814 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-11 05:25:50,819 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-11 05:25:50,820 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-11 05:25:50,821 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-11 05:25:50,822 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-11 05:25:50,822 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-11 05:25:50,827 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-11 05:25:50,827 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-11 05:25:50,827 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-11 05:25:50,828 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-11 05:25:50,828 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-11 05:25:50,829 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-11 05:25:50,829 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-11 05:25:50,829 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-11 05:25:50,844 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-11 05:25:50,845 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-11 05:25:50,846 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-11 05:25:50,846 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-11 05:25:50,846 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-11 05:25:50,846 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-11 05:25:50,847 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-11 05:25:50,847 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-11 05:25:50,848 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-11 05:25:50,848 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:50,884 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-11 05:25:50,885 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-11 05:25:50,885 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-11 05:25:50,885 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-11 05:25:50,886 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-11 05:25:50,886 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-11 05:25:50,886 INFO L138 SettingsManager]: * Use SBE=true [2022-01-11 05:25:50,886 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-11 05:25:50,887 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-11 05:25:50,887 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-11 05:25:50,887 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-11 05:25:50,888 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-11 05:25:50,888 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-11 05:25:50,888 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-11 05:25:50,888 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-11 05:25:50,888 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-11 05:25:50,888 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-11 05:25:50,888 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-11 05:25:50,889 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-11 05:25:50,889 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-11 05:25:50,889 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-11 05:25:50,890 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:25:50,890 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-11 05:25:50,890 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-11 05:25:50,890 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-11 05:25:50,890 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-11 05:25:50,891 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-11 05:25:50,891 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-11 05:25:50,891 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-11 05:25:50,891 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-11 05:25:50,891 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-11 05:25:50,891 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-11 05:25:50,892 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-11 05:25:50,892 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:51,158 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-11 05:25:51,176 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-11 05:25:51,178 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-11 05:25:51,178 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-11 05:25:51,179 INFO L275 PluginConnector]: CDTParser initialized [2022-01-11 05:25:51,180 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i [2022-01-11 05:25:51,233 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e7b5403/58bac37e34df46618412d1cb00bfa24c/FLAG7099b286f [2022-01-11 05:25:51,628 INFO L306 CDTParser]: Found 1 translation units. [2022-01-11 05:25:51,628 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2c_update_all_reverse.i [2022-01-11 05:25:51,643 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e7b5403/58bac37e34df46618412d1cb00bfa24c/FLAG7099b286f [2022-01-11 05:25:51,669 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/00e7b5403/58bac37e34df46618412d1cb00bfa24c [2022-01-11 05:25:51,670 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-11 05:25:51,671 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-11 05:25:51,673 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-11 05:25:51,673 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-11 05:25:51,676 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-11 05:25:51,676 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:25:51" (1/1) ... [2022-01-11 05:25:51,677 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4118c24a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:51, skipping insertion in model container [2022-01-11 05:25:51,677 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.01 05:25:51" (1/1) ... [2022-01-11 05:25:51,682 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-11 05:25:51,706 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-11 05:25:51,950 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_update_all_reverse.i[24556,24569] [2022-01-11 05:25:51,955 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:25:51,966 INFO L203 MainTranslator]: Completed pre-run [2022-01-11 05:25:52,011 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_update_all_reverse.i[24556,24569] [2022-01-11 05:25:52,011 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-11 05:25:52,035 INFO L208 MainTranslator]: Completed translation [2022-01-11 05:25:52,036 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:52 WrapperNode [2022-01-11 05:25:52,036 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-11 05:25:52,037 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-11 05:25:52,037 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-11 05:25:52,037 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-11 05:25:52,042 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:52" (1/1) ... [2022-01-11 05:25:52,063 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:52" (1/1) ... [2022-01-11 05:25:52,090 INFO L137 Inliner]: procedures = 129, calls = 29, calls flagged for inlining = 9, calls inlined = 10, statements flattened = 145 [2022-01-11 05:25:52,090 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-11 05:25:52,091 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-11 05:25:52,091 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-11 05:25:52,091 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-11 05:25:52,097 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:52" (1/1) ... [2022-01-11 05:25:52,097 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:52" (1/1) ... [2022-01-11 05:25:52,113 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:52" (1/1) ... [2022-01-11 05:25:52,114 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:52" (1/1) ... [2022-01-11 05:25:52,124 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:52" (1/1) ... [2022-01-11 05:25:52,127 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:52" (1/1) ... [2022-01-11 05:25:52,128 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:52" (1/1) ... [2022-01-11 05:25:52,130 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-11 05:25:52,136 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-11 05:25:52,136 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-11 05:25:52,136 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-11 05:25:52,137 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:52" (1/1) ... [2022-01-11 05:25:52,142 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-11 05:25:52,149 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:25:52,198 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:52,204 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:52,224 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-11 05:25:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-11 05:25:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-11 05:25:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-11 05:25:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-11 05:25:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-11 05:25:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-11 05:25:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-11 05:25:52,225 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-11 05:25:52,225 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-11 05:25:52,294 INFO L234 CfgBuilder]: Building ICFG [2022-01-11 05:25:52,295 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-11 05:25:52,551 INFO L275 CfgBuilder]: Performing block encoding [2022-01-11 05:25:52,559 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-11 05:25:52,560 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-01-11 05:25:52,561 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:25:52 BoogieIcfgContainer [2022-01-11 05:25:52,561 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-11 05:25:52,561 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-11 05:25:52,562 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-11 05:25:52,564 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-11 05:25:52,566 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:25:52" (1/1) ... [2022-01-11 05:25:52,650 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:25:52 BasicIcfg [2022-01-11 05:25:52,651 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-11 05:25:52,652 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-11 05:25:52,652 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-11 05:25:52,654 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-11 05:25:52,654 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.01 05:25:51" (1/4) ... [2022-01-11 05:25:52,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264c1caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:25:52, skipping insertion in model container [2022-01-11 05:25:52,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.01 05:25:52" (2/4) ... [2022-01-11 05:25:52,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264c1caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.01 05:25:52, skipping insertion in model container [2022-01-11 05:25:52,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.01 05:25:52" (3/4) ... [2022-01-11 05:25:52,655 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@264c1caf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 11.01 05:25:52, skipping insertion in model container [2022-01-11 05:25:52,655 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 11.01 05:25:52" (4/4) ... [2022-01-11 05:25:52,656 INFO L111 eAbstractionObserver]: Analyzing ICFG dll2c_update_all_reverse.iTransformedIcfg [2022-01-11 05:25:52,659 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-11 05:25:52,660 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-11 05:25:52,720 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-11 05:25:52,725 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:52,725 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-11 05:25:52,748 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 states have internal predecessors, (53), 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:52,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-11 05:25:52,752 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:25:52,752 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:52,752 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:25:52,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:25:52,755 INFO L85 PathProgramCache]: Analyzing trace with hash -327494694, now seen corresponding path program 1 times [2022-01-11 05:25:52,777 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:25:52,777 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608261861] [2022-01-11 05:25:52,778 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:52,778 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:25:52,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:52,921 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:52,921 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:25:52,921 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608261861] [2022-01-11 05:25:52,922 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608261861] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:25:52,922 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:25:52,922 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-11 05:25:52,924 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [650936319] [2022-01-11 05:25:52,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:25:52,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-11 05:25:52,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:25:52,944 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-11 05:25:52,945 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-11 05:25:52,946 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.5142857142857142) internal successors, (53), 36 states have internal predecessors, (53), 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:52,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:25:52,962 INFO L93 Difference]: Finished difference Result 61 states and 88 transitions. [2022-01-11 05:25:52,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-11 05:25:52,964 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:52,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:25:52,969 INFO L225 Difference]: With dead ends: 61 [2022-01-11 05:25:52,969 INFO L226 Difference]: Without dead ends: 27 [2022-01-11 05:25:52,971 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:52,975 INFO L933 BasicCegarLoop]: 46 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, 46 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:52,976 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 46 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:52,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2022-01-11 05:25:52,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2022-01-11 05:25:52,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:25:52,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 32 transitions. [2022-01-11 05:25:52,999 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 32 transitions. Word has length 16 [2022-01-11 05:25:52,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:25:53,000 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 32 transitions. [2022-01-11 05:25:53,000 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:53,001 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2022-01-11 05:25:53,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-11 05:25:53,002 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:25:53,002 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:53,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-11 05:25:53,002 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:25:53,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:25:53,004 INFO L85 PathProgramCache]: Analyzing trace with hash 1416239162, now seen corresponding path program 1 times [2022-01-11 05:25:53,004 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:25:53,004 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [283656616] [2022-01-11 05:25:53,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:53,004 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:25:53,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:53,164 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:53,164 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:25:53,164 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [283656616] [2022-01-11 05:25:53,164 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [283656616] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:25:53,165 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:25:53,165 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-11 05:25:53,165 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [351279830] [2022-01-11 05:25:53,165 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:25:53,168 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-11 05:25:53,168 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:25:53,168 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-11 05:25:53,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-11 05:25:53,169 INFO L87 Difference]: Start difference. First operand 27 states and 32 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:53,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:25:53,185 INFO L93 Difference]: Finished difference Result 44 states and 53 transitions. [2022-01-11 05:25:53,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-11 05:25:53,186 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:53,186 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:25:53,186 INFO L225 Difference]: With dead ends: 44 [2022-01-11 05:25:53,187 INFO L226 Difference]: Without dead ends: 28 [2022-01-11 05:25:53,190 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:53,191 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 6 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 4 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 50 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:53,192 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 50 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:53,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-01-11 05:25:53,202 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2022-01-11 05:25:53,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 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:53,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-01-11 05:25:53,204 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 16 [2022-01-11 05:25:53,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:25:53,206 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-01-11 05:25:53,207 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:53,207 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-01-11 05:25:53,210 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-01-11 05:25:53,210 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:25:53,210 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:53,210 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-11 05:25:53,210 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:25:53,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:25:53,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1321570061, now seen corresponding path program 1 times [2022-01-11 05:25:53,211 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:25:53,211 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [101361659] [2022-01-11 05:25:53,211 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:53,211 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:25:53,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:53,408 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:25:53,408 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:25:53,408 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [101361659] [2022-01-11 05:25:53,409 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [101361659] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:25:53,409 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:25:53,409 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-11 05:25:53,409 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [356070430] [2022-01-11 05:25:53,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:25:53,410 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 05:25:53,410 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:25:53,411 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 05:25:53,411 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-11 05:25:53,411 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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:53,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:25:53,515 INFO L93 Difference]: Finished difference Result 50 states and 59 transitions. [2022-01-11 05:25:53,515 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-11 05:25:53,515 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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:53,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:25:53,516 INFO L225 Difference]: With dead ends: 50 [2022-01-11 05:25:53,516 INFO L226 Difference]: Without dead ends: 41 [2022-01-11 05:25:53,516 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2022-01-11 05:25:53,517 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 45 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:25:53,517 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 100 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:25:53,518 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41 states. [2022-01-11 05:25:53,522 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41 to 29. [2022-01-11 05:25:53,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 28 states have (on average 1.2142857142857142) internal successors, (34), 28 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:53,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2022-01-11 05:25:53,522 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 22 [2022-01-11 05:25:53,522 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:25:53,523 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2022-01-11 05:25:53,523 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 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:53,523 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2022-01-11 05:25:53,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-01-11 05:25:53,523 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:25:53,523 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, 1, 1] [2022-01-11 05:25:53,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-11 05:25:53,524 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:25:53,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:25:53,524 INFO L85 PathProgramCache]: Analyzing trace with hash -1439046502, now seen corresponding path program 1 times [2022-01-11 05:25:53,524 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:25:53,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570069238] [2022-01-11 05:25:53,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:53,524 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:25:53,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:53,709 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:25:53,709 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:25:53,709 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570069238] [2022-01-11 05:25:53,709 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570069238] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:25:53,709 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-11 05:25:53,709 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-01-11 05:25:53,710 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [367281063] [2022-01-11 05:25:53,710 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:25:53,710 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 05:25:53,710 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:25:53,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 05:25:53,710 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-01-11 05:25:53,711 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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:53,796 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:25:53,796 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2022-01-11 05:25:53,797 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 05:25:53,797 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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 27 [2022-01-11 05:25:53,797 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:25:53,798 INFO L225 Difference]: With dead ends: 56 [2022-01-11 05:25:53,798 INFO L226 Difference]: Without dead ends: 42 [2022-01-11 05:25:53,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-01-11 05:25:53,802 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 45 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 73 SdHoareTripleChecker+Invalid, 27 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:25:53,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 73 Invalid, 27 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:25:53,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-01-11 05:25:53,807 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 30. [2022-01-11 05:25:53,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.206896551724138) internal successors, (35), 29 states have internal predecessors, (35), 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:53,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 35 transitions. [2022-01-11 05:25:53,808 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 35 transitions. Word has length 27 [2022-01-11 05:25:53,808 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:25:53,808 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 35 transitions. [2022-01-11 05:25:53,808 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 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:53,809 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 35 transitions. [2022-01-11 05:25:53,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-11 05:25:53,809 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:25:53,809 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, 1, 1, 1] [2022-01-11 05:25:53,809 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-11 05:25:53,809 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:25:53,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:25:53,810 INFO L85 PathProgramCache]: Analyzing trace with hash -580719043, now seen corresponding path program 1 times [2022-01-11 05:25:53,810 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:25:53,810 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [208157818] [2022-01-11 05:25:53,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:53,810 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:25:53,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:53,998 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:25:53,998 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:25:53,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [208157818] [2022-01-11 05:25:53,998 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [208157818] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:25:53,998 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1684389372] [2022-01-11 05:25:53,998 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:53,999 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:25:53,999 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:25:54,024 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:54,025 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:54,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:54,164 INFO L263 TraceCheckSpWp]: Trace formula consists of 560 conjuncts, 14 conjunts are in the unsatisfiable core [2022-01-11 05:25:54,167 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:25:54,462 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:25:54,463 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:25:54,699 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:25:54,699 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1684389372] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-11 05:25:54,699 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-11 05:25:54,699 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 16 [2022-01-11 05:25:54,699 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2048239854] [2022-01-11 05:25:54,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:25:54,700 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-11 05:25:54,700 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:25:54,700 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-11 05:25:54,700 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=195, Unknown=0, NotChecked=0, Total=240 [2022-01-11 05:25:54,700 INFO L87 Difference]: Start difference. First operand 30 states and 35 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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:54,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:25:54,772 INFO L93 Difference]: Finished difference Result 51 states and 60 transitions. [2022-01-11 05:25:54,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 05:25:54,773 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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) Word has length 28 [2022-01-11 05:25:54,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:25:54,773 INFO L225 Difference]: With dead ends: 51 [2022-01-11 05:25:54,773 INFO L226 Difference]: Without dead ends: 43 [2022-01-11 05:25:54,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=59, Invalid=247, Unknown=0, NotChecked=0, Total=306 [2022-01-11 05:25:54,774 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 98 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:25:54,774 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 75 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-11 05:25:54,775 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-01-11 05:25:54,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 32. [2022-01-11 05:25:54,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.1935483870967742) internal successors, (37), 31 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:25:54,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2022-01-11 05:25:54,780 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 28 [2022-01-11 05:25:54,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:25:54,781 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2022-01-11 05:25:54,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 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:54,781 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2022-01-11 05:25:54,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-01-11 05:25:54,781 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:25:54,781 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, 1, 1, 1, 1] [2022-01-11 05:25:54,814 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-11 05:25:54,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:25:54,999 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:25:54,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:25:55,000 INFO L85 PathProgramCache]: Analyzing trace with hash -798591139, now seen corresponding path program 1 times [2022-01-11 05:25:55,000 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:25:55,000 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2095765619] [2022-01-11 05:25:55,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:55,000 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:25:55,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:55,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-11 05:25:55,109 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:25:55,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2095765619] [2022-01-11 05:25:55,110 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2095765619] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:25:55,110 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [179621191] [2022-01-11 05:25:55,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:55,110 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:25:55,110 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:25:55,111 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:25:55,121 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-11 05:25:55,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:25:55,283 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 103 conjunts are in the unsatisfiable core [2022-01-11 05:25:55,286 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:25:55,310 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-11 05:25:55,388 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:25:55,389 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-11 05:25:55,466 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-11 05:25:55,475 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-11 05:25:55,524 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-11 05:25:55,525 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2022-01-11 05:25:55,528 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 25 [2022-01-11 05:25:55,648 INFO L353 Elim1Store]: treesize reduction 42, result has 20.8 percent of original size [2022-01-11 05:25:55,649 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 98 treesize of output 91 [2022-01-11 05:25:55,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:55,655 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 75 treesize of output 67 [2022-01-11 05:25:55,659 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:55,661 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 32 [2022-01-11 05:25:55,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:25:55,665 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 25 [2022-01-11 05:25:55,670 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 20 treesize of output 19 [2022-01-11 05:25:55,681 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2022-01-11 05:25:55,684 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 11 [2022-01-11 05:25:55,901 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-11 05:25:55,901 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 64 treesize of output 61 [2022-01-11 05:25:55,906 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2022-01-11 05:25:55,909 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 50 [2022-01-11 05:25:56,167 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 23 [2022-01-11 05:25:56,170 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 21 [2022-01-11 05:25:56,208 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-11 05:25:56,255 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:25:56,256 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:25:56,420 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 106 treesize of output 84 [2022-01-11 05:25:56,448 WARN L838 $PredicateComparison]: unable to prove that (and (= (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int|) (forall ((v_ArrVal_471 (Array Int Int))) (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_471) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (forall ((v_ArrVal_473 (Array Int Int))) (= (mod (+ (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_473) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) 16) 18446744073709551616) (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) 18446744073709551616)))) is different from false [2022-01-11 05:25:56,485 WARN L838 $PredicateComparison]: unable to prove that (and (= (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int|) (forall ((v_ArrVal_471 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|))) (= .cse0 (select (select (store |c_#memory_$Pointer$.baseInt| .cse0 v_ArrVal_471) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)))) (forall ((v_ArrVal_473 (Array Int Int))) (= (mod (+ 16 (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|)) 18446744073709551616) (mod (+ (select (select (store |c_#memory_$Pointer$.offsetInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) v_ArrVal_473) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) 16) 18446744073709551616)))) is different from false [2022-01-11 05:25:56,505 WARN L838 $PredicateComparison]: unable to prove that (and (= (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| |c_ULTIMATE.start_ULTIMATE.start_main_~i~0#1Int|) 4294967296)) (forall ((v_ArrVal_471 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (= .cse0 (select (select (store |c_#memory_$Pointer$.baseInt| .cse0 v_ArrVal_471) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)))) (forall ((v_ArrVal_473 (Array Int Int))) (= (mod (+ (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) 16) 18446744073709551616) (mod (+ 16 (select (select (store |c_#memory_$Pointer$.offsetInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) v_ArrVal_473) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) 18446744073709551616)))) is different from false [2022-01-11 05:25:56,514 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_473 (Array Int Int))) (= (mod (+ (select (select (store |c_#memory_$Pointer$.offsetInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|) v_ArrVal_473) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|) 16) 18446744073709551616) (mod (+ 16 (select (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|)) 18446744073709551616))) (forall ((v_ArrVal_471 (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|))) (= .cse0 (select (select (store |c_#memory_$Pointer$.baseInt| .cse0 v_ArrVal_471) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|))))) is different from false [2022-01-11 05:25:56,532 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_462 (Array Int Int)) (v_ArrVal_473 (Array Int Int)) (v_ArrVal_468 Int) (v_ArrVal_466 (Array Int Int))) (let ((.cse1 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 8) 18446744073709551616))) (let ((.cse0 (store (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_462) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) .cse1 v_ArrVal_468))) (= (mod (+ 16 (select (select (store (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_469) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| .cse0) (select (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_466) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) .cse1 v_ArrVal_465) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|) v_ArrVal_473) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|)) 18446744073709551616) (mod (+ 16 (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|)) 18446744073709551616))))) (forall ((v_ArrVal_465 Int) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (let ((.cse3 (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_466) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_465))) (let ((.cse2 (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|))) (= .cse2 (select (select (store (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_463) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| .cse3) .cse2 v_ArrVal_471) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|)))))) is different from false [2022-01-11 05:25:56,579 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_465 Int) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (let ((.cse0 (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_466) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_465))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|))) (= (select (select (store (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_463) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| .cse0) .cse1 v_ArrVal_471) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) .cse1)))) (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_462 (Array Int Int)) (v_ArrVal_473 (Array Int Int)) (v_ArrVal_468 Int) (v_ArrVal_466 (Array Int Int))) (let ((.cse3 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616))) (let ((.cse2 (store (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_462) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) .cse3 v_ArrVal_468))) (= (mod (+ (select (select (store (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_469) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| .cse2) (select (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_466) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) .cse3 v_ArrVal_465) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) v_ArrVal_473) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) 16) 18446744073709551616) (mod (+ (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) 16) 18446744073709551616)))))) is different from false [2022-01-11 05:25:56,607 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_469 (Array Int Int)) (v_ArrVal_465 Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_460 (Array Int Int)) (v_ArrVal_462 (Array Int Int)) (v_ArrVal_473 (Array Int Int)) (v_ArrVal_468 Int) (v_ArrVal_466 (Array Int Int))) (let ((.cse0 (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| v_ArrVal_460)) (.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616))) (let ((.cse1 (store (select (store .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_462) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) .cse2 v_ArrVal_468))) (= (mod (+ 16 (select (select (store (store (store .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_469) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| .cse1) (select (store (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| v_ArrVal_461) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_466) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) .cse2 v_ArrVal_465) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) v_ArrVal_473) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|)) 18446744073709551616) (mod (+ 16 (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|)) 18446744073709551616))))) (forall ((v_ArrVal_465 Int) (v_ArrVal_461 (Array Int Int)) (v_ArrVal_471 (Array Int Int)) (v_ArrVal_463 (Array Int Int)) (v_ArrVal_466 (Array Int Int))) (let ((.cse3 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| v_ArrVal_461))) (let ((.cse4 (store (select (store .cse3 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_466) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) v_ArrVal_465))) (let ((.cse5 (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|))) (= (select (select (store (store (store .cse3 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_463) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| .cse4) .cse5 v_ArrVal_471) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) .cse5)))))) is different from false [2022-01-11 05:25:56,621 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:25:56,622 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 100 treesize of output 77 [2022-01-11 05:25:56,625 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 418 treesize of output 404 [2022-01-11 05:25:56,632 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 360 treesize of output 350 [2022-01-11 05:25:56,639 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:25:56,641 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 145 treesize of output 137 [2022-01-11 05:25:56,644 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 430 treesize of output 414 [2022-01-11 05:25:56,648 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 414 treesize of output 386 [2022-01-11 05:25:56,822 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-11 05:25:56,823 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 108 treesize of output 1 [2022-01-11 05:25:56,961 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2022-01-11 05:25:56,961 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [179621191] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:25:56,961 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:25:56,961 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 20, 20] total 41 [2022-01-11 05:25:56,961 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475432829] [2022-01-11 05:25:56,961 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:25:56,962 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-01-11 05:25:56,962 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:25:56,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-01-11 05:25:56,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=1031, Unknown=7, NotChecked=490, Total=1640 [2022-01-11 05:25:56,963 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand has 41 states, 41 states have (on average 2.024390243902439) internal successors, (83), 41 states have internal predecessors, (83), 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:59,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:25:59,455 INFO L93 Difference]: Finished difference Result 95 states and 113 transitions. [2022-01-11 05:25:59,456 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2022-01-11 05:25:59,456 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 2.024390243902439) internal successors, (83), 41 states have internal predecessors, (83), 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 29 [2022-01-11 05:25:59,456 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:25:59,459 INFO L225 Difference]: With dead ends: 95 [2022-01-11 05:25:59,459 INFO L226 Difference]: Without dead ends: 84 [2022-01-11 05:25:59,460 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 54 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 426 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=276, Invalid=2097, Unknown=7, NotChecked=700, Total=3080 [2022-01-11 05:25:59,461 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 143 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 629 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 1027 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 629 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 349 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-11 05:25:59,461 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [143 Valid, 318 Invalid, 1027 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 629 Invalid, 0 Unknown, 349 Unchecked, 0.9s Time] [2022-01-11 05:25:59,462 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-01-11 05:25:59,477 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 37. [2022-01-11 05:25:59,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 37 states, 36 states have (on average 1.1944444444444444) internal successors, (43), 36 states have internal predecessors, (43), 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:59,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 43 transitions. [2022-01-11 05:25:59,480 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 43 transitions. Word has length 29 [2022-01-11 05:25:59,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:25:59,481 INFO L470 AbstractCegarLoop]: Abstraction has 37 states and 43 transitions. [2022-01-11 05:25:59,481 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 2.024390243902439) internal successors, (83), 41 states have internal predecessors, (83), 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:59,481 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-01-11 05:25:59,483 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-01-11 05:25:59,483 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:25:59,483 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:25:59,527 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-01-11 05:25:59,701 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2022-01-11 05:25:59,702 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:25:59,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:25:59,703 INFO L85 PathProgramCache]: Analyzing trace with hash 1584629712, now seen corresponding path program 2 times [2022-01-11 05:25:59,703 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:25:59,703 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1895976362] [2022-01-11 05:25:59,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:25:59,703 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:00,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:01,147 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-11 05:26:01,147 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:01,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1895976362] [2022-01-11 05:26:01,147 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1895976362] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:26:01,147 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1593011603] [2022-01-11 05:26:01,147 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 05:26:01,147 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:01,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:26:01,153 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:26:01,154 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-11 05:26:01,615 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 05:26:01,615 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:26:01,619 INFO L263 TraceCheckSpWp]: Trace formula consists of 660 conjuncts, 104 conjunts are in the unsatisfiable core [2022-01-11 05:26:01,623 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:26:01,629 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-11 05:26:01,733 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-11 05:26:01,733 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-01-11 05:26:01,826 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-01-11 05:26:01,875 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-11 05:26:01,875 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-01-11 05:26:02,013 INFO L353 Elim1Store]: treesize reduction 46, result has 19.3 percent of original size [2022-01-11 05:26:02,014 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 77 treesize of output 70 [2022-01-11 05:26:02,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:02,018 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2022-01-11 05:26:02,022 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 16 treesize of output 15 [2022-01-11 05:26:02,029 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 23 [2022-01-11 05:26:02,032 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 7 [2022-01-11 05:26:02,308 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-11 05:26:02,308 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 79 treesize of output 72 [2022-01-11 05:26:02,312 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2022-01-11 05:26:02,314 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2022-01-11 05:26:02,521 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:02,522 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:02,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:02,523 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2022-01-11 05:26:02,528 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2022-01-11 05:26:02,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:02,532 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2022-01-11 05:26:02,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:02,733 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 26 [2022-01-11 05:26:02,737 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-01-11 05:26:02,785 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-11 05:26:02,858 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-11 05:26:02,858 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:26:03,160 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_634 Int) (v_ArrVal_633 Int)) (<= (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296) (let ((.cse0 (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_630) (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) .cse0 v_ArrVal_634)) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (let ((.cse1 (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) .cse0 v_ArrVal_633)) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (+ .cse1 (* (div (+ .cse1 16) 18446744073709551616) (- 18446744073709551616)) 16)))))) (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_634 Int) (v_ArrVal_633 Int)) (<= (let ((.cse2 (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_630) (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) .cse2 v_ArrVal_634)) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (let ((.cse3 (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) .cse2 v_ArrVal_633)) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (+ .cse3 (* (div (+ .cse3 16) 18446744073709551616) (- 18446744073709551616)) 16)))) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296)))) is different from false [2022-01-11 05:26:03,183 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_634 Int) (v_ArrVal_633 Int)) (<= (let ((.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| v_ArrVal_630) (select (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse0 v_ArrVal_634) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (let ((.cse1 (select (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse0 v_ArrVal_633) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (+ 16 (* (div (+ 16 .cse1) 18446744073709551616) (- 18446744073709551616)) .cse1)))) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296))) (forall ((v_ArrVal_630 (Array Int Int)) (v_ArrVal_634 Int) (v_ArrVal_633 Int)) (<= (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296) (let ((.cse2 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| v_ArrVal_630) (select (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse2 v_ArrVal_634) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (let ((.cse3 (select (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse2 v_ArrVal_633) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (+ 16 (* (div (+ 16 .cse3) 18446744073709551616) (- 18446744073709551616)) .cse3))))))) is different from false [2022-01-11 05:26:03,228 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:26:03,228 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 82 [2022-01-11 05:26:03,238 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:26:03,238 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 169 [2022-01-11 05:26:03,245 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 68 treesize of output 29 [2022-01-11 05:26:03,323 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:26:03,324 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 82 [2022-01-11 05:26:03,334 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:26:03,335 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 166 treesize of output 169 [2022-01-11 05:26:03,340 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 68 treesize of output 29 [2022-01-11 05:26:03,399 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296))) (and (<= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int| .cse0) (<= .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int|) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_634 Int)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| (select (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_628) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_634) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)))) (forall ((v_ArrVal_628 (Array Int Int)) (v_ArrVal_634 Int)) (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (select (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_628) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_634) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (forall ((v_ArrVal_626 (Array Int Int)) (v_ArrVal_633 Int)) (= (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) 18446744073709551616) (let ((.cse1 (select (store (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_626) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_633) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (+ .cse1 16 (* (div (+ .cse1 16) 18446744073709551616) (- 18446744073709551616)))))))) is different from false [2022-01-11 05:26:03,433 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:26:03,433 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 98 treesize of output 98 [2022-01-11 05:26:03,437 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:26:03,440 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2022-01-11 05:26:03,454 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 58 treesize of output 54 [2022-01-11 05:26:03,510 INFO L353 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-01-11 05:26:03,510 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 53 [2022-01-11 05:26:03,776 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_624 (Array Int Int))) (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| (select (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_624) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|)))) is different from false [2022-01-11 05:26:03,790 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_624 (Array Int Int))) (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| (select (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_624) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|)))) is different from false [2022-01-11 05:26:03,795 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_624 (Array Int Int)) (v_ArrVal_621 (Array Int Int))) (not (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| (select (store (select (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| v_ArrVal_621) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_624) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|)))) is different from false [2022-01-11 05:26:03,801 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:26:03,801 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-01-11 05:26:03,802 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 187 treesize of output 181 [2022-01-11 05:26:03,805 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:26:03,806 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 160 treesize of output 156 [2022-01-11 05:26:03,808 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 193 treesize of output 187 [2022-01-11 05:26:03,814 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 28 treesize of output 26 [2022-01-11 05:26:03,821 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 28 treesize of output 26 [2022-01-11 05:26:04,034 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 9 not checked. [2022-01-11 05:26:04,035 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1593011603] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:26:04,035 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:26:04,035 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 21, 22] total 59 [2022-01-11 05:26:04,035 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296619523] [2022-01-11 05:26:04,035 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:26:04,035 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 59 states [2022-01-11 05:26:04,035 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:26:04,036 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 59 interpolants. [2022-01-11 05:26:04,036 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=2615, Unknown=6, NotChecked=642, Total=3422 [2022-01-11 05:26:04,037 INFO L87 Difference]: Start difference. First operand 37 states and 43 transitions. Second operand has 59 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 59 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:07,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:26:07,998 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2022-01-11 05:26:07,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-01-11 05:26:07,999 INFO L78 Accepts]: Start accepts. Automaton has has 59 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 59 states have internal predecessors, (92), 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 34 [2022-01-11 05:26:07,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:26:08,000 INFO L225 Difference]: With dead ends: 88 [2022-01-11 05:26:08,000 INFO L226 Difference]: Without dead ends: 86 [2022-01-11 05:26:08,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 29 SyntacticMatches, 8 SemanticMatches, 78 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 762 ImplicationChecksByTransitivity, 5.0s TimeCoverageRelationStatistics Valid=523, Invalid=4897, Unknown=6, NotChecked=894, Total=6320 [2022-01-11 05:26:08,002 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 217 mSDsluCounter, 368 mSDsCounter, 0 mSdLazyCounter, 1021 mSolverCounterSat, 112 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 378 SdHoareTripleChecker+Invalid, 1473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 112 IncrementalHoareTripleChecker+Valid, 1021 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 340 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:26:08,003 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [217 Valid, 378 Invalid, 1473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [112 Valid, 1021 Invalid, 0 Unknown, 340 Unchecked, 1.0s Time] [2022-01-11 05:26:08,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-01-11 05:26:08,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 64. [2022-01-11 05:26:08,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.2063492063492063) internal successors, (76), 63 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:08,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 76 transitions. [2022-01-11 05:26:08,016 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 76 transitions. Word has length 34 [2022-01-11 05:26:08,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:26:08,016 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 76 transitions. [2022-01-11 05:26:08,016 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 59 states, 59 states have (on average 1.5593220338983051) internal successors, (92), 59 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:08,017 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 76 transitions. [2022-01-11 05:26:08,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-11 05:26:08,017 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:26:08,017 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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:26:08,035 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-01-11 05:26:08,231 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:08,231 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:08,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:08,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1902710826, now seen corresponding path program 3 times [2022-01-11 05:26:08,232 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:08,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072845837] [2022-01-11 05:26:08,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:08,232 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:08,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:08,336 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-11 05:26:08,336 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:08,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072845837] [2022-01-11 05:26:08,336 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072845837] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:26:08,336 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [653703786] [2022-01-11 05:26:08,336 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-11 05:26:08,336 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:08,336 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:26:08,337 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:26:08,338 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-11 05:26:11,624 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-01-11 05:26:11,624 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:26:11,628 INFO L263 TraceCheckSpWp]: Trace formula consists of 583 conjuncts, 19 conjunts are in the unsatisfiable core [2022-01-11 05:26:11,630 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:26:11,895 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-11 05:26:11,895 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:26:12,416 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-11 05:26:12,417 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [653703786] provided 1 perfect and 1 imperfect interpolant sequences [2022-01-11 05:26:12,417 INFO L186 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-01-11 05:26:12,417 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [6, 6] total 12 [2022-01-11 05:26:12,417 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [408428267] [2022-01-11 05:26:12,417 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:26:12,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-11 05:26:12,418 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:26:12,418 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-11 05:26:12,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-01-11 05:26:12,418 INFO L87 Difference]: Start difference. First operand 64 states and 76 transitions. Second operand has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:12,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:26:12,439 INFO L93 Difference]: Finished difference Result 73 states and 87 transitions. [2022-01-11 05:26:12,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-11 05:26:12,440 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 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) Word has length 35 [2022-01-11 05:26:12,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:26:12,441 INFO L225 Difference]: With dead ends: 73 [2022-01-11 05:26:12,441 INFO L226 Difference]: Without dead ends: 65 [2022-01-11 05:26:12,441 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 62 SyntacticMatches, 2 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-01-11 05:26:12,441 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 8 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 2 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 2 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 14 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-11 05:26:12,442 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [8 Valid, 96 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 2 Invalid, 0 Unknown, 14 Unchecked, 0.0s Time] [2022-01-11 05:26:12,442 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-01-11 05:26:12,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-01-11 05:26:12,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.1875) internal successors, (76), 64 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:12,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 76 transitions. [2022-01-11 05:26:12,470 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 76 transitions. Word has length 35 [2022-01-11 05:26:12,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:26:12,470 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 76 transitions. [2022-01-11 05:26:12,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:12,470 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 76 transitions. [2022-01-11 05:26:12,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-01-11 05:26:12,471 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:26:12,471 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 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:26:12,488 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-01-11 05:26:12,678 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:12,678 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:12,678 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:12,679 INFO L85 PathProgramCache]: Analyzing trace with hash 285778477, now seen corresponding path program 4 times [2022-01-11 05:26:12,679 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:12,679 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2055478229] [2022-01-11 05:26:12,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:12,679 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:12,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:12,834 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-11 05:26:12,835 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:12,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2055478229] [2022-01-11 05:26:12,835 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2055478229] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:26:12,835 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973360184] [2022-01-11 05:26:12,835 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-01-11 05:26:12,835 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:12,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:26:12,836 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:26:12,838 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-01-11 05:26:13,145 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-01-11 05:26:13,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:26:13,149 INFO L263 TraceCheckSpWp]: Trace formula consists of 683 conjuncts, 25 conjunts are in the unsatisfiable core [2022-01-11 05:26:13,150 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:26:13,564 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 8 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 05:26:13,564 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:26:14,068 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 10 proven. 2 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 05:26:14,068 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973360184] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:26:14,068 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:26:14,068 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 7, 8] total 16 [2022-01-11 05:26:14,068 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014184320] [2022-01-11 05:26:14,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:26:14,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2022-01-11 05:26:14,069 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:26:14,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2022-01-11 05:26:14,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=187, Unknown=0, NotChecked=0, Total=240 [2022-01-11 05:26:14,069 INFO L87 Difference]: Start difference. First operand 65 states and 76 transitions. Second operand has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:14,590 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:26:14,590 INFO L93 Difference]: Finished difference Result 94 states and 109 transitions. [2022-01-11 05:26:14,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-11 05:26:14,591 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 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 35 [2022-01-11 05:26:14,591 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:26:14,591 INFO L225 Difference]: With dead ends: 94 [2022-01-11 05:26:14,591 INFO L226 Difference]: Without dead ends: 72 [2022-01-11 05:26:14,591 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 58 SyntacticMatches, 2 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=111, Invalid=309, Unknown=0, NotChecked=0, Total=420 [2022-01-11 05:26:14,592 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 147 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-11 05:26:14,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 189 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-11 05:26:14,592 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-11 05:26:14,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 65. [2022-01-11 05:26:14,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 64 states have (on average 1.125) internal successors, (72), 64 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:14,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2022-01-11 05:26:14,612 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 35 [2022-01-11 05:26:14,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:26:14,614 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2022-01-11 05:26:14,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 4.0625) internal successors, (65), 16 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:14,615 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-01-11 05:26:14,618 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-11 05:26:14,619 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:26:14,619 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 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:26:14,626 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-01-11 05:26:14,824 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:14,824 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:14,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:14,824 INFO L85 PathProgramCache]: Analyzing trace with hash -743822241, now seen corresponding path program 1 times [2022-01-11 05:26:14,824 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:14,824 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [415206530] [2022-01-11 05:26:14,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:14,825 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:15,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:15,698 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 05:26:15,698 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:15,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [415206530] [2022-01-11 05:26:15,698 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [415206530] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:26:15,698 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [345993133] [2022-01-11 05:26:15,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:15,698 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:15,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:26:15,703 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:26:15,704 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-01-11 05:26:16,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:16,106 INFO L263 TraceCheckSpWp]: Trace formula consists of 728 conjuncts, 93 conjunts are in the unsatisfiable core [2022-01-11 05:26:16,108 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:26:16,534 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2022-01-11 05:26:17,466 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:26:17,467 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:26:17,467 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 10 [2022-01-11 05:26:18,103 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 5 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-01-11 05:26:18,103 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:26:18,993 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 58 [2022-01-11 05:26:19,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:19,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:19,555 INFO L134 CoverageAnalysis]: Checked inductivity of 17 backedges. 7 proven. 6 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-01-11 05:26:19,555 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [345993133] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:26:19,555 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:26:19,556 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21, 11] total 37 [2022-01-11 05:26:19,556 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [993383006] [2022-01-11 05:26:19,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:26:19,556 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2022-01-11 05:26:19,556 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:26:19,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2022-01-11 05:26:19,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1180, Unknown=0, NotChecked=0, Total=1332 [2022-01-11 05:26:19,557 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:25,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:26:25,233 INFO L93 Difference]: Finished difference Result 124 states and 140 transitions. [2022-01-11 05:26:25,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-01-11 05:26:25,234 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 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 40 [2022-01-11 05:26:25,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:26:25,235 INFO L225 Difference]: With dead ends: 124 [2022-01-11 05:26:25,235 INFO L226 Difference]: Without dead ends: 95 [2022-01-11 05:26:25,236 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 57 SyntacticMatches, 9 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 800 ImplicationChecksByTransitivity, 6.1s TimeCoverageRelationStatistics Valid=468, Invalid=2611, Unknown=1, NotChecked=0, Total=3080 [2022-01-11 05:26:25,237 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 221 mSDsluCounter, 231 mSDsCounter, 0 mSdLazyCounter, 500 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 615 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 500 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 38 IncrementalHoareTripleChecker+Unchecked, 1.2s IncrementalHoareTripleChecker+Time [2022-01-11 05:26:25,238 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 245 Invalid, 615 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 500 Invalid, 0 Unknown, 38 Unchecked, 1.2s Time] [2022-01-11 05:26:25,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-01-11 05:26:25,289 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 84. [2022-01-11 05:26:25,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 83 states have (on average 1.1325301204819278) internal successors, (94), 83 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:25,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 94 transitions. [2022-01-11 05:26:25,289 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 94 transitions. Word has length 40 [2022-01-11 05:26:25,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:26:25,290 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 94 transitions. [2022-01-11 05:26:25,290 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 37 states have (on average 2.675675675675676) internal successors, (99), 37 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:25,290 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 94 transitions. [2022-01-11 05:26:25,290 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-01-11 05:26:25,291 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:26:25,291 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:26:25,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-01-11 05:26:25,509 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:25,510 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:25,510 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:25,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1534324765, now seen corresponding path program 5 times [2022-01-11 05:26:25,510 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:25,511 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2075935531] [2022-01-11 05:26:25,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:25,511 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:25,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:25,651 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 1 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2022-01-11 05:26:25,651 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:25,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2075935531] [2022-01-11 05:26:25,651 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2075935531] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:26:25,651 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994622824] [2022-01-11 05:26:25,651 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-01-11 05:26:25,651 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:25,652 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:26:25,652 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:26:25,718 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-01-11 05:26:28,184 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 3 check-sat command(s) [2022-01-11 05:26:28,184 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:26:28,193 INFO L263 TraceCheckSpWp]: Trace formula consists of 819 conjuncts, 145 conjunts are in the unsatisfiable core [2022-01-11 05:26:28,197 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:26:28,203 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-11 05:26:28,254 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-11 05:26:28,254 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 12 treesize of output 14 [2022-01-11 05:26:28,404 INFO L353 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2022-01-11 05:26:28,405 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2022-01-11 05:26:28,501 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 11 treesize of output 7 [2022-01-11 05:26:28,540 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-11 05:26:28,540 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2022-01-11 05:26:28,628 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:28,630 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 24 [2022-01-11 05:26:28,633 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 9 treesize of output 11 [2022-01-11 05:26:28,637 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:28,637 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 19 treesize of output 23 [2022-01-11 05:26:28,892 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-11 05:26:28,892 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 71 [2022-01-11 05:26:28,897 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 27 [2022-01-11 05:26:28,900 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 40 [2022-01-11 05:26:29,096 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:29,097 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:29,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:29,099 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 63 treesize of output 61 [2022-01-11 05:26:29,104 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2022-01-11 05:26:29,108 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:29,108 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 42 [2022-01-11 05:26:29,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-11 05:26:29,354 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 27 [2022-01-11 05:26:29,357 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 15 [2022-01-11 05:26:29,434 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 7 [2022-01-11 05:26:29,496 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 14 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-01-11 05:26:29,496 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:26:29,824 WARN L838 $PredicateComparison]: unable to prove that (or (not (< (+ (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296) (* 2 (mod 0 2147483648))) (* (mod (+ 2147483647 |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 2147483648) 2))) (forall ((v_ArrVal_1289 Int) (v_ArrVal_1291 Int) (v_ArrVal_1292 (Array Int Int))) (= (let ((.cse0 (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_1292) (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) .cse0 v_ArrVal_1289)) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (mod (+ 16 (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt|) .cse0 v_ArrVal_1291)) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) 18446744073709551616))) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296)))) is different from false [2022-01-11 05:26:29,855 WARN L838 $PredicateComparison]: unable to prove that (or (not (< (+ (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296) (* 2 (mod 0 2147483648))) (* (mod (+ 2147483647 |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 2147483648) 2))) (forall ((v_ArrVal_1289 Int) (v_ArrVal_1291 Int) (v_ArrVal_1292 (Array Int Int))) (= (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296)) 4294967296) (let ((.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616))) (select (select (store |c_#memory_intInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| v_ArrVal_1292) (select (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse0 v_ArrVal_1289) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) (mod (+ (select (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) .cse0 v_ArrVal_1291) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|) 16) 18446744073709551616)))))) is different from false [2022-01-11 05:26:29,893 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:26:29,893 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 63 [2022-01-11 05:26:29,913 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:26:29,913 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 131 [2022-01-11 05:26:29,928 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 49 treesize of output 29 [2022-01-11 05:26:30,027 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296))) (or (not (< (+ .cse0 (* 2 (mod 0 2147483648))) (* (mod (+ 2147483647 |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 2147483648) 2))) (not (< |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int| 4294967296)) (and (forall ((v_ArrVal_1286 (Array Int Int)) (v_ArrVal_1291 Int)) (= (mod (+ 16 (select (store (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_1286) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1291) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|)) 18446744073709551616) (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.offsetInt|) 18446744073709551616))) (= (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| .cse0) 4294967296) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int|) (forall ((v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1289 Int)) (= |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| (select (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_1287) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1289) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))) (forall ((v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1289 Int)) (not (= |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt| (select (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~head#1.baseInt| v_ArrVal_1287) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1289) |c_ULTIMATE.start_ULTIMATE.start_main_~s~0#1.offsetInt|))))) (not (<= 0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_update_at_~data#1Int|)))) is different from false [2022-01-11 05:26:30,690 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1289 Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|))) (= (select (store (select (store |c_#memory_$Pointer$.baseInt| .cse0 v_ArrVal_1287) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1289) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|) .cse0))) (forall ((v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1289 Int)) (not (= (select (store (select (store |c_#memory_$Pointer$.baseInt| (select (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|) v_ArrVal_1287) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1289) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_#res#1.baseInt|)))) (not (< (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296) (* (mod (+ 2147483647 |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 2147483648) 2)))) is different from false [2022-01-11 05:26:30,721 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1289 Int)) (not (= (select (store (select (let ((.cse0 (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1279) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|))) (store (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1280) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| .cse0) (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|) v_ArrVal_1287)) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|) 18446744073709551616) v_ArrVal_1289) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|))) (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1289 Int)) (let ((.cse2 (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1279) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|))) (let ((.cse1 (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|))) (= .cse1 (select (store (select (store (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1280) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| .cse2) .cse1 v_ArrVal_1287) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt|) (mod (+ 16 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|) 18446744073709551616) v_ArrVal_1289) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.offsetInt|)))))) (<= (* (mod (+ 2147483647 |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 2147483648) 2) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296))) is different from false [2022-01-11 05:26:30,758 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1289 Int)) (let ((.cse0 (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1279) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|))) (let ((.cse1 (select .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|))) (= (select (store (select (store (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1280) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| .cse0) .cse1 v_ArrVal_1287) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1289) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) .cse1)))) (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1289 Int)) (not (= (select (store (select (let ((.cse2 (store (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1279) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|))) (store (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1280) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| .cse2) (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) v_ArrVal_1287)) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1289) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|)))) (<= (* (mod (+ 2147483647 |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 2147483648) 2) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296))) is different from false [2022-01-11 05:26:30,785 WARN L838 $PredicateComparison]: unable to prove that (or (and (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1289 Int)) (let ((.cse0 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| v_ArrVal_1276))) (let ((.cse1 (store (select (store .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1279) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|))) (= (select (store (select (store (store (store .cse0 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1280) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| .cse1) .cse2 v_ArrVal_1287) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1289) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) .cse2))))) (forall ((v_ArrVal_1280 (Array Int Int)) (v_ArrVal_1279 (Array Int Int)) (v_ArrVal_1276 (Array Int Int)) (v_ArrVal_1287 (Array Int Int)) (v_ArrVal_1289 Int)) (not (= (select (store (select (let ((.cse3 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~head~0#1.baseInt| v_ArrVal_1276))) (let ((.cse4 (store (select (store .cse3 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1279) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 8) 18446744073709551616) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt|))) (store (store (store .cse3 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~last~0#1.baseInt| v_ArrVal_1280) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt| .cse4) (select .cse4 |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) v_ArrVal_1287))) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt| 16) 18446744073709551616) v_ArrVal_1289) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_dll_circular_create_~new_head~0#1.baseInt|)))) (<= (* (mod (+ 2147483647 |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int|) 2147483648) 2) (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~len~0#1Int| 4294967295) 4294967296))) is different from false [2022-01-11 05:26:30,816 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-11 05:26:30,817 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 83 treesize of output 68 [2022-01-11 05:26:30,821 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 300 treesize of output 292 [2022-01-11 05:26:30,843 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:26:30,844 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:26:30,848 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 229 treesize of output 217 [2022-01-11 05:26:30,854 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 305 treesize of output 297 [2022-01-11 05:26:30,873 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 28 treesize of output 26 [2022-01-11 05:26:30,888 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 28 treesize of output 26 [2022-01-11 05:26:30,903 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:26:30,904 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-11 05:26:30,906 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 137 treesize of output 133 [2022-01-11 05:26:30,939 INFO L353 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-01-11 05:26:30,940 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 107 treesize of output 1 [2022-01-11 05:26:31,822 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 12 not checked. [2022-01-11 05:26:31,822 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994622824] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:26:31,822 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:26:31,822 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 26, 27] total 53 [2022-01-11 05:26:31,822 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [389043167] [2022-01-11 05:26:31,822 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:26:31,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2022-01-11 05:26:31,823 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:26:31,823 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2022-01-11 05:26:31,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=154, Invalid=1937, Unknown=7, NotChecked=658, Total=2756 [2022-01-11 05:26:31,824 INFO L87 Difference]: Start difference. First operand 84 states and 94 transitions. Second operand has 53 states, 53 states have (on average 2.056603773584906) internal successors, (109), 53 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:37,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:26:37,163 INFO L93 Difference]: Finished difference Result 117 states and 133 transitions. [2022-01-11 05:26:37,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2022-01-11 05:26:37,164 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 53 states have (on average 2.056603773584906) internal successors, (109), 53 states have internal predecessors, (109), 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 40 [2022-01-11 05:26:37,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:26:37,164 INFO L225 Difference]: With dead ends: 117 [2022-01-11 05:26:37,164 INFO L226 Difference]: Without dead ends: 66 [2022-01-11 05:26:37,166 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 116 GetRequests, 32 SyntacticMatches, 5 SemanticMatches, 79 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 976 ImplicationChecksByTransitivity, 6.5s TimeCoverageRelationStatistics Valid=615, Invalid=4808, Unknown=7, NotChecked=1050, Total=6480 [2022-01-11 05:26:37,166 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 152 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 712 mSolverCounterSat, 77 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 152 SdHoareTripleChecker+Valid, 260 SdHoareTripleChecker+Invalid, 1271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 77 IncrementalHoareTripleChecker+Valid, 712 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 482 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-01-11 05:26:37,166 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [152 Valid, 260 Invalid, 1271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [77 Valid, 712 Invalid, 0 Unknown, 482 Unchecked, 0.9s Time] [2022-01-11 05:26:37,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-01-11 05:26:37,188 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 58. [2022-01-11 05:26:37,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 58 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 57 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:37,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58 states to 58 states and 65 transitions. [2022-01-11 05:26:37,188 INFO L78 Accepts]: Start accepts. Automaton has 58 states and 65 transitions. Word has length 40 [2022-01-11 05:26:37,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:26:37,188 INFO L470 AbstractCegarLoop]: Abstraction has 58 states and 65 transitions. [2022-01-11 05:26:37,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 53 states have (on average 2.056603773584906) internal successors, (109), 53 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:37,189 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-01-11 05:26:37,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-01-11 05:26:37,189 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:26:37,189 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:26:37,198 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2022-01-11 05:26:37,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:37,397 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:37,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:37,397 INFO L85 PathProgramCache]: Analyzing trace with hash -1086042145, now seen corresponding path program 2 times [2022-01-11 05:26:37,397 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:37,397 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1425297944] [2022-01-11 05:26:37,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:37,397 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:37,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:37,510 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 3 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2022-01-11 05:26:37,511 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:37,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1425297944] [2022-01-11 05:26:37,511 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1425297944] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:26:37,511 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1429810740] [2022-01-11 05:26:37,511 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-01-11 05:26:37,511 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:37,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:26:37,520 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:26:37,540 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-01-11 05:26:39,675 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-01-11 05:26:39,676 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:26:39,680 INFO L263 TraceCheckSpWp]: Trace formula consists of 774 conjuncts, 33 conjunts are in the unsatisfiable core [2022-01-11 05:26:39,682 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:26:41,011 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 9 proven. 13 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 05:26:41,011 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-11 05:26:42,732 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 18 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-11 05:26:42,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1429810740] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-11 05:26:42,733 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-11 05:26:42,733 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 12, 13] total 26 [2022-01-11 05:26:42,733 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [934491562] [2022-01-11 05:26:42,733 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-11 05:26:42,733 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2022-01-11 05:26:42,733 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:26:42,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2022-01-11 05:26:42,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=116, Invalid=534, Unknown=0, NotChecked=0, Total=650 [2022-01-11 05:26:42,734 INFO L87 Difference]: Start difference. First operand 58 states and 65 transitions. Second operand has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:44,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:26:44,741 INFO L93 Difference]: Finished difference Result 77 states and 86 transitions. [2022-01-11 05:26:44,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-01-11 05:26:44,741 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 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 42 [2022-01-11 05:26:44,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:26:44,741 INFO L225 Difference]: With dead ends: 77 [2022-01-11 05:26:44,741 INFO L226 Difference]: Without dead ends: 55 [2022-01-11 05:26:44,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 67 SyntacticMatches, 3 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 3.6s TimeCoverageRelationStatistics Valid=290, Invalid=970, Unknown=0, NotChecked=0, Total=1260 [2022-01-11 05:26:44,742 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 169 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 115 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 115 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 68 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-01-11 05:26:44,742 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 308 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 115 Invalid, 0 Unknown, 68 Unchecked, 0.3s Time] [2022-01-11 05:26:44,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2022-01-11 05:26:44,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 53. [2022-01-11 05:26:44,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 52 states have (on average 1.0576923076923077) internal successors, (55), 52 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:44,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 55 transitions. [2022-01-11 05:26:44,764 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 55 transitions. Word has length 42 [2022-01-11 05:26:44,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:26:44,764 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 55 transitions. [2022-01-11 05:26:44,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 3.6153846153846154) internal successors, (94), 26 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:44,764 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 55 transitions. [2022-01-11 05:26:44,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2022-01-11 05:26:44,765 INFO L506 BasicCegarLoop]: Found error trace [2022-01-11 05:26:44,765 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-11 05:26:44,783 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-01-11 05:26:44,984 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-01-11 05:26:44,984 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-11 05:26:44,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-11 05:26:44,984 INFO L85 PathProgramCache]: Analyzing trace with hash -1836961859, now seen corresponding path program 3 times [2022-01-11 05:26:44,984 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-11 05:26:44,984 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850208432] [2022-01-11 05:26:44,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-11 05:26:44,984 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-11 05:26:45,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-11 05:26:45,119 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 23 proven. 9 refuted. 0 times theorem prover too weak. 15 trivial. 0 not checked. [2022-01-11 05:26:45,119 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-11 05:26:45,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850208432] [2022-01-11 05:26:45,119 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850208432] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-11 05:26:45,119 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [195904424] [2022-01-11 05:26:45,119 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-01-11 05:26:45,119 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-11 05:26:45,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-11 05:26:45,120 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-11 05:26:45,122 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-01-11 05:26:46,218 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-01-11 05:26:46,219 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-01-11 05:26:46,224 INFO L263 TraceCheckSpWp]: Trace formula consists of 796 conjuncts, 13 conjunts are in the unsatisfiable core [2022-01-11 05:26:46,226 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-11 05:26:46,439 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 20 trivial. 0 not checked. [2022-01-11 05:26:46,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-01-11 05:26:46,439 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [195904424] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-11 05:26:46,439 INFO L186 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-01-11 05:26:46,439 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [7] total 10 [2022-01-11 05:26:46,440 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [188927679] [2022-01-11 05:26:46,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-11 05:26:46,440 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-01-11 05:26:46,440 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-11 05:26:46,440 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-01-11 05:26:46,440 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2022-01-11 05:26:46,440 INFO L87 Difference]: Start difference. First operand 53 states and 55 transitions. Second operand has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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:26:46,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-11 05:26:46,524 INFO L93 Difference]: Finished difference Result 53 states and 55 transitions. [2022-01-11 05:26:46,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-11 05:26:46,525 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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) Word has length 52 [2022-01-11 05:26:46,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-11 05:26:46,525 INFO L225 Difference]: With dead ends: 53 [2022-01-11 05:26:46,525 INFO L226 Difference]: Without dead ends: 0 [2022-01-11 05:26:46,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-01-11 05:26:46,525 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 4 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 97 SdHoareTripleChecker+Invalid, 33 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-11 05:26:46,526 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 97 Invalid, 33 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-11 05:26:46,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-01-11 05:26:46,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-01-11 05:26:46,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-11 05:26:46,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-01-11 05:26:46,526 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 52 [2022-01-11 05:26:46,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-11 05:26:46,526 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-01-11 05:26:46,526 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.2) internal successors, (41), 5 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:26:46,526 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-01-11 05:26:46,526 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-01-11 05:26:46,528 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-01-11 05:26:46,538 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-01-11 05:26:46,729 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-01-11 05:26:46,731 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions.