/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_BITWISE.epf -i ../../../trunk/examples/svcomp/forester-heap/dll-queue-1.i -------------------------------------------------------------------------------- This is Ultimate 0.2.2-dev-a10ec3b [2022-01-10 11:54:11,512 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-01-10 11:54:11,513 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-01-10 11:54:11,570 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-01-10 11:54:11,570 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-01-10 11:54:11,572 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-01-10 11:54:11,572 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-01-10 11:54:11,574 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-01-10 11:54:11,575 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-01-10 11:54:11,575 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-01-10 11:54:11,576 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-01-10 11:54:11,576 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-01-10 11:54:11,577 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-01-10 11:54:11,577 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-01-10 11:54:11,578 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-01-10 11:54:11,578 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-01-10 11:54:11,579 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-01-10 11:54:11,580 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-01-10 11:54:11,581 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-01-10 11:54:11,582 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-01-10 11:54:11,583 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-01-10 11:54:11,584 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-01-10 11:54:11,585 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-01-10 11:54:11,585 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-01-10 11:54:11,587 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-01-10 11:54:11,587 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-01-10 11:54:11,587 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-01-10 11:54:11,588 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-01-10 11:54:11,588 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-01-10 11:54:11,589 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-01-10 11:54:11,589 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-01-10 11:54:11,589 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-01-10 11:54:11,590 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-01-10 11:54:11,590 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-01-10 11:54:11,591 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-01-10 11:54:11,591 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-01-10 11:54:11,591 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-01-10 11:54:11,592 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-01-10 11:54:11,592 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-01-10 11:54:11,592 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-01-10 11:54:11,593 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-01-10 11:54:11,594 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/BvToInt/svcomp-Reach-64bit-Automizer_BvToInt_BITWISE.epf [2022-01-10 11:54:11,611 INFO L113 SettingsManager]: Loading preferences was successful [2022-01-10 11:54:11,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-01-10 11:54:11,611 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-01-10 11:54:11,611 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-01-10 11:54:11,612 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-01-10 11:54:11,612 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-01-10 11:54:11,612 INFO L138 SettingsManager]: * Use SBE=true [2022-01-10 11:54:11,612 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-01-10 11:54:11,612 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-01-10 11:54:11,613 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-01-10 11:54:11,613 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-01-10 11:54:11,613 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-01-10 11:54:11,613 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-01-10 11:54:11,613 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-01-10 11:54:11,613 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-01-10 11:54:11,613 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-01-10 11:54:11,613 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-01-10 11:54:11,614 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-01-10 11:54:11,614 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-01-10 11:54:11,614 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-01-10 11:54:11,614 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-01-10 11:54:11,614 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 11:54:11,614 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-01-10 11:54:11,614 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-01-10 11:54:11,614 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-01-10 11:54:11,615 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-01-10 11:54:11,615 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-01-10 11:54:11,615 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-01-10 11:54:11,615 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-01-10 11:54:11,615 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-01-10 11:54:11,615 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2022-01-10 11:54:11,615 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-01-10 11:54:11,616 INFO L136 SettingsManager]: Preferences of IcfgTransformer differ from their defaults: [2022-01-10 11:54:11,616 INFO L138 SettingsManager]: * TransformationType=BV_TO_INT_BITWISE 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 11:54:11,819 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-01-10 11:54:11,836 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-01-10 11:54:11,837 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-01-10 11:54:11,838 INFO L271 PluginConnector]: Initializing CDTParser... [2022-01-10 11:54:11,843 INFO L275 PluginConnector]: CDTParser initialized [2022-01-10 11:54:11,844 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/forester-heap/dll-queue-1.i [2022-01-10 11:54:11,892 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3adbfa18d/09f416cfc05d424fa58941dc96223da1/FLAG095e7116c [2022-01-10 11:54:12,284 INFO L306 CDTParser]: Found 1 translation units. [2022-01-10 11:54:12,284 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/forester-heap/dll-queue-1.i [2022-01-10 11:54:12,300 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3adbfa18d/09f416cfc05d424fa58941dc96223da1/FLAG095e7116c [2022-01-10 11:54:12,308 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3adbfa18d/09f416cfc05d424fa58941dc96223da1 [2022-01-10 11:54:12,310 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-01-10 11:54:12,311 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-01-10 11:54:12,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-01-10 11:54:12,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-01-10 11:54:12,317 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-01-10 11:54:12,317 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:54:12" (1/1) ... [2022-01-10 11:54:12,318 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@62b970f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:12, skipping insertion in model container [2022-01-10 11:54:12,318 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.01 11:54:12" (1/1) ... [2022-01-10 11:54:12,322 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-01-10 11:54:12,348 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-01-10 11:54:12,576 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/dll-queue-1.i[22460,22473] [2022-01-10 11:54:12,579 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/dll-queue-1.i[22531,22544] [2022-01-10 11:54:12,579 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/dll-queue-1.i[22605,22618] [2022-01-10 11:54:12,580 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/dll-queue-1.i[22697,22710] [2022-01-10 11:54:12,580 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/dll-queue-1.i[22774,22787] [2022-01-10 11:54:12,581 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/dll-queue-1.i[22869,22882] [2022-01-10 11:54:12,581 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/dll-queue-1.i[22946,22959] [2022-01-10 11:54:12,582 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/dll-queue-1.i[23029,23042] [2022-01-10 11:54:12,582 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/dll-queue-1.i[23124,23137] [2022-01-10 11:54:12,583 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/dll-queue-1.i[23201,23214] [2022-01-10 11:54:12,583 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/dll-queue-1.i[23284,23297] [2022-01-10 11:54:12,584 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/dll-queue-1.i[23373,23386] [2022-01-10 11:54:12,585 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/dll-queue-1.i[23459,23472] [2022-01-10 11:54:12,586 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/dll-queue-1.i[23604,23617] [2022-01-10 11:54:12,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 11:54:12,603 INFO L203 MainTranslator]: Completed pre-run [2022-01-10 11:54:12,630 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/dll-queue-1.i[22460,22473] [2022-01-10 11:54:12,631 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/dll-queue-1.i[22531,22544] [2022-01-10 11:54:12,631 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/dll-queue-1.i[22605,22618] [2022-01-10 11:54:12,632 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/dll-queue-1.i[22697,22710] [2022-01-10 11:54:12,632 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/dll-queue-1.i[22774,22787] [2022-01-10 11:54:12,633 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/dll-queue-1.i[22869,22882] [2022-01-10 11:54:12,633 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/dll-queue-1.i[22946,22959] [2022-01-10 11:54:12,634 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/dll-queue-1.i[23029,23042] [2022-01-10 11:54:12,634 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/dll-queue-1.i[23124,23137] [2022-01-10 11:54:12,635 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/dll-queue-1.i[23201,23214] [2022-01-10 11:54:12,636 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/dll-queue-1.i[23284,23297] [2022-01-10 11:54:12,637 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/dll-queue-1.i[23373,23386] [2022-01-10 11:54:12,637 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/dll-queue-1.i[23459,23472] [2022-01-10 11:54:12,638 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/dll-queue-1.i[23604,23617] [2022-01-10 11:54:12,639 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-01-10 11:54:12,659 INFO L208 MainTranslator]: Completed translation [2022-01-10 11:54:12,660 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:12 WrapperNode [2022-01-10 11:54:12,660 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-01-10 11:54:12,661 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-01-10 11:54:12,661 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-01-10 11:54:12,661 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-01-10 11:54:12,666 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:54:12" (1/1) ... [2022-01-10 11:54:12,677 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:54:12" (1/1) ... [2022-01-10 11:54:12,708 INFO L137 Inliner]: procedures = 122, calls = 38, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 217 [2022-01-10 11:54:12,708 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-01-10 11:54:12,709 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-01-10 11:54:12,709 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-01-10 11:54:12,709 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-01-10 11:54:12,714 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:12" (1/1) ... [2022-01-10 11:54:12,715 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:12" (1/1) ... [2022-01-10 11:54:12,718 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:12" (1/1) ... [2022-01-10 11:54:12,718 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:12" (1/1) ... [2022-01-10 11:54:12,724 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:12" (1/1) ... [2022-01-10 11:54:12,735 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:12" (1/1) ... [2022-01-10 11:54:12,737 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:12" (1/1) ... [2022-01-10 11:54:12,739 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-01-10 11:54:12,740 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-01-10 11:54:12,740 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-01-10 11:54:12,740 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-01-10 11:54:12,740 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:12" (1/1) ... [2022-01-10 11:54:12,751 INFO L168 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-01-10 11:54:12,758 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:54:12,767 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 11:54:12,768 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 11:54:12,792 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-01-10 11:54:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-01-10 11:54:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-01-10 11:54:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-01-10 11:54:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-01-10 11:54:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-01-10 11:54:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-01-10 11:54:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-01-10 11:54:12,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-01-10 11:54:12,794 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-01-10 11:54:12,888 INFO L234 CfgBuilder]: Building ICFG [2022-01-10 11:54:12,889 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-01-10 11:54:13,187 INFO L275 CfgBuilder]: Performing block encoding [2022-01-10 11:54:13,195 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-01-10 11:54:13,196 INFO L299 CfgBuilder]: Removed 31 assume(true) statements. [2022-01-10 11:54:13,197 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:54:13 BoogieIcfgContainer [2022-01-10 11:54:13,197 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-01-10 11:54:13,198 INFO L113 PluginConnector]: ------------------------IcfgTransformer---------------------------- [2022-01-10 11:54:13,198 INFO L271 PluginConnector]: Initializing IcfgTransformer... [2022-01-10 11:54:13,200 INFO L275 PluginConnector]: IcfgTransformer initialized [2022-01-10 11:54:13,201 INFO L185 PluginConnector]: Executing the observer IcfgTransformationObserver from plugin IcfgTransformer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:54:13" (1/1) ... [2022-01-10 11:54:13,305 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:54:13 BasicIcfg [2022-01-10 11:54:13,305 INFO L132 PluginConnector]: ------------------------ END IcfgTransformer---------------------------- [2022-01-10 11:54:13,307 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-01-10 11:54:13,307 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-01-10 11:54:13,309 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-01-10 11:54:13,309 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.01 11:54:12" (1/4) ... [2022-01-10 11:54:13,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c2725f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:54:13, skipping insertion in model container [2022-01-10 11:54:13,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.01 11:54:12" (2/4) ... [2022-01-10 11:54:13,310 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c2725f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.01 11:54:13, skipping insertion in model container [2022-01-10 11:54:13,310 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.01 11:54:13" (3/4) ... [2022-01-10 11:54:13,311 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40c2725f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.01 11:54:13, skipping insertion in model container [2022-01-10 11:54:13,311 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.icfgtransformation CFG 10.01 11:54:13" (4/4) ... [2022-01-10 11:54:13,314 INFO L111 eAbstractionObserver]: Analyzing ICFG dll-queue-1.iTransformedIcfg [2022-01-10 11:54:13,317 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-01-10 11:54:13,318 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 14 error locations. [2022-01-10 11:54:13,364 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-01-10 11:54:13,369 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 11:54:13,369 INFO L340 AbstractCegarLoop]: Starting to check reachability of 14 error locations. [2022-01-10 11:54:13,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 82 states, 67 states have (on average 2.029850746268657) internal successors, (136), 81 states have internal predecessors, (136), 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 11:54:13,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-01-10 11:54:13,383 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:13,383 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-01-10 11:54:13,383 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-01-10 11:54:13,386 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:13,386 INFO L85 PathProgramCache]: Analyzing trace with hash 347398932, now seen corresponding path program 1 times [2022-01-10 11:54:13,392 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:13,392 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239875978] [2022-01-10 11:54:13,393 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:13,393 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:13,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:13,559 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 11:54:13,560 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:13,560 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [239875978] [2022-01-10 11:54:13,560 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [239875978] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:13,560 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:13,560 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-01-10 11:54:13,561 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [928776187] [2022-01-10 11:54:13,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:13,565 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-01-10 11:54:13,565 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:13,588 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-01-10 11:54:13,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-01-10 11:54:13,591 INFO L87 Difference]: Start difference. First operand has 82 states, 67 states have (on average 2.029850746268657) internal successors, (136), 81 states have internal predecessors, (136), 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 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 11:54:13,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:13,615 INFO L93 Difference]: Finished difference Result 162 states and 270 transitions. [2022-01-10 11:54:13,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-01-10 11:54:13,618 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 5 [2022-01-10 11:54:13,618 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:13,624 INFO L225 Difference]: With dead ends: 162 [2022-01-10 11:54:13,624 INFO L226 Difference]: Without dead ends: 77 [2022-01-10 11:54:13,626 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 11:54:13,630 INFO L933 BasicCegarLoop]: 91 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, 91 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 11:54:13,633 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:54:13,644 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-01-10 11:54:13,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2022-01-10 11:54:13,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 63 states have (on average 1.3492063492063493) internal successors, (85), 76 states have internal predecessors, (85), 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 11:54:13,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 85 transitions. [2022-01-10 11:54:13,660 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 85 transitions. Word has length 5 [2022-01-10 11:54:13,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:13,660 INFO L470 AbstractCegarLoop]: Abstraction has 77 states and 85 transitions. [2022-01-10 11:54:13,660 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 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 11:54:13,661 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 85 transitions. [2022-01-10 11:54:13,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-01-10 11:54:13,661 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:13,661 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-01-10 11:54:13,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-01-10 11:54:13,662 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-01-10 11:54:13,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:13,664 INFO L85 PathProgramCache]: Analyzing trace with hash 347399893, now seen corresponding path program 1 times [2022-01-10 11:54:13,664 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:13,664 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [793849528] [2022-01-10 11:54:13,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:13,664 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:13,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:13,733 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 11:54:13,733 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:13,733 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [793849528] [2022-01-10 11:54:13,733 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [793849528] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:13,734 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:13,734 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:54:13,734 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [82166627] [2022-01-10 11:54:13,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:13,735 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:54:13,735 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:13,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:54:13,736 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:54:13,736 INFO L87 Difference]: Start difference. First operand 77 states and 85 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 11:54:13,778 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:13,778 INFO L93 Difference]: Finished difference Result 77 states and 85 transitions. [2022-01-10 11:54:13,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:54:13,779 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 5 [2022-01-10 11:54:13,779 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:13,781 INFO L225 Difference]: With dead ends: 77 [2022-01-10 11:54:13,782 INFO L226 Difference]: Without dead ends: 67 [2022-01-10 11:54:13,782 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 11:54:13,783 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 72 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:13,785 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 63 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:54:13,787 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-01-10 11:54:13,791 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2022-01-10 11:54:13,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 58 states have (on average 1.293103448275862) internal successors, (75), 66 states have internal predecessors, (75), 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 11:54:13,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 75 transitions. [2022-01-10 11:54:13,792 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 75 transitions. Word has length 5 [2022-01-10 11:54:13,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:13,793 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 75 transitions. [2022-01-10 11:54:13,793 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 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 11:54:13,793 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 75 transitions. [2022-01-10 11:54:13,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-01-10 11:54:13,794 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:13,794 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:54:13,794 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-01-10 11:54:13,794 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-01-10 11:54:13,794 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:13,794 INFO L85 PathProgramCache]: Analyzing trace with hash -1449953722, now seen corresponding path program 1 times [2022-01-10 11:54:13,795 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:13,795 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1818001295] [2022-01-10 11:54:13,795 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:13,795 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:13,848 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:13,925 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 11:54:13,926 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:13,926 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1818001295] [2022-01-10 11:54:13,926 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1818001295] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:13,926 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:13,926 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 11:54:13,926 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [544112266] [2022-01-10 11:54:13,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:13,927 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 11:54:13,927 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:13,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 11:54:13,927 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 11:54:13,928 INFO L87 Difference]: Start difference. First operand 67 states and 75 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 11:54:14,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:14,054 INFO L93 Difference]: Finished difference Result 115 states and 127 transitions. [2022-01-10 11:54:14,055 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-01-10 11:54:14,055 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2022-01-10 11:54:14,055 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:14,056 INFO L225 Difference]: With dead ends: 115 [2022-01-10 11:54:14,056 INFO L226 Difference]: Without dead ends: 113 [2022-01-10 11:54:14,056 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 11:54:14,057 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 157 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 157 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:14,058 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [157 Valid, 113 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 11:54:14,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-01-10 11:54:14,062 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 65. [2022-01-10 11:54:14,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 57 states have (on average 1.280701754385965) internal successors, (73), 64 states have internal predecessors, (73), 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 11:54:14,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 73 transitions. [2022-01-10 11:54:14,063 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 73 transitions. Word has length 8 [2022-01-10 11:54:14,063 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:14,063 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 73 transitions. [2022-01-10 11:54:14,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 11:54:14,064 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 73 transitions. [2022-01-10 11:54:14,064 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-01-10 11:54:14,064 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:14,064 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:54:14,064 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-01-10 11:54:14,064 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-01-10 11:54:14,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:14,065 INFO L85 PathProgramCache]: Analyzing trace with hash -880387413, now seen corresponding path program 1 times [2022-01-10 11:54:14,065 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:14,065 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604767618] [2022-01-10 11:54:14,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:14,066 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:14,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:14,095 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 11:54:14,095 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:14,095 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604767618] [2022-01-10 11:54:14,095 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604767618] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:14,096 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:14,096 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:54:14,096 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910517639] [2022-01-10 11:54:14,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:14,096 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:54:14,096 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:14,097 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:54:14,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:54:14,097 INFO L87 Difference]: Start difference. First operand 65 states and 73 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11:54:14,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:14,143 INFO L93 Difference]: Finished difference Result 144 states and 166 transitions. [2022-01-10 11:54:14,143 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:54:14,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11 [2022-01-10 11:54:14,144 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:14,144 INFO L225 Difference]: With dead ends: 144 [2022-01-10 11:54:14,144 INFO L226 Difference]: Without dead ends: 81 [2022-01-10 11:54:14,145 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 11:54:14,146 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 14 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:14,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 127 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:54:14,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2022-01-10 11:54:14,151 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 72. [2022-01-10 11:54:14,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 64 states have (on average 1.265625) internal successors, (81), 71 states have internal predecessors, (81), 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 11:54:14,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 81 transitions. [2022-01-10 11:54:14,152 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 81 transitions. Word has length 11 [2022-01-10 11:54:14,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:14,152 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 81 transitions. [2022-01-10 11:54:14,153 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 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 11:54:14,153 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 81 transitions. [2022-01-10 11:54:14,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 11:54:14,153 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:14,153 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:54:14,153 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-01-10 11:54:14,154 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-01-10 11:54:14,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:14,154 INFO L85 PathProgramCache]: Analyzing trace with hash 928658240, now seen corresponding path program 1 times [2022-01-10 11:54:14,154 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:14,155 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1681339550] [2022-01-10 11:54:14,155 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:14,155 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:14,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:14,212 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 11:54:14,212 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:14,212 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1681339550] [2022-01-10 11:54:14,213 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1681339550] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:14,213 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:14,213 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:54:14,213 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [235365088] [2022-01-10 11:54:14,213 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:14,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:54:14,213 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:14,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:54:14,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:54:14,214 INFO L87 Difference]: Start difference. First operand 72 states and 81 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:14,240 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:14,241 INFO L93 Difference]: Finished difference Result 75 states and 84 transitions. [2022-01-10 11:54:14,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:54:14,241 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-01-10 11:54:14,241 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:14,242 INFO L225 Difference]: With dead ends: 75 [2022-01-10 11:54:14,242 INFO L226 Difference]: Without dead ends: 73 [2022-01-10 11:54:14,242 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 11:54:14,243 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 0 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 139 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 11:54:14,243 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 139 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:54:14,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-01-10 11:54:14,246 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 73. [2022-01-10 11:54:14,246 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 65 states have (on average 1.2615384615384615) internal successors, (82), 72 states have internal predecessors, (82), 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 11:54:14,247 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 82 transitions. [2022-01-10 11:54:14,247 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 82 transitions. Word has length 14 [2022-01-10 11:54:14,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:14,247 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 82 transitions. [2022-01-10 11:54:14,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:14,247 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 82 transitions. [2022-01-10 11:54:14,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-01-10 11:54:14,248 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:14,248 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:54:14,248 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-01-10 11:54:14,248 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-01-10 11:54:14,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:14,248 INFO L85 PathProgramCache]: Analyzing trace with hash 928659201, now seen corresponding path program 1 times [2022-01-10 11:54:14,249 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:14,249 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909749273] [2022-01-10 11:54:14,249 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:14,249 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:14,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:14,327 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 11:54:14,328 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:14,328 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909749273] [2022-01-10 11:54:14,328 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [909749273] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:14,328 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:14,328 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-01-10 11:54:14,328 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1342271553] [2022-01-10 11:54:14,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:14,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-01-10 11:54:14,329 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:14,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-01-10 11:54:14,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-01-10 11:54:14,329 INFO L87 Difference]: Start difference. First operand 73 states and 82 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:14,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:14,374 INFO L93 Difference]: Finished difference Result 89 states and 100 transitions. [2022-01-10 11:54:14,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-01-10 11:54:14,375 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-01-10 11:54:14,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:14,376 INFO L225 Difference]: With dead ends: 89 [2022-01-10 11:54:14,376 INFO L226 Difference]: Without dead ends: 68 [2022-01-10 11:54:14,379 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-01-10 11:54:14,384 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 6 mSDsluCounter, 121 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:14,384 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 187 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:54:14,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-01-10 11:54:14,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2022-01-10 11:54:14,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 60 states have (on average 1.2666666666666666) internal successors, (76), 67 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:14,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 76 transitions. [2022-01-10 11:54:14,396 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 76 transitions. Word has length 14 [2022-01-10 11:54:14,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:14,396 INFO L470 AbstractCegarLoop]: Abstraction has 68 states and 76 transitions. [2022-01-10 11:54:14,396 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:14,396 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 76 transitions. [2022-01-10 11:54:14,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-01-10 11:54:14,411 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:14,412 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 11:54:14,412 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-01-10 11:54:14,412 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-01-10 11:54:14,412 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:14,412 INFO L85 PathProgramCache]: Analyzing trace with hash 1691763558, now seen corresponding path program 1 times [2022-01-10 11:54:14,412 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:14,413 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200078233] [2022-01-10 11:54:14,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:14,413 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:14,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:14,541 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 11:54:14,541 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:14,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200078233] [2022-01-10 11:54:14,541 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200078233] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:54:14,541 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1950397072] [2022-01-10 11:54:14,541 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:14,542 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:54:14,542 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:54:14,543 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 11:54:14,544 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 11:54:14,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:14,657 INFO L263 TraceCheckSpWp]: Trace formula consists of 302 conjuncts, 29 conjunts are in the unsatisfiable core [2022-01-10 11:54:14,662 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:54:14,716 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 11:54:14,784 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2022-01-10 11:54:14,801 INFO L353 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2022-01-10 11:54:14,801 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 60 [2022-01-10 11:54:14,807 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-01-10 11:54:14,815 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-10 11:54:14,815 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 18 [2022-01-10 11:54:14,857 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 11:54:14,857 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 28 [2022-01-10 11:54:15,006 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2022-01-10 11:54:15,018 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 11:54:15,019 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:54:15,109 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_301 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| v_ArrVal_301) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|))) (or (not (<= 0 .cse0)) (<= 1 .cse0)))) is different from false [2022-01-10 11:54:15,148 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:54:15,149 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 50 [2022-01-10 11:54:15,170 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:54:15,171 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 367 treesize of output 246 [2022-01-10 11:54:15,177 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 220 treesize of output 204 [2022-01-10 11:54:15,201 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 155 treesize of output 151 [2022-01-10 11:54:15,211 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 200 treesize of output 192 [2022-01-10 11:54:15,518 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 11:54:15,518 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1950397072] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:54:15,518 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:54:15,518 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 12 [2022-01-10 11:54:15,518 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1884102328] [2022-01-10 11:54:15,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:54:15,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-01-10 11:54:15,519 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:15,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-01-10 11:54:15,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=83, Unknown=1, NotChecked=18, Total=132 [2022-01-10 11:54:15,519 INFO L87 Difference]: Start difference. First operand 68 states and 76 transitions. Second operand has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 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 11:54:15,703 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:15,703 INFO L93 Difference]: Finished difference Result 138 states and 152 transitions. [2022-01-10 11:54:15,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 11:54:15,704 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 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) Word has length 17 [2022-01-10 11:54:15,704 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:15,705 INFO L225 Difference]: With dead ends: 138 [2022-01-10 11:54:15,705 INFO L226 Difference]: Without dead ends: 136 [2022-01-10 11:54:15,705 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 26 SyntacticMatches, 3 SemanticMatches, 13 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=53, Invalid=132, Unknown=1, NotChecked=24, Total=210 [2022-01-10 11:54:15,705 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 185 mSDsluCounter, 320 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 104 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:15,706 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 373 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 131 Invalid, 0 Unknown, 104 Unchecked, 0.1s Time] [2022-01-10 11:54:15,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2022-01-10 11:54:15,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 80. [2022-01-10 11:54:15,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 72 states have (on average 1.25) internal successors, (90), 79 states have internal predecessors, (90), 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 11:54:15,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 90 transitions. [2022-01-10 11:54:15,710 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 90 transitions. Word has length 17 [2022-01-10 11:54:15,710 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:15,710 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 90 transitions. [2022-01-10 11:54:15,710 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.75) internal successors, (45), 12 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 11:54:15,710 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 90 transitions. [2022-01-10 11:54:15,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-01-10 11:54:15,711 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:15,711 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:54:15,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-01-10 11:54:15,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:54:15,916 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-01-10 11:54:15,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:15,916 INFO L85 PathProgramCache]: Analyzing trace with hash 1825517732, now seen corresponding path program 1 times [2022-01-10 11:54:15,916 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:15,916 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [965246944] [2022-01-10 11:54:15,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:15,916 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:15,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:15,948 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:54:15,948 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:15,948 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [965246944] [2022-01-10 11:54:15,949 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [965246944] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:15,949 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:15,949 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:54:15,949 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [346668442] [2022-01-10 11:54:15,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:15,949 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:54:15,949 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:15,950 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:54:15,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:54:15,950 INFO L87 Difference]: Start difference. First operand 80 states and 90 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:15,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:15,971 INFO L93 Difference]: Finished difference Result 166 states and 191 transitions. [2022-01-10 11:54:15,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:54:15,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-01-10 11:54:15,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:15,972 INFO L225 Difference]: With dead ends: 166 [2022-01-10 11:54:15,972 INFO L226 Difference]: Without dead ends: 102 [2022-01-10 11:54:15,972 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 11:54:15,973 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 22 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 23 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:15,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 120 Invalid, 23 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:54:15,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-01-10 11:54:15,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 92. [2022-01-10 11:54:15,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 84 states have (on average 1.2142857142857142) internal successors, (102), 91 states have internal predecessors, (102), 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 11:54:15,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2022-01-10 11:54:15,977 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 18 [2022-01-10 11:54:15,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:15,977 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2022-01-10 11:54:15,977 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:15,977 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2022-01-10 11:54:15,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-01-10 11:54:15,977 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:15,978 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:54:15,978 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-01-10 11:54:15,978 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-01-10 11:54:15,978 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:15,978 INFO L85 PathProgramCache]: Analyzing trace with hash 1634392855, now seen corresponding path program 1 times [2022-01-10 11:54:15,978 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:15,978 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697349322] [2022-01-10 11:54:15,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:15,978 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:15,998 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:16,015 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 11:54:16,015 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:16,015 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697349322] [2022-01-10 11:54:16,015 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697349322] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:16,015 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:16,015 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:54:16,015 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1045764506] [2022-01-10 11:54:16,015 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:16,016 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:54:16,016 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:16,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:54:16,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:54:16,016 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 11:54:16,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:16,036 INFO L93 Difference]: Finished difference Result 164 states and 183 transitions. [2022-01-10 11:54:16,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:54:16,036 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 24 [2022-01-10 11:54:16,036 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:16,036 INFO L225 Difference]: With dead ends: 164 [2022-01-10 11:54:16,036 INFO L226 Difference]: Without dead ends: 88 [2022-01-10 11:54:16,038 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 11:54:16,040 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 53 mSDsluCounter, 23 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:16,040 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 105 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:54:16,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-01-10 11:54:16,046 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 78. [2022-01-10 11:54:16,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 71 states have (on average 1.1830985915492958) internal successors, (84), 77 states have internal predecessors, (84), 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 11:54:16,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 84 transitions. [2022-01-10 11:54:16,047 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 84 transitions. Word has length 24 [2022-01-10 11:54:16,048 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:16,048 INFO L470 AbstractCegarLoop]: Abstraction has 78 states and 84 transitions. [2022-01-10 11:54:16,048 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 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 11:54:16,048 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 84 transitions. [2022-01-10 11:54:16,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 11:54:16,049 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:16,049 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:54:16,049 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-01-10 11:54:16,049 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr13ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-01-10 11:54:16,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:16,049 INFO L85 PathProgramCache]: Analyzing trace with hash -15082139, now seen corresponding path program 1 times [2022-01-10 11:54:16,049 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:16,049 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [523668332] [2022-01-10 11:54:16,050 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:16,050 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:16,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:16,451 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 11:54:16,451 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:16,451 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [523668332] [2022-01-10 11:54:16,452 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [523668332] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:54:16,452 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1063276066] [2022-01-10 11:54:16,455 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:16,455 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:54:16,455 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:54:16,462 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 11:54:16,463 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-01-10 11:54:16,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:16,741 INFO L263 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 51 conjunts are in the unsatisfiable core [2022-01-10 11:54:16,744 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:54:16,754 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 11:54:16,779 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2022-01-10 11:54:16,784 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2022-01-10 11:54:16,804 INFO L353 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2022-01-10 11:54:16,805 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 70 [2022-01-10 11:54:16,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:16,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:16,812 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:16,813 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:54:16,814 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2022-01-10 11:54:16,817 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-01-10 11:54:16,824 INFO L353 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-01-10 11:54:16,825 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-01-10 11:54:16,856 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 11:54:16,856 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 45 [2022-01-10 11:54:16,859 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-01-10 11:54:16,862 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2022-01-10 11:54:17,060 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-01-10 11:54:17,067 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-01-10 11:54:17,114 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 57 treesize of output 37 [2022-01-10 11:54:17,121 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 11:54:17,121 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:54:17,279 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 126 treesize of output 82 [2022-01-10 11:54:17,326 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_657 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| v_ArrVal_657) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|))) (or (and (= (mod (+ |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt| 16) 18446744073709551616) (mod (+ 16 .cse0) 18446744073709551616)) (forall ((v_ArrVal_658 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| v_ArrVal_658) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt|))) (not (<= 0 .cse0))))) is different from false [2022-01-10 11:54:17,349 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:54:17,350 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 168 treesize of output 144 [2022-01-10 11:54:17,356 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:54:17,356 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 144 treesize of output 112 [2022-01-10 11:54:17,367 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:54:17,368 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 393 treesize of output 324 [2022-01-10 11:54:17,388 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:54:17,391 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1357 treesize of output 1248 [2022-01-10 11:54:17,407 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1248 treesize of output 1224 [2022-01-10 11:54:17,431 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1224 treesize of output 1190 [2022-01-10 11:54:17,443 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1190 treesize of output 1142 [2022-01-10 11:54:17,454 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1142 treesize of output 1090 [2022-01-10 11:54:17,466 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1090 treesize of output 1084 [2022-01-10 11:54:17,493 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 757 treesize of output 745 [2022-01-10 11:54:18,003 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 11:54:18,003 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1063276066] provided 0 perfect and 2 imperfect interpolant sequences [2022-01-10 11:54:18,003 INFO L186 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-01-10 11:54:18,003 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 7] total 14 [2022-01-10 11:54:18,004 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133661085] [2022-01-10 11:54:18,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-01-10 11:54:18,004 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-01-10 11:54:18,004 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:18,004 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-01-10 11:54:18,004 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=122, Unknown=1, NotChecked=22, Total=182 [2022-01-10 11:54:18,005 INFO L87 Difference]: Start difference. First operand 78 states and 84 transitions. Second operand has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 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 11:54:18,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:18,248 INFO L93 Difference]: Finished difference Result 142 states and 153 transitions. [2022-01-10 11:54:18,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-01-10 11:54:18,249 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 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 25 [2022-01-10 11:54:18,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:18,249 INFO L225 Difference]: With dead ends: 142 [2022-01-10 11:54:18,249 INFO L226 Difference]: Without dead ends: 140 [2022-01-10 11:54:18,250 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 43 SyntacticMatches, 3 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=66, Invalid=177, Unknown=1, NotChecked=28, Total=272 [2022-01-10 11:54:18,250 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 164 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 107 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 417 SdHoareTripleChecker+Invalid, 284 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 107 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 151 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:18,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [164 Valid, 417 Invalid, 284 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 107 Invalid, 0 Unknown, 151 Unchecked, 0.1s Time] [2022-01-10 11:54:18,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-01-10 11:54:18,254 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 82. [2022-01-10 11:54:18,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 75 states have (on average 1.1866666666666668) internal successors, (89), 81 states have internal predecessors, (89), 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 11:54:18,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 89 transitions. [2022-01-10 11:54:18,255 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 89 transitions. Word has length 25 [2022-01-10 11:54:18,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:18,255 INFO L470 AbstractCegarLoop]: Abstraction has 82 states and 89 transitions. [2022-01-10 11:54:18,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 14 states have (on average 4.785714285714286) internal successors, (67), 14 states have internal predecessors, (67), 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 11:54:18,255 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 89 transitions. [2022-01-10 11:54:18,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-01-10 11:54:18,255 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:18,256 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:54:18,283 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-01-10 11:54:18,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-01-10 11:54:18,465 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-01-10 11:54:18,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:18,465 INFO L85 PathProgramCache]: Analyzing trace with hash 47025939, now seen corresponding path program 1 times [2022-01-10 11:54:18,465 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:18,465 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1702775179] [2022-01-10 11:54:18,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:18,466 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:18,507 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:18,592 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:54:18,592 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:18,592 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1702775179] [2022-01-10 11:54:18,593 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1702775179] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:54:18,593 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1573449644] [2022-01-10 11:54:18,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:18,593 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:54:18,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:54:18,594 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 11:54:18,595 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-01-10 11:54:18,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:18,734 INFO L263 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 50 conjunts are in the unsatisfiable core [2022-01-10 11:54:18,736 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:54:18,747 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 11:54:18,769 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2022-01-10 11:54:18,779 INFO L353 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2022-01-10 11:54:18,780 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 71 treesize of output 61 [2022-01-10 11:54:18,783 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-01-10 11:54:18,793 INFO L353 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-01-10 11:54:18,793 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 2 case distinctions, treesize of input 25 treesize of output 29 [2022-01-10 11:54:18,829 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 11:54:18,830 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 35 [2022-01-10 11:54:18,904 INFO L353 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-01-10 11:54:18,905 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 81 treesize of output 50 [2022-01-10 11:54:18,929 INFO L353 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2022-01-10 11:54:18,930 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 119 treesize of output 87 [2022-01-10 11:54:18,935 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 48 [2022-01-10 11:54:18,948 INFO L353 Elim1Store]: treesize reduction 8, result has 78.4 percent of original size [2022-01-10 11:54:18,948 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 41 treesize of output 41 [2022-01-10 11:54:19,043 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-01-10 11:54:19,043 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 59 treesize of output 52 [2022-01-10 11:54:19,230 INFO L353 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-01-10 11:54:19,231 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 23 [2022-01-10 11:54:19,242 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:54:19,242 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:54:19,304 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_930 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| v_ArrVal_930) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|))) (or (not (<= 0 .cse0)) (<= 1 .cse0)))) is different from false [2022-01-10 11:54:19,329 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_926 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt| Int) (v_ArrVal_925 Int)) (let ((.cse0 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt| v_ArrVal_925)))) (store (store .cse2 v_ArrVal_925 v_ArrVal_926) (select (select (store .cse2 v_ArrVal_925 v_ArrVal_924) |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt|) v_ArrVal_930)) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)) (.cse1 (select |c_#validInt| v_ArrVal_925))) (or (<= 1 .cse0) (not (<= 0 .cse1)) (not (<= 0 .cse0)) (not (<= .cse1 0))))) is different from false [2022-01-10 11:54:19,407 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:54:19,407 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 66 treesize of output 60 [2022-01-10 11:54:19,422 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_930 (Array Int Int)) (v_ArrVal_924 (Array Int Int)) (v_ArrVal_926 (Array Int Int)) (|ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt| Int) (v_arrayElimArr_9 (Array Int Int))) (let ((.cse3 (select v_arrayElimArr_9 |ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt|))) (let ((.cse0 (select |c_#validInt| .cse3)) (.cse1 (select (select (let ((.cse2 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| v_arrayElimArr_9))) (store (store .cse2 .cse3 v_ArrVal_926) (select (select (store .cse2 .cse3 v_ArrVal_924) |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt|) |ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt|) v_ArrVal_930)) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|))) (or (not (<= .cse0 0)) (not (<= 0 .cse1)) (not (<= 0 .cse0)) (<= 1 .cse1))))) is different from false [2022-01-10 11:54:19,436 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:54:19,436 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 124 [2022-01-10 11:54:19,451 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:54:19,452 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15763 treesize of output 11262 [2022-01-10 11:54:19,506 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11220 treesize of output 10484 [2022-01-10 11:54:19,582 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10484 treesize of output 10228 [2022-01-10 11:54:19,626 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10228 treesize of output 10100 [2022-01-10 11:54:19,672 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7615 treesize of output 7583 [2022-01-10 11:54:19,739 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:54:19,740 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 10090 treesize of output 9086 [2022-01-10 11:54:19,787 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9060 treesize of output 8948 [2022-01-10 11:54:46,602 WARN L312 FreeRefinementEngine]: Interpolation failed due to KNOWN_DEPENDING: BigInteger out of long range [2022-01-10 11:54:46,603 INFO L186 FreeRefinementEngine]: Found 0 perfect and 1 imperfect interpolant sequences. [2022-01-10 11:54:46,603 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7] total 7 [2022-01-10 11:54:46,603 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355369891] [2022-01-10 11:54:46,603 INFO L85 oduleStraightlineAll]: Using 1 imperfect interpolants to construct interpolant automaton [2022-01-10 11:54:46,603 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-01-10 11:54:46,603 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:46,603 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-01-10 11:54:46,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=103, Unknown=3, NotChecked=66, Total=210 [2022-01-10 11:54:46,604 INFO L87 Difference]: Start difference. First operand 82 states and 89 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:46,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:46,701 INFO L93 Difference]: Finished difference Result 82 states and 89 transitions. [2022-01-10 11:54:46,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-01-10 11:54:46,701 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-01-10 11:54:46,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:46,702 INFO L225 Difference]: With dead ends: 82 [2022-01-10 11:54:46,702 INFO L226 Difference]: Without dead ends: 80 [2022-01-10 11:54:46,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 39 SyntacticMatches, 2 SemanticMatches, 14 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=120, Unknown=3, NotChecked=72, Total=240 [2022-01-10 11:54:46,703 INFO L933 BasicCegarLoop]: 49 mSDtfsCounter, 109 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:46,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 150 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-01-10 11:54:46,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-01-10 11:54:46,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2022-01-10 11:54:46,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 74 states have (on average 1.1756756756756757) internal successors, (87), 79 states have internal predecessors, (87), 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 11:54:46,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 87 transitions. [2022-01-10 11:54:46,706 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 87 transitions. Word has length 25 [2022-01-10 11:54:46,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:46,706 INFO L470 AbstractCegarLoop]: Abstraction has 80 states and 87 transitions. [2022-01-10 11:54:46,706 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:46,706 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 87 transitions. [2022-01-10 11:54:46,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-01-10 11:54:46,707 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:46,707 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:54:46,726 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-01-10 11:54:46,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:54:46,920 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-01-10 11:54:46,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:46,920 INFO L85 PathProgramCache]: Analyzing trace with hash -1916676407, now seen corresponding path program 1 times [2022-01-10 11:54:46,920 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:46,920 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1469731027] [2022-01-10 11:54:46,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:46,920 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:46,946 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:46,975 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-01-10 11:54:46,975 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:46,975 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1469731027] [2022-01-10 11:54:46,976 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1469731027] provided 1 perfect and 0 imperfect interpolant sequences [2022-01-10 11:54:46,976 INFO L186 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-01-10 11:54:46,976 INFO L199 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-01-10 11:54:46,976 INFO L115 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2134315785] [2022-01-10 11:54:46,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-01-10 11:54:46,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-01-10 11:54:46,977 INFO L103 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-01-10 11:54:46,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-01-10 11:54:46,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-01-10 11:54:46,977 INFO L87 Difference]: Start difference. First operand 80 states and 87 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:47,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-01-10 11:54:47,005 INFO L93 Difference]: Finished difference Result 158 states and 175 transitions. [2022-01-10 11:54:47,005 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-01-10 11:54:47,006 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-01-10 11:54:47,006 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-01-10 11:54:47,006 INFO L225 Difference]: With dead ends: 158 [2022-01-10 11:54:47,006 INFO L226 Difference]: Without dead ends: 103 [2022-01-10 11:54:47,007 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 11:54:47,008 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 25 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-01-10 11:54:47,008 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 127 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-01-10 11:54:47,008 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-01-10 11:54:47,011 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 93. [2022-01-10 11:54:47,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 87 states have (on average 1.160919540229885) internal successors, (101), 92 states have internal predecessors, (101), 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 11:54:47,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 101 transitions. [2022-01-10 11:54:47,012 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 101 transitions. Word has length 26 [2022-01-10 11:54:47,012 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-01-10 11:54:47,012 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 101 transitions. [2022-01-10 11:54:47,012 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-01-10 11:54:47,013 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 101 transitions. [2022-01-10 11:54:47,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-01-10 11:54:47,014 INFO L506 BasicCegarLoop]: Found error trace [2022-01-10 11:54:47,014 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-01-10 11:54:47,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-01-10 11:54:47,015 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION (and 11 more)] === [2022-01-10 11:54:47,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-01-10 11:54:47,015 INFO L85 PathProgramCache]: Analyzing trace with hash 791793033, now seen corresponding path program 1 times [2022-01-10 11:54:47,015 INFO L121 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-01-10 11:54:47,015 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452909560] [2022-01-10 11:54:47,015 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:47,015 INFO L126 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-01-10 11:54:47,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:47,191 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:54:47,192 INFO L139 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-01-10 11:54:47,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452909560] [2022-01-10 11:54:47,192 INFO L160 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452909560] provided 0 perfect and 1 imperfect interpolant sequences [2022-01-10 11:54:47,192 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [836051782] [2022-01-10 11:54:47,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-01-10 11:54:47,192 INFO L168 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-01-10 11:54:47,192 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-01-10 11:54:47,193 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-01-10 11:54:47,195 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-01-10 11:54:47,347 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-01-10 11:54:47,349 INFO L263 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 67 conjunts are in the unsatisfiable core [2022-01-10 11:54:47,352 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-01-10 11:54:47,360 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 11:54:47,388 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2022-01-10 11:54:47,392 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2022-01-10 11:54:47,404 INFO L353 Elim1Store]: treesize reduction 50, result has 9.1 percent of original size [2022-01-10 11:54:47,404 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 85 [2022-01-10 11:54:47,407 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:47,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:47,410 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:47,410 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:54:47,411 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 25 [2022-01-10 11:54:47,414 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2022-01-10 11:54:47,426 INFO L353 Elim1Store]: treesize reduction 26, result has 35.0 percent of original size [2022-01-10 11:54:47,426 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 34 treesize of output 32 [2022-01-10 11:54:47,475 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 11:54:47,475 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 31 treesize of output 29 [2022-01-10 11:54:47,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-01-10 11:54:47,488 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 21 [2022-01-10 11:54:47,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:54:47,581 INFO L353 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2022-01-10 11:54:47,582 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 3 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 66 [2022-01-10 11:54:47,606 INFO L353 Elim1Store]: treesize reduction 87, result has 11.2 percent of original size [2022-01-10 11:54:47,607 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 4 new quantified variables, introduced 4 case distinctions, treesize of input 166 treesize of output 128 [2022-01-10 11:54:47,630 INFO L353 Elim1Store]: treesize reduction 107, result has 12.3 percent of original size [2022-01-10 11:54:47,631 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 3 case distinctions, treesize of input 135 treesize of output 125 [2022-01-10 11:54:47,642 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 66 treesize of output 60 [2022-01-10 11:54:47,654 INFO L353 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2022-01-10 11:54:47,654 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 32 treesize of output 46 [2022-01-10 11:54:47,715 INFO L353 Elim1Store]: treesize reduction 36, result has 23.4 percent of original size [2022-01-10 11:54:47,715 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 89 treesize of output 74 [2022-01-10 11:54:47,722 INFO L353 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-01-10 11:54:47,722 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 78 treesize of output 75 [2022-01-10 11:54:47,927 INFO L173 IndexEqualityManager]: detected equality via solver [2022-01-10 11:54:47,931 INFO L353 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-01-10 11:54:47,931 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 23 [2022-01-10 11:54:47,935 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2022-01-10 11:54:47,945 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-01-10 11:54:47,945 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-01-10 11:54:48,040 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1335 (Array Int Int))) (let ((.cse0 (select (let ((.cse1 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| v_ArrVal_1336))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|))) (select (select (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| v_ArrVal_1335) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)))) (or (<= 1 .cse0) (not (<= 0 .cse0))))) is different from false [2022-01-10 11:54:48,070 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1330 Int) (v_ArrVal_1336 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1321 (Array Int Int))) (let ((.cse0 (let ((.cse2 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| (store (select |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt| v_ArrVal_1330)))) (let ((.cse3 (select (select (store .cse2 v_ArrVal_1330 v_ArrVal_1326) |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt|))) (select (let ((.cse1 (store (store .cse2 v_ArrVal_1330 v_ArrVal_1323) .cse3 v_ArrVal_1336))) (select .cse1 (select (select .cse1 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|))) (select (select (store (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| v_ArrVal_1325) v_ArrVal_1330 v_ArrVal_1321) .cse3 v_ArrVal_1335) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)))))) (or (not (= (select |c_#validInt| v_ArrVal_1330) 0)) (not (<= 0 .cse0)) (= v_ArrVal_1330 0) (<= 1 .cse0)))) is different from false [2022-01-10 11:54:48,165 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:54:48,165 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 152 [2022-01-10 11:54:48,183 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1326 (Array Int Int)) (v_ArrVal_1325 (Array Int Int)) (v_ArrVal_1336 (Array Int Int)) (v_arrayElimArr_14 (Array Int Int)) (v_ArrVal_1335 (Array Int Int)) (v_ArrVal_1323 (Array Int Int)) (v_ArrVal_1321 (Array Int Int))) (let ((.cse1 (select v_arrayElimArr_14 |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt|))) (let ((.cse0 (let ((.cse3 (store |c_#memory_$Pointer$.baseInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| v_arrayElimArr_14))) (let ((.cse4 (select (select (store .cse3 .cse1 v_ArrVal_1326) |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.offsetInt|))) (select (let ((.cse2 (store (store .cse3 .cse1 v_ArrVal_1323) .cse4 v_ArrVal_1336))) (select .cse2 (select (select .cse2 |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|))) (select (select (store (store (store |c_#memory_$Pointer$.offsetInt| |c_ULTIMATE.start_ULTIMATE.start_main_~item~0#1.baseInt| v_ArrVal_1325) .cse1 v_ArrVal_1321) .cse4 v_ArrVal_1335) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.baseInt|) |c_ULTIMATE.start_ULTIMATE.start_main_~head~0#1.offsetInt|)))))) (or (<= 1 .cse0) (= .cse1 0) (not (<= 0 .cse0)) (not (= (select |c_#validInt| .cse1) 0)))))) is different from false [2022-01-10 11:54:48,201 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:54:48,201 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 888 treesize of output 720 [2022-01-10 11:54:48,207 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:54:48,207 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 682 treesize of output 466 [2022-01-10 11:54:50,908 INFO L353 Elim1Store]: treesize reduction 1173, result has 38.3 percent of original size [2022-01-10 11:54:50,913 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 18 select indices, 18 select index equivalence classes, 0 disjoint index pairs (out of 153 index pairs), introduced 23 new quantified variables, introduced 153 case distinctions, treesize of input 1936850 treesize of output 1351395 [2022-01-10 11:54:58,873 INFO L353 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-01-10 11:54:58,885 INFO L387 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 5946955 treesize of output 5375666