/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata ./data --core.log.level.for.class de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN -tc ../../../trunk/examples/toolchains/AutomizerCInlineTransformed.xml -s ../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf -i ../../../trunk/examples/svcomp/forester-heap/sll-optional-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 23:35:15,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 23:35:15,579 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 23:35:15,636 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 23:35:15,636 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 23:35:15,638 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 23:35:15,640 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 23:35:15,642 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 23:35:15,643 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 23:35:15,647 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 23:35:15,648 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 23:35:15,649 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 23:35:15,649 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 23:35:15,650 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 23:35:15,651 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 23:35:15,653 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 23:35:15,654 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 23:35:15,654 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 23:35:15,656 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 23:35:15,660 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 23:35:15,661 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 23:35:15,662 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 23:35:15,663 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 23:35:15,663 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 23:35:15,668 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 23:35:15,668 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 23:35:15,668 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 23:35:15,670 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 23:35:15,670 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 23:35:15,670 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 23:35:15,671 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 23:35:15,671 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 23:35:15,673 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 23:35:15,673 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 23:35:15,674 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 23:35:15,674 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 23:35:15,675 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 23:35:15,675 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 23:35:15,675 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 23:35:15,675 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 23:35:15,676 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 23:35:15,677 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_NONE.epf [2022-01-10 23:35:15,700 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 23:35:15,700 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 23:35:15,700 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 23:35:15,700 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 23:35:15,701 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 23:35:15,701 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 23:35:15,701 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 23:35:15,701 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 23:35:15,701 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 23:35:15,701 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 23:35:15,701 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 23:35:15,701 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 23:35:15,702 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 23:35:15,702 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 23:35:15,702 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 23:35:15,702 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 23:35:15,702 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 23:35:15,702 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 23:35:15,702 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 23:35:15,702 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 23:35:15,702 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 23:35:15,702 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:35:15,702 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 23:35:15,702 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 23:35:15,703 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 23:35:15,703 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 23:35:15,703 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 23:35:15,703 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 23:35:15,703 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 23:35:15,703 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 23:35:15,703 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 23:35:15,703 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 23:35:15,704 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 23:35:15,704 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_NONE WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.core: Log level for class -> de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=WARN; [2022-01-10 23:35:15,880 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 23:35:15,897 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 23:35:15,899 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 23:35:15,900 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 23:35:15,906 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 23:35:15,907 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/sll-optional-1.i [2022-01-10 23:35:15,972 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c98a5adb/de0d9f7e47f44943ab72c71e8627059b/FLAGfe6e0c9f6 [2022-01-10 23:35:16,355 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 23:35:16,356 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-optional-1.i [2022-01-10 23:35:16,370 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c98a5adb/de0d9f7e47f44943ab72c71e8627059b/FLAGfe6e0c9f6 [2022-01-10 23:35:16,383 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6c98a5adb/de0d9f7e47f44943ab72c71e8627059b [2022-01-10 23:35:16,386 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 23:35:16,387 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 23:35:16,388 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 23:35:16,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 23:35:16,391 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 23:35:16,391 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:35:16" (1/1) ... [2022-01-10 23:35:16,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3756d75c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:35:16, skipping insertion in model container [2022-01-10 23:35:16,392 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:35:16" (1/1) ... [2022-01-10 23:35:16,419 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 23:35:16,438 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 23:35:16,667 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-optional-1.i[22688,22701] [2022-01-10 23:35:16,673 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:35:16,689 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 23:35:16,730 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/sll-optional-1.i[22688,22701] [2022-01-10 23:35:16,731 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 23:35:16,752 INFO L208 MainTranslator]: Completed translation [2022-01-10 23:35:16,752 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:35:16 WrapperNode [2022-01-10 23:35:16,753 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 23:35:16,753 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 23:35:16,753 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 23:35:16,753 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 23:35:16,762 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:35:16" (1/1) ... [2022-01-10 23:35:16,775 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:35:16" (1/1) ... [2022-01-10 23:35:16,790 INFO L137 Inliner]: procedures = 122, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 126 [2022-01-10 23:35:16,791 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 23:35:16,791 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 23:35:16,791 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 23:35:16,791 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 23:35:16,799 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:35:16" (1/1) ... [2022-01-10 23:35:16,800 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:35:16" (1/1) ... [2022-01-10 23:35:16,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:35:16" (1/1) ... [2022-01-10 23:35:16,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:35:16" (1/1) ... [2022-01-10 23:35:16,809 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:35:16" (1/1) ... [2022-01-10 23:35:16,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:35:16" (1/1) ... [2022-01-10 23:35:16,814 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:35:16" (1/1) ... [2022-01-10 23:35:16,816 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 23:35:16,817 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 23:35:16,817 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 23:35:16,817 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 23:35:16,818 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:35:16" (1/1) ... [2022-01-10 23:35:16,828 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 23:35:16,835 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:35:16,850 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-01-10 23:35:16,852 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-01-10 23:35:16,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 23:35:16,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 23:35:16,881 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 23:35:16,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 23:35:16,881 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 23:35:16,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 23:35:16,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 23:35:16,881 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 23:35:16,881 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 23:35:16,881 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 23:35:16,949 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 23:35:16,950 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 23:35:17,279 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 23:35:17,283 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 23:35:17,283 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-01-10 23:35:17,284 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:35:17 BoogieIcfgContainer [2022-01-10 23:35:17,285 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 23:35:17,285 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 23:35:17,285 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 23:35:17,286 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 23:35:17,288 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:35:17" (1/1) ... [2022-01-10 23:35:17,354 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:35:17 BasicIcfg [2022-01-10 23:35:17,354 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 23:35:17,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 23:35:17,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 23:35:17,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 23:35:17,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:35:16" (1/4) ... [2022-01-10 23:35:17,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6233fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:35:17, skipping insertion in model container [2022-01-10 23:35:17,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:35:16" (2/4) ... [2022-01-10 23:35:17,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6233fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:35:17, skipping insertion in model container [2022-01-10 23:35:17,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:35:17" (3/4) ... [2022-01-10 23:35:17,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6233fb5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:35:17, skipping insertion in model container [2022-01-10 23:35:17,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:35:17" (4/4) ... [2022-01-10 23:35:17,359 INFO L111 eAbstractionObserver]: Analyzing ICFG sll-optional-1.iTransformedIcfg [2022-01-10 23:35:17,362 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 23:35:17,362 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-01-10 23:35:17,390 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 23:35:17,395 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-01-10 23:35:17,395 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-01-10 23:35:17,403 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:17,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 23:35:17,406 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:35:17,407 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:35:17,407 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:35:17,411 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:35:17,411 INFO L85 PathProgramCache]: Analyzing trace with hash -848528538, now seen corresponding path program 1 times [2022-01-10 23:35:17,416 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:35:17,416 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830471562] [2022-01-10 23:35:17,417 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:35:17,417 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:35:17,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:35:17,551 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:35:17,552 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:35:17,552 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830471562] [2022-01-10 23:35:17,552 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830471562] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:35:17,553 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:35:17,553 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 23:35:17,554 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247005353] [2022-01-10 23:35:17,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:35:17,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 23:35:17,557 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:35:17,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 23:35:17,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 23:35:17,589 INFO L87 Difference]: Start difference. First operand has 29 states, 27 states have (on average 1.6666666666666667) internal successors, (45), 28 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:17,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:35:17,601 INFO L93 Difference]: Finished difference Result 50 states and 76 transitions. [2022-01-10 23:35:17,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 23:35:17,603 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 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 15 [2022-01-10 23:35:17,603 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:35:17,609 INFO L225 Difference]: With dead ends: 50 [2022-01-10 23:35:17,609 INFO L226 Difference]: Without dead ends: 21 [2022-01-10 23:35:17,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 23:35:17,613 INFO L933 BasicCegarLoop]: 39 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, 39 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:35:17,614 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:35:17,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2022-01-10 23:35:17,633 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2022-01-10 23:35:17,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 21 states, 20 states have (on average 1.45) internal successors, (29), 20 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:17,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 29 transitions. [2022-01-10 23:35:17,638 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 29 transitions. Word has length 15 [2022-01-10 23:35:17,638 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:35:17,639 INFO L470 AbstractCegarLoop]: Abstraction has 21 states and 29 transitions. [2022-01-10 23:35:17,639 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.5) internal successors, (15), 2 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:17,640 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 29 transitions. [2022-01-10 23:35:17,640 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 23:35:17,640 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:35:17,640 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:35:17,641 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 23:35:17,641 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:35:17,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:35:17,641 INFO L85 PathProgramCache]: Analyzing trace with hash 1649487399, now seen corresponding path program 1 times [2022-01-10 23:35:17,642 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:35:17,642 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [799262226] [2022-01-10 23:35:17,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:35:17,642 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:35:17,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:35:17,726 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:35:17,726 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:35:17,727 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [799262226] [2022-01-10 23:35:17,727 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [799262226] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:35:17,727 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:35:17,727 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 23:35:17,727 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1922815014] [2022-01-10 23:35:17,727 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:35:17,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 23:35:17,728 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:35:17,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 23:35:17,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:35:17,729 INFO L87 Difference]: Start difference. First operand 21 states and 29 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:17,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:35:17,741 INFO L93 Difference]: Finished difference Result 24 states and 32 transitions. [2022-01-10 23:35:17,741 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 23:35:17,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 15 [2022-01-10 23:35:17,742 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:35:17,742 INFO L225 Difference]: With dead ends: 24 [2022-01-10 23:35:17,742 INFO L226 Difference]: Without dead ends: 22 [2022-01-10 23:35:17,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 23:35:17,743 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 51 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 23:35:17,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 51 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 23:35:17,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-01-10 23:35:17,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-01-10 23:35:17,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.4285714285714286) internal successors, (30), 21 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-10 23:35:17,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 30 transitions. [2022-01-10 23:35:17,747 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 30 transitions. Word has length 15 [2022-01-10 23:35:17,747 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:35:17,747 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 30 transitions. [2022-01-10 23:35:17,747 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:17,747 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 30 transitions. [2022-01-10 23:35:17,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 23:35:17,748 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:35:17,748 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:35:17,748 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 23:35:17,748 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:35:17,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:35:17,749 INFO L85 PathProgramCache]: Analyzing trace with hash 1649488360, now seen corresponding path program 1 times [2022-01-10 23:35:17,749 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:35:17,749 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803738819] [2022-01-10 23:35:17,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:35:17,749 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:35:17,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:35:18,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:35:18,064 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:35:18,064 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803738819] [2022-01-10 23:35:18,065 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803738819] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:35:18,066 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:35:18,066 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 23:35:18,066 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1911039498] [2022-01-10 23:35:18,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:35:18,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 23:35:18,067 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:35:18,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 23:35:18,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-01-10 23:35:18,068 INFO L87 Difference]: Start difference. First operand 22 states and 30 transitions. Second operand has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:18,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:35:18,422 INFO L93 Difference]: Finished difference Result 67 states and 86 transitions. [2022-01-10 23:35:18,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 23:35:18,423 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 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 15 [2022-01-10 23:35:18,424 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:35:18,424 INFO L225 Difference]: With dead ends: 67 [2022-01-10 23:35:18,424 INFO L226 Difference]: Without dead ends: 54 [2022-01-10 23:35:18,425 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=84, Unknown=0, NotChecked=0, Total=132 [2022-01-10 23:35:18,426 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 89 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 23:35:18,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [89 Valid, 67 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 23:35:18,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54 states. [2022-01-10 23:35:18,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54 to 32. [2022-01-10 23:35:18,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.3870967741935485) internal successors, (43), 31 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-10 23:35:18,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 43 transitions. [2022-01-10 23:35:18,431 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 43 transitions. Word has length 15 [2022-01-10 23:35:18,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:35:18,432 INFO L470 AbstractCegarLoop]: Abstraction has 32 states and 43 transitions. [2022-01-10 23:35:18,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.142857142857143) internal successors, (15), 7 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:18,432 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 43 transitions. [2022-01-10 23:35:18,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 23:35:18,432 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:35:18,432 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:35:18,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 23:35:18,433 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:35:18,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:35:18,433 INFO L85 PathProgramCache]: Analyzing trace with hash 1650411881, now seen corresponding path program 1 times [2022-01-10 23:35:18,433 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:35:18,434 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [674208998] [2022-01-10 23:35:18,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:35:18,434 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:35:18,487 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:35:18,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:35:18,633 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:35:18,633 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [674208998] [2022-01-10 23:35:18,633 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [674208998] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:35:18,633 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:35:18,633 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-01-10 23:35:18,634 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937962559] [2022-01-10 23:35:18,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:35:18,634 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-01-10 23:35:18,635 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:35:18,635 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-01-10 23:35:18,635 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2022-01-10 23:35:18,635 INFO L87 Difference]: Start difference. First operand 32 states and 43 transitions. Second operand has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:19,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:35:19,010 INFO L93 Difference]: Finished difference Result 65 states and 85 transitions. [2022-01-10 23:35:19,010 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-01-10 23:35:19,010 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 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 15 [2022-01-10 23:35:19,011 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:35:19,012 INFO L225 Difference]: With dead ends: 65 [2022-01-10 23:35:19,013 INFO L226 Difference]: Without dead ends: 63 [2022-01-10 23:35:19,014 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-01-10 23:35:19,020 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 71 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 23:35:19,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 65 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 23:35:19,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-01-10 23:35:19,024 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 41. [2022-01-10 23:35:19,024 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 40 states have (on average 1.4) internal successors, (56), 40 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:19,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 56 transitions. [2022-01-10 23:35:19,030 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 56 transitions. Word has length 15 [2022-01-10 23:35:19,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:35:19,030 INFO L470 AbstractCegarLoop]: Abstraction has 41 states and 56 transitions. [2022-01-10 23:35:19,030 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 1.875) internal successors, (15), 8 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:19,030 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 56 transitions. [2022-01-10 23:35:19,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-01-10 23:35:19,032 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:35:19,032 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:35:19,032 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 23:35:19,032 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:35:19,035 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:35:19,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1757051734, now seen corresponding path program 1 times [2022-01-10 23:35:19,036 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:35:19,036 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229762695] [2022-01-10 23:35:19,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:35:19,037 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:35:19,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:35:19,132 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:35:19,133 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:35:19,133 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229762695] [2022-01-10 23:35:19,133 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229762695] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:35:19,133 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:35:19,133 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 23:35:19,133 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [410245610] [2022-01-10 23:35:19,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:35:19,134 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 23:35:19,134 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:35:19,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 23:35:19,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-01-10 23:35:19,134 INFO L87 Difference]: Start difference. First operand 41 states and 56 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:19,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:35:19,290 INFO L93 Difference]: Finished difference Result 76 states and 100 transitions. [2022-01-10 23:35:19,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 23:35:19,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 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 15 [2022-01-10 23:35:19,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:35:19,291 INFO L225 Difference]: With dead ends: 76 [2022-01-10 23:35:19,291 INFO L226 Difference]: Without dead ends: 59 [2022-01-10 23:35:19,291 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-01-10 23:35:19,292 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 73 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 88 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:35:19,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [73 Valid, 65 Invalid, 88 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 23:35:19,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-01-10 23:35:19,297 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2022-01-10 23:35:19,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.368421052631579) internal successors, (52), 38 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:19,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 52 transitions. [2022-01-10 23:35:19,297 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 52 transitions. Word has length 15 [2022-01-10 23:35:19,297 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:35:19,298 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 52 transitions. [2022-01-10 23:35:19,298 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:19,298 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 52 transitions. [2022-01-10 23:35:19,298 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 23:35:19,298 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:35:19,298 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:35:19,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 23:35:19,299 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:35:19,299 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:35:19,299 INFO L85 PathProgramCache]: Analyzing trace with hash 252702265, now seen corresponding path program 1 times [2022-01-10 23:35:19,299 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:35:19,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317750738] [2022-01-10 23:35:19,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:35:19,299 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:35:19,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:35:19,442 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:35:19,442 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:35:19,442 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317750738] [2022-01-10 23:35:19,442 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1317750738] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:35:19,442 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:35:19,443 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-01-10 23:35:19,443 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1411749313] [2022-01-10 23:35:19,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:35:19,443 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 23:35:19,444 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:35:19,444 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 23:35:19,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-01-10 23:35:19,444 INFO L87 Difference]: Start difference. First operand 39 states and 52 transitions. Second operand has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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-10 23:35:19,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:35:19,700 INFO L93 Difference]: Finished difference Result 86 states and 113 transitions. [2022-01-10 23:35:19,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-01-10 23:35:19,700 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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-10 23:35:19,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:35:19,701 INFO L225 Difference]: With dead ends: 86 [2022-01-10 23:35:19,701 INFO L226 Difference]: Without dead ends: 73 [2022-01-10 23:35:19,701 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-01-10 23:35:19,702 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 75 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-01-10 23:35:19,702 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 95 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-01-10 23:35:19,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-01-10 23:35:19,707 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 48. [2022-01-10 23:35:19,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.3404255319148937) internal successors, (63), 47 states have internal predecessors, (63), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:19,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 63 transitions. [2022-01-10 23:35:19,708 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 63 transitions. Word has length 16 [2022-01-10 23:35:19,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:35:19,708 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 63 transitions. [2022-01-10 23:35:19,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 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-10 23:35:19,708 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 63 transitions. [2022-01-10 23:35:19,709 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-01-10 23:35:19,709 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:35:19,709 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:35:19,709 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 23:35:19,709 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:35:19,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:35:19,709 INFO L85 PathProgramCache]: Analyzing trace with hash 1141129467, now seen corresponding path program 1 times [2022-01-10 23:35:19,709 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:35:19,709 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458232974] [2022-01-10 23:35:19,710 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:35:19,710 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:35:19,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:35:19,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:35:19,814 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:35:19,814 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458232974] [2022-01-10 23:35:19,816 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [458232974] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 23:35:19,816 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 23:35:19,816 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-01-10 23:35:19,816 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576597957] [2022-01-10 23:35:19,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 23:35:19,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-01-10 23:35:19,817 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 23:35:19,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-01-10 23:35:19,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-01-10 23:35:19,817 INFO L87 Difference]: Start difference. First operand 48 states and 63 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-10 23:35:20,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 23:35:20,006 INFO L93 Difference]: Finished difference Result 74 states and 96 transitions. [2022-01-10 23:35:20,006 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-01-10 23:35:20,006 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-10 23:35:20,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 23:35:20,007 INFO L225 Difference]: With dead ends: 74 [2022-01-10 23:35:20,007 INFO L226 Difference]: Without dead ends: 72 [2022-01-10 23:35:20,007 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-01-10 23:35:20,008 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 58 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 91 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 23:35:20,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [58 Valid, 91 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 23:35:20,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-01-10 23:35:20,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 46. [2022-01-10 23:35:20,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.3555555555555556) internal successors, (61), 45 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 23:35:20,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 61 transitions. [2022-01-10 23:35:20,013 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 61 transitions. Word has length 16 [2022-01-10 23:35:20,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 23:35:20,013 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 61 transitions. [2022-01-10 23:35:20,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 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-10 23:35:20,013 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 61 transitions. [2022-01-10 23:35:20,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 23:35:20,014 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 23:35:20,014 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 23:35:20,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-01-10 23:35:20,014 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-01-10 23:35:20,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 23:35:20,014 INFO L85 PathProgramCache]: Analyzing trace with hash -864461274, now seen corresponding path program 1 times [2022-01-10 23:35:20,014 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 23:35:20,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1047436819] [2022-01-10 23:35:20,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:35:20,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 23:35:20,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:35:20,404 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:35:20,404 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 23:35:20,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1047436819] [2022-01-10 23:35:20,404 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1047436819] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 23:35:20,404 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1396681632] [2022-01-10 23:35:20,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 23:35:20,405 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 23:35:20,405 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 23:35:20,406 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 23:35:20,440 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-01-10 23:35:20,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 23:35:20,677 INFO L263 TraceCheckSpWp]: Trace formula consists of 379 conjuncts, 84 conjunts are in the unsatisfiable core [2022-01-10 23:35:20,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 23:35:20,718 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-01-10 23:35:20,759 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:35:20,762 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:35:20,775 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-01-10 23:35:20,779 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:35:20,781 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:35:20,782 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 27 [2022-01-10 23:35:20,788 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-01-10 23:35:20,794 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:35:20,795 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 0 case distinctions, treesize of input 82 treesize of output 44 [2022-01-10 23:35:20,812 INFO L353 Elim1Store]: treesize reduction 34, result has 34.6 percent of original size [2022-01-10 23:35:20,813 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 37 [2022-01-10 23:35:20,818 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 32 [2022-01-10 23:35:20,824 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 15 [2022-01-10 23:35:20,828 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2022-01-10 23:35:20,975 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:35:20,976 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 56 [2022-01-10 23:35:20,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:35:20,998 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-01-10 23:35:20,998 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 90 treesize of output 59 [2022-01-10 23:35:21,011 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:35:21,020 INFO L353 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-01-10 23:35:21,020 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 89 [2022-01-10 23:35:21,030 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:35:21,031 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:35:21,032 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 50 treesize of output 53 [2022-01-10 23:35:21,063 INFO L353 Elim1Store]: treesize reduction 75, result has 37.5 percent of original size [2022-01-10 23:35:21,063 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 37 treesize of output 61 [2022-01-10 23:35:21,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:35:21,190 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:35:21,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:35:21,195 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 71 [2022-01-10 23:35:21,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 23:35:21,224 INFO L353 Elim1Store]: treesize reduction 66, result has 19.5 percent of original size [2022-01-10 23:35:21,225 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 147 treesize of output 142 [2022-01-10 23:35:21,232 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-10 23:35:21,250 INFO L353 Elim1Store]: treesize reduction 12, result has 71.4 percent of original size [2022-01-10 23:35:21,251 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 38 treesize of output 42 [2022-01-10 23:35:21,642 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 23:35:21,642 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 23:35:22,012 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:35:22,012 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 147 treesize of output 129 [2022-01-10 23:35:30,459 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_352 Int) (|v_v_ULTIMATE.start_main_#t~malloc10#1.base_4Int_4| Int) (v_ArrVal_361 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_2| Int) (v_ArrVal_368 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt| 0)) v_ArrVal_352 v_arrayElimArr_5) |v_v_ULTIMATE.start_main_#t~malloc10#1.base_4Int_4| v_ArrVal_368)) (.cse2 (store (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt| v_ArrVal_352)) v_ArrVal_352 v_ArrVal_367) |v_v_ULTIMATE.start_main_#t~malloc10#1.base_4Int_4| v_ArrVal_361)) (.cse4 (mod (+ 8 |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_2|) 18446744073709551616))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) .cse4)) (.cse0 (select (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) .cse4))) (or (not (= (select (store |c_#validInt| v_ArrVal_352 1) |v_v_ULTIMATE.start_main_#t~malloc10#1.base_4Int_4|) 0)) (and (= .cse0 |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_2|) (= |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt| .cse1)) (not (<= (mod (select |c_#validInt| v_ArrVal_352) 2) 0)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_2| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)) (not (= (select v_arrayElimArr_5 8) 0)) (and (= (select (select .cse2 .cse1) .cse0) 0) (= (select (select .cse3 .cse1) .cse0) 0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_2|)))))) is different from false [2022-01-10 23:35:37,347 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_arrayElimArr_5 (Array Int Int)) (v_ArrVal_352 Int) (|v_v_ULTIMATE.start_main_#t~malloc10#1.base_4Int_4| Int) (v_ArrVal_361 (Array Int Int)) (|v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_2| Int) (v_ArrVal_368 (Array Int Int)) (v_ArrVal_367 (Array Int Int))) (let ((.cse2 (store (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt| (store (select |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt| 0)) v_ArrVal_352 v_arrayElimArr_5) |v_v_ULTIMATE.start_main_#t~malloc10#1.base_4Int_4| v_ArrVal_368)) (.cse3 (store (store (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt| v_ArrVal_352)) v_ArrVal_352 v_ArrVal_367) |v_v_ULTIMATE.start_main_#t~malloc10#1.base_4Int_4| v_ArrVal_361)) (.cse4 (mod (+ 8 |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_2|) 18446744073709551616))) (let ((.cse0 (select (select .cse3 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) .cse4)) (.cse1 (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) .cse4))) (or (not (= (select (store |c_#validInt| v_ArrVal_352 1) |v_v_ULTIMATE.start_main_#t~malloc10#1.base_4Int_4|) 0)) (and (= .cse0 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) (= .cse1 |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_2|)) (not (<= (mod (select |c_#validInt| v_ArrVal_352) 2) 0)) (not (<= |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_2| |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)) (not (= (select v_arrayElimArr_5 8) 0)) (and (= (select (select .cse2 .cse0) .cse1) 0) (= (select (select .cse3 .cse0) .cse1) 0)) (not (<= 0 |v_ULTIMATE.start_ULTIMATE.start_main_~x~0#1.offsetInt_2|)))))) is different from false [2022-01-10 23:35:37,526 INFO L353 Elim1Store]: treesize reduction 17, result has 66.0 percent of original size [2022-01-10 23:35:37,526 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 994 treesize of output 818 [2022-01-10 23:35:37,764 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:35:37,766 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 1090812 treesize of output 1060296 [2022-01-10 23:35:39,176 INFO L353 Elim1Store]: treesize reduction 17, result has 66.0 percent of original size [2022-01-10 23:35:39,179 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1930894 treesize of output 1238546 [2022-01-10 23:35:41,616 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 23:35:41,626 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 21 case distinctions, treesize of input 13983048 treesize of output 13682425 [2022-01-10 23:36:09,636 WARN L228 SmtUtils]: Spent 28.00s on a formula simplification that was a NOOP. DAG size: 8712 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify)