./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_14-1.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/locks/test_locks_14-1.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:39:36,688 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:39:36,689 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:39:36,717 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:39:36,717 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:39:36,718 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:39:36,719 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:39:36,720 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:39:36,721 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:39:36,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:39:36,722 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:39:36,728 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:39:36,729 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:39:36,732 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:39:36,734 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:39:36,737 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:39:36,738 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:39:36,739 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:39:36,740 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:39:36,743 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:39:36,746 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:39:36,747 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:39:36,748 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:39:36,748 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:39:36,750 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:39:36,753 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:39:36,754 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:39:36,754 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:39:36,755 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:39:36,755 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:39:36,756 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:39:36,756 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:39:36,757 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:39:36,758 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:39:36,758 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:39:36,759 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:39:36,759 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:39:36,760 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:39:36,760 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:39:36,761 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:39:36,761 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:39:36,762 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:39:36,780 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:39:36,783 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:39:36,784 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:39:36,784 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:39:36,784 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:39:36,784 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:39:36,785 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:39:36,785 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:39:36,785 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:39:36,785 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:39:36,786 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:39:36,786 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:39:36,786 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:39:36,786 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:39:36,786 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:39:36,787 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:39:36,787 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:39:36,787 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:39:36,787 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:39:36,787 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:39:36,787 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:39:36,787 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:39:36,788 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:39:36,788 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:39:36,788 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:39:36,788 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:39:36,788 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:39:36,788 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:39:36,788 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:39:36,789 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:39:36,789 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:39:36,789 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:39:36,789 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:39:36,789 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 1e1f6c8a80d54f6d4b7b413368cc99af6eca243b930331d178961d851b56afbd [2022-02-20 14:39:36,991 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:39:37,007 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:39:37,009 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:39:37,010 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:39:37,012 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:39:37,012 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_14-1.c [2022-02-20 14:39:37,060 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b76019b7/dea0c44f7f4846128253c7bf81f35de9/FLAGdbf53820d [2022-02-20 14:39:37,439 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:39:37,440 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-1.c [2022-02-20 14:39:37,445 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b76019b7/dea0c44f7f4846128253c7bf81f35de9/FLAGdbf53820d [2022-02-20 14:39:37,455 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1b76019b7/dea0c44f7f4846128253c7bf81f35de9 [2022-02-20 14:39:37,456 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:39:37,457 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:39:37,462 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:39:37,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:39:37,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:39:37,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:39:37" (1/1) ... [2022-02-20 14:39:37,466 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@755e8d9a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:37, skipping insertion in model container [2022-02-20 14:39:37,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:39:37" (1/1) ... [2022-02-20 14:39:37,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:39:37,482 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:39:37,578 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-1.c[5283,5296] [2022-02-20 14:39:37,581 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:39:37,586 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:39:37,611 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_14-1.c[5283,5296] [2022-02-20 14:39:37,616 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:39:37,630 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:39:37,631 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:37 WrapperNode [2022-02-20 14:39:37,631 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:39:37,652 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:39:37,652 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:39:37,652 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:39:37,657 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:37" (1/1) ... [2022-02-20 14:39:37,662 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:37" (1/1) ... [2022-02-20 14:39:37,695 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 182 [2022-02-20 14:39:37,699 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:39:37,699 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:39:37,700 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:39:37,700 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:39:37,706 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:37" (1/1) ... [2022-02-20 14:39:37,706 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:37" (1/1) ... [2022-02-20 14:39:37,714 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:37" (1/1) ... [2022-02-20 14:39:37,715 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:37" (1/1) ... [2022-02-20 14:39:37,718 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:37" (1/1) ... [2022-02-20 14:39:37,730 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:37" (1/1) ... [2022-02-20 14:39:37,731 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:37" (1/1) ... [2022-02-20 14:39:37,737 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:39:37,738 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:39:37,738 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:39:37,738 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:39:37,744 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:37" (1/1) ... [2022-02-20 14:39:37,750 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:39:37,761 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:39:37,778 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-02-20 14:39:37,784 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-02-20 14:39:37,816 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:39:37,816 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:39:37,816 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:39:37,816 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:39:37,868 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:39:37,869 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:39:38,177 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:39:38,182 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:39:38,182 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 14:39:38,183 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:39:38 BoogieIcfgContainer [2022-02-20 14:39:38,184 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:39:38,187 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:39:38,187 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:39:38,190 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:39:38,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:39:37" (1/3) ... [2022-02-20 14:39:38,191 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4505db7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:39:38, skipping insertion in model container [2022-02-20 14:39:38,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:37" (2/3) ... [2022-02-20 14:39:38,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4505db7c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:39:38, skipping insertion in model container [2022-02-20 14:39:38,192 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:39:38" (3/3) ... [2022-02-20 14:39:38,193 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_14-1.c [2022-02-20 14:39:38,196 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:39:38,196 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:39:38,263 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:39:38,275 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-02-20 14:39:38,276 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:39:38,298 INFO L276 IsEmpty]: Start isEmpty. Operand has 52 states, 50 states have (on average 1.92) internal successors, (96), 51 states have internal predecessors, (96), 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-02-20 14:39:38,302 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:39:38,302 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:38,303 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] [2022-02-20 14:39:38,304 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:38,307 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:38,308 INFO L85 PathProgramCache]: Analyzing trace with hash 792943379, now seen corresponding path program 1 times [2022-02-20 14:39:38,314 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:38,314 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468145978] [2022-02-20 14:39:38,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:38,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:38,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:38,471 INFO L290 TraceCheckUtils]: 0: Hoare triple {55#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {55#true} is VALID [2022-02-20 14:39:38,474 INFO L290 TraceCheckUtils]: 1: Hoare triple {55#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {55#true} is VALID [2022-02-20 14:39:38,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {55#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {55#true} is VALID [2022-02-20 14:39:38,475 INFO L290 TraceCheckUtils]: 3: Hoare triple {55#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; {55#true} is VALID [2022-02-20 14:39:38,476 INFO L290 TraceCheckUtils]: 4: Hoare triple {55#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:38,476 INFO L290 TraceCheckUtils]: 5: Hoare triple {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:38,477 INFO L290 TraceCheckUtils]: 6: Hoare triple {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume !(0 != main_~p3~0#1); {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:38,477 INFO L290 TraceCheckUtils]: 7: Hoare triple {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:38,478 INFO L290 TraceCheckUtils]: 8: Hoare triple {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:38,478 INFO L290 TraceCheckUtils]: 9: Hoare triple {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:38,479 INFO L290 TraceCheckUtils]: 10: Hoare triple {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:38,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:38,480 INFO L290 TraceCheckUtils]: 12: Hoare triple {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:38,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:38,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume !(0 != main_~p11~0#1); {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:38,482 INFO L290 TraceCheckUtils]: 15: Hoare triple {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:38,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:38,483 INFO L290 TraceCheckUtils]: 17: Hoare triple {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:38,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p1~0#1; {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:38,484 INFO L290 TraceCheckUtils]: 19: Hoare triple {57#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 1 != main_~lk1~0#1; {56#false} is VALID [2022-02-20 14:39:38,484 INFO L290 TraceCheckUtils]: 20: Hoare triple {56#false} assume !false; {56#false} is VALID [2022-02-20 14:39:38,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:38,486 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:38,486 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468145978] [2022-02-20 14:39:38,486 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1468145978] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:38,486 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:38,487 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:38,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322343222] [2022-02-20 14:39:38,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:38,492 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-20 14:39:38,493 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:38,496 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-20 14:39:38,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:38,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:38,519 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:38,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:38,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:38,534 INFO L87 Difference]: Start difference. First operand has 52 states, 50 states have (on average 1.92) internal successors, (96), 51 states have internal predecessors, (96), 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 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-20 14:39:38,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:38,693 INFO L93 Difference]: Finished difference Result 107 states and 193 transitions. [2022-02-20 14:39:38,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:38,694 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-20 14:39:38,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:38,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-20 14:39:38,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 193 transitions. [2022-02-20 14:39:38,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-20 14:39:38,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 193 transitions. [2022-02-20 14:39:38,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 193 transitions. [2022-02-20 14:39:38,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:38,859 INFO L225 Difference]: With dead ends: 107 [2022-02-20 14:39:38,860 INFO L226 Difference]: Without dead ends: 93 [2022-02-20 14:39:38,862 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-02-20 14:39:38,864 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 72 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 187 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-02-20 14:39:38,865 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 187 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:38,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-20 14:39:38,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 63. [2022-02-20 14:39:38,890 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:38,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 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-02-20 14:39:38,892 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 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-02-20 14:39:38,893 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 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-02-20 14:39:38,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:38,898 INFO L93 Difference]: Finished difference Result 93 states and 173 transitions. [2022-02-20 14:39:38,898 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 173 transitions. [2022-02-20 14:39:38,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:38,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:38,899 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 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 93 states. [2022-02-20 14:39:38,900 INFO L87 Difference]: Start difference. First operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 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 93 states. [2022-02-20 14:39:38,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:38,905 INFO L93 Difference]: Finished difference Result 93 states and 173 transitions. [2022-02-20 14:39:38,905 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 173 transitions. [2022-02-20 14:39:38,906 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:38,906 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:38,906 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:38,907 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:38,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.903225806451613) internal successors, (118), 62 states have internal predecessors, (118), 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-02-20 14:39:38,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 118 transitions. [2022-02-20 14:39:38,911 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 118 transitions. Word has length 21 [2022-02-20 14:39:38,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:38,911 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 118 transitions. [2022-02-20 14:39:38,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-20 14:39:38,912 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 118 transitions. [2022-02-20 14:39:38,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:39:38,912 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:38,913 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] [2022-02-20 14:39:38,913 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:39:38,913 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:38,914 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:38,914 INFO L85 PathProgramCache]: Analyzing trace with hash -795404523, now seen corresponding path program 1 times [2022-02-20 14:39:38,914 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:38,914 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [61695632] [2022-02-20 14:39:38,915 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:38,915 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:38,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:38,971 INFO L290 TraceCheckUtils]: 0: Hoare triple {429#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {429#true} is VALID [2022-02-20 14:39:38,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {429#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {429#true} is VALID [2022-02-20 14:39:38,972 INFO L290 TraceCheckUtils]: 2: Hoare triple {429#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {429#true} is VALID [2022-02-20 14:39:38,972 INFO L290 TraceCheckUtils]: 3: Hoare triple {429#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; {429#true} is VALID [2022-02-20 14:39:38,973 INFO L290 TraceCheckUtils]: 4: Hoare triple {429#true} assume !(0 != main_~p1~0#1); {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:38,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:38,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume !(0 != main_~p3~0#1); {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:38,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:38,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:38,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:38,975 INFO L290 TraceCheckUtils]: 10: Hoare triple {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:38,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:38,976 INFO L290 TraceCheckUtils]: 12: Hoare triple {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:38,977 INFO L290 TraceCheckUtils]: 13: Hoare triple {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:38,977 INFO L290 TraceCheckUtils]: 14: Hoare triple {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume !(0 != main_~p11~0#1); {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:38,978 INFO L290 TraceCheckUtils]: 15: Hoare triple {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:38,978 INFO L290 TraceCheckUtils]: 16: Hoare triple {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:38,979 INFO L290 TraceCheckUtils]: 17: Hoare triple {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:38,979 INFO L290 TraceCheckUtils]: 18: Hoare triple {431#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p1~0#1; {430#false} is VALID [2022-02-20 14:39:38,979 INFO L290 TraceCheckUtils]: 19: Hoare triple {430#false} assume 1 != main_~lk1~0#1; {430#false} is VALID [2022-02-20 14:39:38,979 INFO L290 TraceCheckUtils]: 20: Hoare triple {430#false} assume !false; {430#false} is VALID [2022-02-20 14:39:38,980 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:38,980 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:38,980 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [61695632] [2022-02-20 14:39:38,980 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [61695632] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:38,981 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:38,981 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:38,981 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855510819] [2022-02-20 14:39:38,981 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:38,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-20 14:39:38,982 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:38,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-20 14:39:38,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:39,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:39,000 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:39,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:39,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:39,001 INFO L87 Difference]: Start difference. First operand 63 states and 118 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-20 14:39:39,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:39,125 INFO L93 Difference]: Finished difference Result 154 states and 289 transitions. [2022-02-20 14:39:39,125 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:39,125 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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 21 [2022-02-20 14:39:39,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:39,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-20 14:39:39,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2022-02-20 14:39:39,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-20 14:39:39,131 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 260 transitions. [2022-02-20 14:39:39,131 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 260 transitions. [2022-02-20 14:39:39,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:39,329 INFO L225 Difference]: With dead ends: 154 [2022-02-20 14:39:39,330 INFO L226 Difference]: Without dead ends: 93 [2022-02-20 14:39:39,334 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-02-20 14:39:39,337 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 68 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:39,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 199 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:39,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-20 14:39:39,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 91. [2022-02-20 14:39:39,346 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:39,346 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 91 states, 90 states have (on average 1.8888888888888888) internal successors, (170), 90 states have internal predecessors, (170), 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-02-20 14:39:39,346 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 91 states, 90 states have (on average 1.8888888888888888) internal successors, (170), 90 states have internal predecessors, (170), 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-02-20 14:39:39,347 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 91 states, 90 states have (on average 1.8888888888888888) internal successors, (170), 90 states have internal predecessors, (170), 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-02-20 14:39:39,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:39,351 INFO L93 Difference]: Finished difference Result 93 states and 171 transitions. [2022-02-20 14:39:39,351 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 171 transitions. [2022-02-20 14:39:39,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:39,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:39,355 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 90 states have (on average 1.8888888888888888) internal successors, (170), 90 states have internal predecessors, (170), 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 93 states. [2022-02-20 14:39:39,355 INFO L87 Difference]: Start difference. First operand has 91 states, 90 states have (on average 1.8888888888888888) internal successors, (170), 90 states have internal predecessors, (170), 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 93 states. [2022-02-20 14:39:39,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:39,360 INFO L93 Difference]: Finished difference Result 93 states and 171 transitions. [2022-02-20 14:39:39,360 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 171 transitions. [2022-02-20 14:39:39,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:39,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:39,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:39,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:39,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 90 states have (on average 1.8888888888888888) internal successors, (170), 90 states have internal predecessors, (170), 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-02-20 14:39:39,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 170 transitions. [2022-02-20 14:39:39,365 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 170 transitions. Word has length 21 [2022-02-20 14:39:39,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:39,366 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 170 transitions. [2022-02-20 14:39:39,367 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 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-02-20 14:39:39,368 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 170 transitions. [2022-02-20 14:39:39,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 14:39:39,369 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:39,369 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:39,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:39:39,369 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:39,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:39,370 INFO L85 PathProgramCache]: Analyzing trace with hash -1188346975, now seen corresponding path program 1 times [2022-02-20 14:39:39,370 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:39,371 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244069380] [2022-02-20 14:39:39,371 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:39,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:39,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:39,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {874#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {874#true} is VALID [2022-02-20 14:39:39,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {874#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {874#true} is VALID [2022-02-20 14:39:39,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {874#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {874#true} is VALID [2022-02-20 14:39:39,446 INFO L290 TraceCheckUtils]: 3: Hoare triple {874#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; {874#true} is VALID [2022-02-20 14:39:39,446 INFO L290 TraceCheckUtils]: 4: Hoare triple {874#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:39,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:39,447 INFO L290 TraceCheckUtils]: 6: Hoare triple {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p3~0#1); {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:39,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:39,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:39,448 INFO L290 TraceCheckUtils]: 9: Hoare triple {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:39,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:39,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:39,450 INFO L290 TraceCheckUtils]: 12: Hoare triple {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:39,450 INFO L290 TraceCheckUtils]: 13: Hoare triple {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:39,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p11~0#1); {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:39,451 INFO L290 TraceCheckUtils]: 15: Hoare triple {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:39,451 INFO L290 TraceCheckUtils]: 16: Hoare triple {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:39,452 INFO L290 TraceCheckUtils]: 17: Hoare triple {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:39,452 INFO L290 TraceCheckUtils]: 18: Hoare triple {876#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p1~0#1); {875#false} is VALID [2022-02-20 14:39:39,452 INFO L290 TraceCheckUtils]: 19: Hoare triple {875#false} assume 0 != main_~p2~0#1; {875#false} is VALID [2022-02-20 14:39:39,453 INFO L290 TraceCheckUtils]: 20: Hoare triple {875#false} assume 1 != main_~lk2~0#1; {875#false} is VALID [2022-02-20 14:39:39,453 INFO L290 TraceCheckUtils]: 21: Hoare triple {875#false} assume !false; {875#false} is VALID [2022-02-20 14:39:39,453 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:39,453 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:39,454 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244069380] [2022-02-20 14:39:39,454 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244069380] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:39,454 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:39,454 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:39,454 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442287227] [2022-02-20 14:39:39,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:39,455 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 14:39:39,455 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:39,455 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:39,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:39,470 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:39,470 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:39,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:39,471 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:39,471 INFO L87 Difference]: Start difference. First operand 91 states and 170 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:39,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:39,574 INFO L93 Difference]: Finished difference Result 141 states and 258 transitions. [2022-02-20 14:39:39,574 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:39,574 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 14:39:39,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:39,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:39,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2022-02-20 14:39:39,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:39,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2022-02-20 14:39:39,579 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 255 transitions. [2022-02-20 14:39:39,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:39,745 INFO L225 Difference]: With dead ends: 141 [2022-02-20 14:39:39,745 INFO L226 Difference]: Without dead ends: 96 [2022-02-20 14:39:39,745 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-02-20 14:39:39,746 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 70 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:39,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 224 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:39,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2022-02-20 14:39:39,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 94. [2022-02-20 14:39:39,750 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:39,750 INFO L82 GeneralOperation]: Start isEquivalent. First operand 96 states. Second operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 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-02-20 14:39:39,751 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 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-02-20 14:39:39,751 INFO L87 Difference]: Start difference. First operand 96 states. Second operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 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-02-20 14:39:39,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:39,753 INFO L93 Difference]: Finished difference Result 96 states and 173 transitions. [2022-02-20 14:39:39,753 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 173 transitions. [2022-02-20 14:39:39,753 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:39,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:39,754 INFO L74 IsIncluded]: Start isIncluded. First operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 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 96 states. [2022-02-20 14:39:39,754 INFO L87 Difference]: Start difference. First operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 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 96 states. [2022-02-20 14:39:39,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:39,756 INFO L93 Difference]: Finished difference Result 96 states and 173 transitions. [2022-02-20 14:39:39,756 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 173 transitions. [2022-02-20 14:39:39,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:39,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:39,757 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:39,757 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:39,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 93 states have (on average 1.8494623655913978) internal successors, (172), 93 states have internal predecessors, (172), 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-02-20 14:39:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 172 transitions. [2022-02-20 14:39:39,759 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 172 transitions. Word has length 22 [2022-02-20 14:39:39,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:39,759 INFO L470 AbstractCegarLoop]: Abstraction has 94 states and 172 transitions. [2022-02-20 14:39:39,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:39,760 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 172 transitions. [2022-02-20 14:39:39,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 14:39:39,760 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:39,760 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:39,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 14:39:39,760 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:39,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:39,761 INFO L85 PathProgramCache]: Analyzing trace with hash 1112475615, now seen corresponding path program 1 times [2022-02-20 14:39:39,761 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:39,761 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2020600046] [2022-02-20 14:39:39,762 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:39,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:39,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:39,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {1317#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1317#true} is VALID [2022-02-20 14:39:39,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {1317#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {1317#true} is VALID [2022-02-20 14:39:39,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {1317#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {1317#true} is VALID [2022-02-20 14:39:39,801 INFO L290 TraceCheckUtils]: 3: Hoare triple {1317#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; {1317#true} is VALID [2022-02-20 14:39:39,801 INFO L290 TraceCheckUtils]: 4: Hoare triple {1317#true} assume !(0 != main_~p1~0#1); {1317#true} is VALID [2022-02-20 14:39:39,802 INFO L290 TraceCheckUtils]: 5: Hoare triple {1317#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:39,802 INFO L290 TraceCheckUtils]: 6: Hoare triple {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p3~0#1); {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:39,803 INFO L290 TraceCheckUtils]: 7: Hoare triple {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:39,803 INFO L290 TraceCheckUtils]: 8: Hoare triple {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:39,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:39,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:39,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:39,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:39,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:39,806 INFO L290 TraceCheckUtils]: 14: Hoare triple {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p11~0#1); {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:39,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:39,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:39,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:39,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p1~0#1); {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:39,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p2~0#1; {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:39,808 INFO L290 TraceCheckUtils]: 20: Hoare triple {1319#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 1 != main_~lk2~0#1; {1318#false} is VALID [2022-02-20 14:39:39,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {1318#false} assume !false; {1318#false} is VALID [2022-02-20 14:39:39,815 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:39,816 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:39,816 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2020600046] [2022-02-20 14:39:39,816 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2020600046] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:39,816 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:39,816 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:39,816 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [856093433] [2022-02-20 14:39:39,816 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:39,817 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 14:39:39,817 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:39,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:39,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:39,829 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:39,829 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:39,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:39,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:39,830 INFO L87 Difference]: Start difference. First operand 94 states and 172 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:39,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:39,907 INFO L93 Difference]: Finished difference Result 181 states and 333 transitions. [2022-02-20 14:39:39,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:39,908 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 14:39:39,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:39,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:39,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2022-02-20 14:39:39,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:39,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 171 transitions. [2022-02-20 14:39:39,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 171 transitions. [2022-02-20 14:39:40,024 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 171 edges. 171 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:40,027 INFO L225 Difference]: With dead ends: 181 [2022-02-20 14:39:40,027 INFO L226 Difference]: Without dead ends: 179 [2022-02-20 14:39:40,028 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-02-20 14:39:40,029 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 65 mSDsluCounter, 83 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 173 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-02-20 14:39:40,029 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 173 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:40,030 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-02-20 14:39:40,035 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 125. [2022-02-20 14:39:40,035 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:40,036 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand has 125 states, 124 states have (on average 1.846774193548387) internal successors, (229), 124 states have internal predecessors, (229), 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-02-20 14:39:40,036 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand has 125 states, 124 states have (on average 1.846774193548387) internal successors, (229), 124 states have internal predecessors, (229), 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-02-20 14:39:40,037 INFO L87 Difference]: Start difference. First operand 179 states. Second operand has 125 states, 124 states have (on average 1.846774193548387) internal successors, (229), 124 states have internal predecessors, (229), 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-02-20 14:39:40,041 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:40,041 INFO L93 Difference]: Finished difference Result 179 states and 330 transitions. [2022-02-20 14:39:40,041 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 330 transitions. [2022-02-20 14:39:40,042 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:40,042 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:40,042 INFO L74 IsIncluded]: Start isIncluded. First operand has 125 states, 124 states have (on average 1.846774193548387) internal successors, (229), 124 states have internal predecessors, (229), 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 179 states. [2022-02-20 14:39:40,043 INFO L87 Difference]: Start difference. First operand has 125 states, 124 states have (on average 1.846774193548387) internal successors, (229), 124 states have internal predecessors, (229), 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 179 states. [2022-02-20 14:39:40,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:40,048 INFO L93 Difference]: Finished difference Result 179 states and 330 transitions. [2022-02-20 14:39:40,048 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 330 transitions. [2022-02-20 14:39:40,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:40,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:40,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:40,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:40,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 125 states, 124 states have (on average 1.846774193548387) internal successors, (229), 124 states have internal predecessors, (229), 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-02-20 14:39:40,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 125 states to 125 states and 229 transitions. [2022-02-20 14:39:40,053 INFO L78 Accepts]: Start accepts. Automaton has 125 states and 229 transitions. Word has length 22 [2022-02-20 14:39:40,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:40,054 INFO L470 AbstractCegarLoop]: Abstraction has 125 states and 229 transitions. [2022-02-20 14:39:40,054 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:40,054 INFO L276 IsEmpty]: Start isEmpty. Operand 125 states and 229 transitions. [2022-02-20 14:39:40,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 14:39:40,055 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:40,055 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:40,055 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 14:39:40,055 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:40,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:40,056 INFO L85 PathProgramCache]: Analyzing trace with hash -475872287, now seen corresponding path program 1 times [2022-02-20 14:39:40,057 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:40,057 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [19211097] [2022-02-20 14:39:40,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:40,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:40,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:40,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {1998#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {1998#true} is VALID [2022-02-20 14:39:40,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {1998#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {1998#true} is VALID [2022-02-20 14:39:40,096 INFO L290 TraceCheckUtils]: 2: Hoare triple {1998#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {1998#true} is VALID [2022-02-20 14:39:40,096 INFO L290 TraceCheckUtils]: 3: Hoare triple {1998#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; {1998#true} is VALID [2022-02-20 14:39:40,096 INFO L290 TraceCheckUtils]: 4: Hoare triple {1998#true} assume !(0 != main_~p1~0#1); {1998#true} is VALID [2022-02-20 14:39:40,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {1998#true} assume !(0 != main_~p2~0#1); {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:40,097 INFO L290 TraceCheckUtils]: 6: Hoare triple {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p3~0#1); {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:40,097 INFO L290 TraceCheckUtils]: 7: Hoare triple {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:40,097 INFO L290 TraceCheckUtils]: 8: Hoare triple {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:40,098 INFO L290 TraceCheckUtils]: 9: Hoare triple {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:40,098 INFO L290 TraceCheckUtils]: 10: Hoare triple {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:40,098 INFO L290 TraceCheckUtils]: 11: Hoare triple {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:40,099 INFO L290 TraceCheckUtils]: 12: Hoare triple {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:40,099 INFO L290 TraceCheckUtils]: 13: Hoare triple {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:40,099 INFO L290 TraceCheckUtils]: 14: Hoare triple {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p11~0#1); {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:40,100 INFO L290 TraceCheckUtils]: 15: Hoare triple {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:40,100 INFO L290 TraceCheckUtils]: 16: Hoare triple {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:40,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:40,101 INFO L290 TraceCheckUtils]: 18: Hoare triple {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p1~0#1); {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:40,101 INFO L290 TraceCheckUtils]: 19: Hoare triple {2000#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p2~0#1; {1999#false} is VALID [2022-02-20 14:39:40,101 INFO L290 TraceCheckUtils]: 20: Hoare triple {1999#false} assume 1 != main_~lk2~0#1; {1999#false} is VALID [2022-02-20 14:39:40,101 INFO L290 TraceCheckUtils]: 21: Hoare triple {1999#false} assume !false; {1999#false} is VALID [2022-02-20 14:39:40,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:40,102 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:40,102 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [19211097] [2022-02-20 14:39:40,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [19211097] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:40,102 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:40,102 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:40,102 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1637110954] [2022-02-20 14:39:40,103 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:40,103 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 14:39:40,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:40,103 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:40,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:40,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:40,118 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:40,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:40,118 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:40,119 INFO L87 Difference]: Start difference. First operand 125 states and 229 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:40,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:40,224 INFO L93 Difference]: Finished difference Result 301 states and 555 transitions. [2022-02-20 14:39:40,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:40,225 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 14:39:40,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:40,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:40,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2022-02-20 14:39:40,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:40,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 257 transitions. [2022-02-20 14:39:40,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 257 transitions. [2022-02-20 14:39:40,393 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:40,395 INFO L225 Difference]: With dead ends: 301 [2022-02-20 14:39:40,395 INFO L226 Difference]: Without dead ends: 181 [2022-02-20 14:39:40,397 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-02-20 14:39:40,399 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 67 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:40,399 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 200 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:40,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-02-20 14:39:40,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 179. [2022-02-20 14:39:40,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:40,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 179 states, 178 states have (on average 1.8370786516853932) internal successors, (327), 178 states have internal predecessors, (327), 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-02-20 14:39:40,409 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 179 states, 178 states have (on average 1.8370786516853932) internal successors, (327), 178 states have internal predecessors, (327), 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-02-20 14:39:40,409 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 179 states, 178 states have (on average 1.8370786516853932) internal successors, (327), 178 states have internal predecessors, (327), 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-02-20 14:39:40,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:40,413 INFO L93 Difference]: Finished difference Result 181 states and 328 transitions. [2022-02-20 14:39:40,413 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 328 transitions. [2022-02-20 14:39:40,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:40,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:40,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 179 states, 178 states have (on average 1.8370786516853932) internal successors, (327), 178 states have internal predecessors, (327), 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 181 states. [2022-02-20 14:39:40,414 INFO L87 Difference]: Start difference. First operand has 179 states, 178 states have (on average 1.8370786516853932) internal successors, (327), 178 states have internal predecessors, (327), 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 181 states. [2022-02-20 14:39:40,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:40,417 INFO L93 Difference]: Finished difference Result 181 states and 328 transitions. [2022-02-20 14:39:40,417 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 328 transitions. [2022-02-20 14:39:40,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:40,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:40,418 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:40,418 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:40,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 178 states have (on average 1.8370786516853932) internal successors, (327), 178 states have internal predecessors, (327), 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-02-20 14:39:40,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 327 transitions. [2022-02-20 14:39:40,421 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 327 transitions. Word has length 22 [2022-02-20 14:39:40,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:40,421 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 327 transitions. [2022-02-20 14:39:40,422 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:40,422 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 327 transitions. [2022-02-20 14:39:40,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 14:39:40,422 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:40,422 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] [2022-02-20 14:39:40,422 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 14:39:40,422 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:40,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:40,423 INFO L85 PathProgramCache]: Analyzing trace with hash 127218090, now seen corresponding path program 1 times [2022-02-20 14:39:40,423 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:40,423 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [792879582] [2022-02-20 14:39:40,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:40,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:40,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {2861#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {2861#true} is VALID [2022-02-20 14:39:40,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {2861#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {2861#true} is VALID [2022-02-20 14:39:40,482 INFO L290 TraceCheckUtils]: 2: Hoare triple {2861#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {2861#true} is VALID [2022-02-20 14:39:40,482 INFO L290 TraceCheckUtils]: 3: Hoare triple {2861#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; {2861#true} is VALID [2022-02-20 14:39:40,482 INFO L290 TraceCheckUtils]: 4: Hoare triple {2861#true} assume !(0 != main_~p1~0#1); {2861#true} is VALID [2022-02-20 14:39:40,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {2861#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:40,483 INFO L290 TraceCheckUtils]: 6: Hoare triple {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p3~0#1); {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:40,483 INFO L290 TraceCheckUtils]: 7: Hoare triple {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:40,483 INFO L290 TraceCheckUtils]: 8: Hoare triple {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:40,484 INFO L290 TraceCheckUtils]: 9: Hoare triple {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:40,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:40,490 INFO L290 TraceCheckUtils]: 11: Hoare triple {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:40,490 INFO L290 TraceCheckUtils]: 12: Hoare triple {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:40,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:40,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p11~0#1); {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:40,491 INFO L290 TraceCheckUtils]: 15: Hoare triple {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:40,492 INFO L290 TraceCheckUtils]: 16: Hoare triple {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:40,492 INFO L290 TraceCheckUtils]: 17: Hoare triple {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:40,492 INFO L290 TraceCheckUtils]: 18: Hoare triple {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p1~0#1); {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:40,493 INFO L290 TraceCheckUtils]: 19: Hoare triple {2863#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p2~0#1); {2862#false} is VALID [2022-02-20 14:39:40,493 INFO L290 TraceCheckUtils]: 20: Hoare triple {2862#false} assume 0 != main_~p3~0#1; {2862#false} is VALID [2022-02-20 14:39:40,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {2862#false} assume 1 != main_~lk3~0#1; {2862#false} is VALID [2022-02-20 14:39:40,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {2862#false} assume !false; {2862#false} is VALID [2022-02-20 14:39:40,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:40,494 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:40,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [792879582] [2022-02-20 14:39:40,494 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [792879582] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:40,494 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:40,494 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:40,494 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [300839228] [2022-02-20 14:39:40,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:40,495 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 23 [2022-02-20 14:39:40,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:40,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 14:39:40,508 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:40,509 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:40,509 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:40,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:40,509 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:40,509 INFO L87 Difference]: Start difference. First operand 179 states and 327 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-02-20 14:39:40,603 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:40,603 INFO L93 Difference]: Finished difference Result 270 states and 490 transitions. [2022-02-20 14:39:40,603 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:40,604 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 23 [2022-02-20 14:39:40,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:40,604 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 14:39:40,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2022-02-20 14:39:40,606 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 14:39:40,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 252 transitions. [2022-02-20 14:39:40,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 252 transitions. [2022-02-20 14:39:40,755 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 252 edges. 252 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:40,757 INFO L225 Difference]: With dead ends: 270 [2022-02-20 14:39:40,757 INFO L226 Difference]: Without dead ends: 183 [2022-02-20 14:39:40,758 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-02-20 14:39:40,758 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 69 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:40,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 220 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:40,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-02-20 14:39:40,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 181. [2022-02-20 14:39:40,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:40,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand has 181 states, 180 states have (on average 1.8166666666666667) internal successors, (327), 180 states have internal predecessors, (327), 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-02-20 14:39:40,764 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand has 181 states, 180 states have (on average 1.8166666666666667) internal successors, (327), 180 states have internal predecessors, (327), 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-02-20 14:39:40,765 INFO L87 Difference]: Start difference. First operand 183 states. Second operand has 181 states, 180 states have (on average 1.8166666666666667) internal successors, (327), 180 states have internal predecessors, (327), 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-02-20 14:39:40,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:40,769 INFO L93 Difference]: Finished difference Result 183 states and 328 transitions. [2022-02-20 14:39:40,769 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 328 transitions. [2022-02-20 14:39:40,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:40,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:40,770 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 180 states have (on average 1.8166666666666667) internal successors, (327), 180 states have internal predecessors, (327), 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 183 states. [2022-02-20 14:39:40,771 INFO L87 Difference]: Start difference. First operand has 181 states, 180 states have (on average 1.8166666666666667) internal successors, (327), 180 states have internal predecessors, (327), 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 183 states. [2022-02-20 14:39:40,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:40,774 INFO L93 Difference]: Finished difference Result 183 states and 328 transitions. [2022-02-20 14:39:40,774 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 328 transitions. [2022-02-20 14:39:40,774 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:40,774 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:40,774 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:40,774 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:40,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 180 states have (on average 1.8166666666666667) internal successors, (327), 180 states have internal predecessors, (327), 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-02-20 14:39:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 327 transitions. [2022-02-20 14:39:40,778 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 327 transitions. Word has length 23 [2022-02-20 14:39:40,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:40,778 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 327 transitions. [2022-02-20 14:39:40,778 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-02-20 14:39:40,778 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 327 transitions. [2022-02-20 14:39:40,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 14:39:40,779 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:40,779 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] [2022-02-20 14:39:40,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 14:39:40,779 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:40,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:40,779 INFO L85 PathProgramCache]: Analyzing trace with hash -1866926616, now seen corresponding path program 1 times [2022-02-20 14:39:40,780 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:40,780 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522934877] [2022-02-20 14:39:40,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:40,780 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:40,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:40,812 INFO L290 TraceCheckUtils]: 0: Hoare triple {3699#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {3699#true} is VALID [2022-02-20 14:39:40,812 INFO L290 TraceCheckUtils]: 1: Hoare triple {3699#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {3699#true} is VALID [2022-02-20 14:39:40,812 INFO L290 TraceCheckUtils]: 2: Hoare triple {3699#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {3699#true} is VALID [2022-02-20 14:39:40,813 INFO L290 TraceCheckUtils]: 3: Hoare triple {3699#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; {3699#true} is VALID [2022-02-20 14:39:40,813 INFO L290 TraceCheckUtils]: 4: Hoare triple {3699#true} assume !(0 != main_~p1~0#1); {3699#true} is VALID [2022-02-20 14:39:40,813 INFO L290 TraceCheckUtils]: 5: Hoare triple {3699#true} assume !(0 != main_~p2~0#1); {3699#true} is VALID [2022-02-20 14:39:40,813 INFO L290 TraceCheckUtils]: 6: Hoare triple {3699#true} assume !(0 != main_~p3~0#1); {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:40,814 INFO L290 TraceCheckUtils]: 7: Hoare triple {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:40,814 INFO L290 TraceCheckUtils]: 8: Hoare triple {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:40,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:40,815 INFO L290 TraceCheckUtils]: 10: Hoare triple {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:40,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:40,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:40,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:40,816 INFO L290 TraceCheckUtils]: 14: Hoare triple {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p11~0#1); {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:40,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:40,817 INFO L290 TraceCheckUtils]: 16: Hoare triple {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:40,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:40,818 INFO L290 TraceCheckUtils]: 18: Hoare triple {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p1~0#1); {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:40,818 INFO L290 TraceCheckUtils]: 19: Hoare triple {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p2~0#1); {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:40,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {3701#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p3~0#1; {3700#false} is VALID [2022-02-20 14:39:40,819 INFO L290 TraceCheckUtils]: 21: Hoare triple {3700#false} assume 1 != main_~lk3~0#1; {3700#false} is VALID [2022-02-20 14:39:40,819 INFO L290 TraceCheckUtils]: 22: Hoare triple {3700#false} assume !false; {3700#false} is VALID [2022-02-20 14:39:40,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:40,820 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:40,820 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522934877] [2022-02-20 14:39:40,820 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522934877] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:40,820 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:40,820 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:40,820 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322097681] [2022-02-20 14:39:40,821 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:40,821 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 23 [2022-02-20 14:39:40,821 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:40,821 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 14:39:40,835 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:40,835 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:40,835 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:40,837 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:40,837 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:40,837 INFO L87 Difference]: Start difference. First operand 181 states and 327 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-02-20 14:39:40,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:40,927 INFO L93 Difference]: Finished difference Result 525 states and 953 transitions. [2022-02-20 14:39:40,927 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:40,927 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 23 [2022-02-20 14:39:40,927 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:40,928 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 14:39:40,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2022-02-20 14:39:40,930 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 14:39:40,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 255 transitions. [2022-02-20 14:39:40,931 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 255 transitions. [2022-02-20 14:39:41,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 255 edges. 255 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:41,058 INFO L225 Difference]: With dead ends: 525 [2022-02-20 14:39:41,059 INFO L226 Difference]: Without dead ends: 351 [2022-02-20 14:39:41,059 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-02-20 14:39:41,060 INFO L933 BasicCegarLoop]: 93 mSDtfsCounter, 67 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:41,060 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 175 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:41,061 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-02-20 14:39:41,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 349. [2022-02-20 14:39:41,067 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:41,067 INFO L82 GeneralOperation]: Start isEquivalent. First operand 351 states. Second operand has 349 states, 348 states have (on average 1.8017241379310345) internal successors, (627), 348 states have internal predecessors, (627), 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-02-20 14:39:41,068 INFO L74 IsIncluded]: Start isIncluded. First operand 351 states. Second operand has 349 states, 348 states have (on average 1.8017241379310345) internal successors, (627), 348 states have internal predecessors, (627), 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-02-20 14:39:41,069 INFO L87 Difference]: Start difference. First operand 351 states. Second operand has 349 states, 348 states have (on average 1.8017241379310345) internal successors, (627), 348 states have internal predecessors, (627), 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-02-20 14:39:41,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:41,077 INFO L93 Difference]: Finished difference Result 351 states and 628 transitions. [2022-02-20 14:39:41,077 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 628 transitions. [2022-02-20 14:39:41,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:41,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:41,079 INFO L74 IsIncluded]: Start isIncluded. First operand has 349 states, 348 states have (on average 1.8017241379310345) internal successors, (627), 348 states have internal predecessors, (627), 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 351 states. [2022-02-20 14:39:41,079 INFO L87 Difference]: Start difference. First operand has 349 states, 348 states have (on average 1.8017241379310345) internal successors, (627), 348 states have internal predecessors, (627), 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 351 states. [2022-02-20 14:39:41,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:41,088 INFO L93 Difference]: Finished difference Result 351 states and 628 transitions. [2022-02-20 14:39:41,088 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 628 transitions. [2022-02-20 14:39:41,088 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:41,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:41,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:41,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:41,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.8017241379310345) internal successors, (627), 348 states have internal predecessors, (627), 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-02-20 14:39:41,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 627 transitions. [2022-02-20 14:39:41,097 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 627 transitions. Word has length 23 [2022-02-20 14:39:41,097 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:41,098 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 627 transitions. [2022-02-20 14:39:41,098 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-02-20 14:39:41,098 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 627 transitions. [2022-02-20 14:39:41,098 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 14:39:41,099 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:41,099 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] [2022-02-20 14:39:41,099 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 14:39:41,099 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:41,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:41,100 INFO L85 PathProgramCache]: Analyzing trace with hash -278578714, now seen corresponding path program 1 times [2022-02-20 14:39:41,100 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:41,100 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1335802763] [2022-02-20 14:39:41,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:41,100 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:41,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:41,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {5306#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {5306#true} is VALID [2022-02-20 14:39:41,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {5306#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {5306#true} is VALID [2022-02-20 14:39:41,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {5306#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {5306#true} is VALID [2022-02-20 14:39:41,146 INFO L290 TraceCheckUtils]: 3: Hoare triple {5306#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; {5306#true} is VALID [2022-02-20 14:39:41,146 INFO L290 TraceCheckUtils]: 4: Hoare triple {5306#true} assume !(0 != main_~p1~0#1); {5306#true} is VALID [2022-02-20 14:39:41,146 INFO L290 TraceCheckUtils]: 5: Hoare triple {5306#true} assume !(0 != main_~p2~0#1); {5306#true} is VALID [2022-02-20 14:39:41,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {5306#true} assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:41,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:41,147 INFO L290 TraceCheckUtils]: 8: Hoare triple {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:41,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:41,148 INFO L290 TraceCheckUtils]: 10: Hoare triple {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:41,148 INFO L290 TraceCheckUtils]: 11: Hoare triple {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:41,149 INFO L290 TraceCheckUtils]: 12: Hoare triple {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:41,149 INFO L290 TraceCheckUtils]: 13: Hoare triple {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:41,150 INFO L290 TraceCheckUtils]: 14: Hoare triple {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p11~0#1); {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:41,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:41,150 INFO L290 TraceCheckUtils]: 16: Hoare triple {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:41,151 INFO L290 TraceCheckUtils]: 17: Hoare triple {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:41,151 INFO L290 TraceCheckUtils]: 18: Hoare triple {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p1~0#1); {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:41,151 INFO L290 TraceCheckUtils]: 19: Hoare triple {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p2~0#1); {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:41,152 INFO L290 TraceCheckUtils]: 20: Hoare triple {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p3~0#1; {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:41,152 INFO L290 TraceCheckUtils]: 21: Hoare triple {5308#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 1 != main_~lk3~0#1; {5307#false} is VALID [2022-02-20 14:39:41,152 INFO L290 TraceCheckUtils]: 22: Hoare triple {5307#false} assume !false; {5307#false} is VALID [2022-02-20 14:39:41,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:41,153 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:41,153 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1335802763] [2022-02-20 14:39:41,153 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1335802763] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:41,153 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:41,153 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:41,153 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1073463210] [2022-02-20 14:39:41,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:41,154 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 23 [2022-02-20 14:39:41,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:41,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 14:39:41,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:41,169 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:41,169 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:41,169 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:41,169 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:41,170 INFO L87 Difference]: Start difference. First operand 349 states and 627 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-02-20 14:39:41,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:41,269 INFO L93 Difference]: Finished difference Result 449 states and 813 transitions. [2022-02-20 14:39:41,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:41,269 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 23 [2022-02-20 14:39:41,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:41,269 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 14:39:41,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2022-02-20 14:39:41,271 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 14:39:41,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 164 transitions. [2022-02-20 14:39:41,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 164 transitions. [2022-02-20 14:39:41,359 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 164 edges. 164 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:41,370 INFO L225 Difference]: With dead ends: 449 [2022-02-20 14:39:41,370 INFO L226 Difference]: Without dead ends: 447 [2022-02-20 14:39:41,371 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-02-20 14:39:41,371 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 62 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:41,372 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 242 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:41,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 447 states. [2022-02-20 14:39:41,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 447 to 349. [2022-02-20 14:39:41,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:41,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 447 states. Second operand has 349 states, 348 states have (on average 1.7902298850574712) internal successors, (623), 348 states have internal predecessors, (623), 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-02-20 14:39:41,380 INFO L74 IsIncluded]: Start isIncluded. First operand 447 states. Second operand has 349 states, 348 states have (on average 1.7902298850574712) internal successors, (623), 348 states have internal predecessors, (623), 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-02-20 14:39:41,381 INFO L87 Difference]: Start difference. First operand 447 states. Second operand has 349 states, 348 states have (on average 1.7902298850574712) internal successors, (623), 348 states have internal predecessors, (623), 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-02-20 14:39:41,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:41,393 INFO L93 Difference]: Finished difference Result 447 states and 808 transitions. [2022-02-20 14:39:41,393 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 808 transitions. [2022-02-20 14:39:41,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:41,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:41,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 349 states, 348 states have (on average 1.7902298850574712) internal successors, (623), 348 states have internal predecessors, (623), 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 447 states. [2022-02-20 14:39:41,396 INFO L87 Difference]: Start difference. First operand has 349 states, 348 states have (on average 1.7902298850574712) internal successors, (623), 348 states have internal predecessors, (623), 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 447 states. [2022-02-20 14:39:41,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:41,408 INFO L93 Difference]: Finished difference Result 447 states and 808 transitions. [2022-02-20 14:39:41,408 INFO L276 IsEmpty]: Start isEmpty. Operand 447 states and 808 transitions. [2022-02-20 14:39:41,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:41,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:41,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:41,409 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:41,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 349 states, 348 states have (on average 1.7902298850574712) internal successors, (623), 348 states have internal predecessors, (623), 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-02-20 14:39:41,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 349 states to 349 states and 623 transitions. [2022-02-20 14:39:41,417 INFO L78 Accepts]: Start accepts. Automaton has 349 states and 623 transitions. Word has length 23 [2022-02-20 14:39:41,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:41,418 INFO L470 AbstractCegarLoop]: Abstraction has 349 states and 623 transitions. [2022-02-20 14:39:41,418 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-02-20 14:39:41,418 INFO L276 IsEmpty]: Start isEmpty. Operand 349 states and 623 transitions. [2022-02-20 14:39:41,418 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 14:39:41,419 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:41,419 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:41,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 14:39:41,419 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:41,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:41,420 INFO L85 PathProgramCache]: Analyzing trace with hash -2039937514, now seen corresponding path program 1 times [2022-02-20 14:39:41,420 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:41,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860409158] [2022-02-20 14:39:41,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:41,420 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:41,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:41,450 INFO L290 TraceCheckUtils]: 0: Hoare triple {7029#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {7029#true} is VALID [2022-02-20 14:39:41,450 INFO L290 TraceCheckUtils]: 1: Hoare triple {7029#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {7029#true} is VALID [2022-02-20 14:39:41,451 INFO L290 TraceCheckUtils]: 2: Hoare triple {7029#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {7029#true} is VALID [2022-02-20 14:39:41,451 INFO L290 TraceCheckUtils]: 3: Hoare triple {7029#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; {7029#true} is VALID [2022-02-20 14:39:41,451 INFO L290 TraceCheckUtils]: 4: Hoare triple {7029#true} assume !(0 != main_~p1~0#1); {7029#true} is VALID [2022-02-20 14:39:41,451 INFO L290 TraceCheckUtils]: 5: Hoare triple {7029#true} assume !(0 != main_~p2~0#1); {7029#true} is VALID [2022-02-20 14:39:41,451 INFO L290 TraceCheckUtils]: 6: Hoare triple {7029#true} assume !(0 != main_~p3~0#1); {7029#true} is VALID [2022-02-20 14:39:41,452 INFO L290 TraceCheckUtils]: 7: Hoare triple {7029#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:41,452 INFO L290 TraceCheckUtils]: 8: Hoare triple {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:41,453 INFO L290 TraceCheckUtils]: 9: Hoare triple {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:41,453 INFO L290 TraceCheckUtils]: 10: Hoare triple {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:41,453 INFO L290 TraceCheckUtils]: 11: Hoare triple {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:41,454 INFO L290 TraceCheckUtils]: 12: Hoare triple {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:41,454 INFO L290 TraceCheckUtils]: 13: Hoare triple {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:41,454 INFO L290 TraceCheckUtils]: 14: Hoare triple {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p11~0#1); {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:41,455 INFO L290 TraceCheckUtils]: 15: Hoare triple {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:41,455 INFO L290 TraceCheckUtils]: 16: Hoare triple {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:41,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:41,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p1~0#1); {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:41,456 INFO L290 TraceCheckUtils]: 19: Hoare triple {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p2~0#1); {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:41,457 INFO L290 TraceCheckUtils]: 20: Hoare triple {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p3~0#1); {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:41,457 INFO L290 TraceCheckUtils]: 21: Hoare triple {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p4~0#1; {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:41,458 INFO L290 TraceCheckUtils]: 22: Hoare triple {7031#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 1 != main_~lk4~0#1; {7030#false} is VALID [2022-02-20 14:39:41,458 INFO L290 TraceCheckUtils]: 23: Hoare triple {7030#false} assume !false; {7030#false} is VALID [2022-02-20 14:39:41,458 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:41,458 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:41,458 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860409158] [2022-02-20 14:39:41,458 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1860409158] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:41,459 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:41,459 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:41,459 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365230264] [2022-02-20 14:39:41,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:41,459 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-02-20 14:39:41,460 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:41,460 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-02-20 14:39:41,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:41,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:41,474 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:41,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:41,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:41,475 INFO L87 Difference]: Start difference. First operand 349 states and 623 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-02-20 14:39:41,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:41,564 INFO L93 Difference]: Finished difference Result 661 states and 1193 transitions. [2022-02-20 14:39:41,564 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:41,564 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-02-20 14:39:41,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:41,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-02-20 14:39:41,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2022-02-20 14:39:41,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-02-20 14:39:41,566 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 163 transitions. [2022-02-20 14:39:41,567 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 163 transitions. [2022-02-20 14:39:41,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:41,670 INFO L225 Difference]: With dead ends: 661 [2022-02-20 14:39:41,671 INFO L226 Difference]: Without dead ends: 659 [2022-02-20 14:39:41,671 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-02-20 14:39:41,672 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 59 mSDsluCounter, 81 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 169 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-02-20 14:39:41,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 169 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:41,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 659 states. [2022-02-20 14:39:41,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 659 to 481. [2022-02-20 14:39:41,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:41,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 659 states. Second operand has 481 states, 480 states have (on average 1.7645833333333334) internal successors, (847), 480 states have internal predecessors, (847), 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-02-20 14:39:41,680 INFO L74 IsIncluded]: Start isIncluded. First operand 659 states. Second operand has 481 states, 480 states have (on average 1.7645833333333334) internal successors, (847), 480 states have internal predecessors, (847), 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-02-20 14:39:41,681 INFO L87 Difference]: Start difference. First operand 659 states. Second operand has 481 states, 480 states have (on average 1.7645833333333334) internal successors, (847), 480 states have internal predecessors, (847), 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-02-20 14:39:41,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:41,700 INFO L93 Difference]: Finished difference Result 659 states and 1184 transitions. [2022-02-20 14:39:41,700 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1184 transitions. [2022-02-20 14:39:41,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:41,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:41,702 INFO L74 IsIncluded]: Start isIncluded. First operand has 481 states, 480 states have (on average 1.7645833333333334) internal successors, (847), 480 states have internal predecessors, (847), 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 659 states. [2022-02-20 14:39:41,703 INFO L87 Difference]: Start difference. First operand has 481 states, 480 states have (on average 1.7645833333333334) internal successors, (847), 480 states have internal predecessors, (847), 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 659 states. [2022-02-20 14:39:41,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:41,744 INFO L93 Difference]: Finished difference Result 659 states and 1184 transitions. [2022-02-20 14:39:41,744 INFO L276 IsEmpty]: Start isEmpty. Operand 659 states and 1184 transitions. [2022-02-20 14:39:41,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:41,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:41,745 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:41,746 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:41,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 481 states, 480 states have (on average 1.7645833333333334) internal successors, (847), 480 states have internal predecessors, (847), 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-02-20 14:39:41,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 481 states to 481 states and 847 transitions. [2022-02-20 14:39:41,759 INFO L78 Accepts]: Start accepts. Automaton has 481 states and 847 transitions. Word has length 24 [2022-02-20 14:39:41,759 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:41,759 INFO L470 AbstractCegarLoop]: Abstraction has 481 states and 847 transitions. [2022-02-20 14:39:41,759 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-02-20 14:39:41,759 INFO L276 IsEmpty]: Start isEmpty. Operand 481 states and 847 transitions. [2022-02-20 14:39:41,760 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 14:39:41,760 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:41,760 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:41,760 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 14:39:41,760 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:41,761 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:41,761 INFO L85 PathProgramCache]: Analyzing trace with hash 666681880, now seen corresponding path program 1 times [2022-02-20 14:39:41,761 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:41,761 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169947084] [2022-02-20 14:39:41,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:41,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:41,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:41,787 INFO L290 TraceCheckUtils]: 0: Hoare triple {9524#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {9524#true} is VALID [2022-02-20 14:39:41,787 INFO L290 TraceCheckUtils]: 1: Hoare triple {9524#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {9524#true} is VALID [2022-02-20 14:39:41,788 INFO L290 TraceCheckUtils]: 2: Hoare triple {9524#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {9524#true} is VALID [2022-02-20 14:39:41,788 INFO L290 TraceCheckUtils]: 3: Hoare triple {9524#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; {9524#true} is VALID [2022-02-20 14:39:41,788 INFO L290 TraceCheckUtils]: 4: Hoare triple {9524#true} assume !(0 != main_~p1~0#1); {9524#true} is VALID [2022-02-20 14:39:41,788 INFO L290 TraceCheckUtils]: 5: Hoare triple {9524#true} assume !(0 != main_~p2~0#1); {9524#true} is VALID [2022-02-20 14:39:41,788 INFO L290 TraceCheckUtils]: 6: Hoare triple {9524#true} assume !(0 != main_~p3~0#1); {9524#true} is VALID [2022-02-20 14:39:41,789 INFO L290 TraceCheckUtils]: 7: Hoare triple {9524#true} assume !(0 != main_~p4~0#1); {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:41,789 INFO L290 TraceCheckUtils]: 8: Hoare triple {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:41,790 INFO L290 TraceCheckUtils]: 9: Hoare triple {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:41,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:41,790 INFO L290 TraceCheckUtils]: 11: Hoare triple {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:41,791 INFO L290 TraceCheckUtils]: 12: Hoare triple {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:41,791 INFO L290 TraceCheckUtils]: 13: Hoare triple {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:41,792 INFO L290 TraceCheckUtils]: 14: Hoare triple {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p11~0#1); {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:41,792 INFO L290 TraceCheckUtils]: 15: Hoare triple {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:41,792 INFO L290 TraceCheckUtils]: 16: Hoare triple {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:41,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:41,793 INFO L290 TraceCheckUtils]: 18: Hoare triple {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p1~0#1); {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:41,793 INFO L290 TraceCheckUtils]: 19: Hoare triple {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p2~0#1); {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:41,794 INFO L290 TraceCheckUtils]: 20: Hoare triple {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p3~0#1); {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:41,794 INFO L290 TraceCheckUtils]: 21: Hoare triple {9526#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p4~0#1; {9525#false} is VALID [2022-02-20 14:39:41,794 INFO L290 TraceCheckUtils]: 22: Hoare triple {9525#false} assume 1 != main_~lk4~0#1; {9525#false} is VALID [2022-02-20 14:39:41,794 INFO L290 TraceCheckUtils]: 23: Hoare triple {9525#false} assume !false; {9525#false} is VALID [2022-02-20 14:39:41,795 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:41,795 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:41,795 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169947084] [2022-02-20 14:39:41,795 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169947084] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:41,795 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:41,795 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:41,795 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404953622] [2022-02-20 14:39:41,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:41,796 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-02-20 14:39:41,796 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:41,796 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-02-20 14:39:41,809 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:41,809 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:41,809 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:41,810 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:41,810 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:41,810 INFO L87 Difference]: Start difference. First operand 481 states and 847 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-02-20 14:39:41,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:41,949 INFO L93 Difference]: Finished difference Result 1157 states and 2049 transitions. [2022-02-20 14:39:41,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:41,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-02-20 14:39:41,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:41,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-02-20 14:39:41,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2022-02-20 14:39:41,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-02-20 14:39:41,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 251 transitions. [2022-02-20 14:39:41,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 251 transitions. [2022-02-20 14:39:42,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 251 edges. 251 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:42,101 INFO L225 Difference]: With dead ends: 1157 [2022-02-20 14:39:42,102 INFO L226 Difference]: Without dead ends: 683 [2022-02-20 14:39:42,103 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-02-20 14:39:42,103 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 65 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:42,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 202 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:42,104 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-02-20 14:39:42,115 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 681. [2022-02-20 14:39:42,115 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:42,116 INFO L82 GeneralOperation]: Start isEquivalent. First operand 683 states. Second operand has 681 states, 680 states have (on average 1.7573529411764706) internal successors, (1195), 680 states have internal predecessors, (1195), 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-02-20 14:39:42,117 INFO L74 IsIncluded]: Start isIncluded. First operand 683 states. Second operand has 681 states, 680 states have (on average 1.7573529411764706) internal successors, (1195), 680 states have internal predecessors, (1195), 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-02-20 14:39:42,118 INFO L87 Difference]: Start difference. First operand 683 states. Second operand has 681 states, 680 states have (on average 1.7573529411764706) internal successors, (1195), 680 states have internal predecessors, (1195), 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-02-20 14:39:42,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:42,138 INFO L93 Difference]: Finished difference Result 683 states and 1196 transitions. [2022-02-20 14:39:42,138 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1196 transitions. [2022-02-20 14:39:42,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:42,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:42,140 INFO L74 IsIncluded]: Start isIncluded. First operand has 681 states, 680 states have (on average 1.7573529411764706) internal successors, (1195), 680 states have internal predecessors, (1195), 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 683 states. [2022-02-20 14:39:42,141 INFO L87 Difference]: Start difference. First operand has 681 states, 680 states have (on average 1.7573529411764706) internal successors, (1195), 680 states have internal predecessors, (1195), 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 683 states. [2022-02-20 14:39:42,162 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:42,162 INFO L93 Difference]: Finished difference Result 683 states and 1196 transitions. [2022-02-20 14:39:42,162 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 1196 transitions. [2022-02-20 14:39:42,163 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:42,163 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:42,163 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:42,163 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:42,165 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 681 states, 680 states have (on average 1.7573529411764706) internal successors, (1195), 680 states have internal predecessors, (1195), 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-02-20 14:39:42,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 681 states to 681 states and 1195 transitions. [2022-02-20 14:39:42,186 INFO L78 Accepts]: Start accepts. Automaton has 681 states and 1195 transitions. Word has length 24 [2022-02-20 14:39:42,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:42,186 INFO L470 AbstractCegarLoop]: Abstraction has 681 states and 1195 transitions. [2022-02-20 14:39:42,186 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 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-02-20 14:39:42,186 INFO L276 IsEmpty]: Start isEmpty. Operand 681 states and 1195 transitions. [2022-02-20 14:39:42,187 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 14:39:42,187 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:42,187 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-02-20 14:39:42,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 14:39:42,188 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:42,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:42,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1186659581, now seen corresponding path program 1 times [2022-02-20 14:39:42,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:42,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610392834] [2022-02-20 14:39:42,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:42,189 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:42,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:42,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {12779#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {12779#true} is VALID [2022-02-20 14:39:42,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {12779#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {12779#true} is VALID [2022-02-20 14:39:42,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {12779#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {12779#true} is VALID [2022-02-20 14:39:42,218 INFO L290 TraceCheckUtils]: 3: Hoare triple {12779#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; {12779#true} is VALID [2022-02-20 14:39:42,218 INFO L290 TraceCheckUtils]: 4: Hoare triple {12779#true} assume !(0 != main_~p1~0#1); {12779#true} is VALID [2022-02-20 14:39:42,218 INFO L290 TraceCheckUtils]: 5: Hoare triple {12779#true} assume !(0 != main_~p2~0#1); {12779#true} is VALID [2022-02-20 14:39:42,219 INFO L290 TraceCheckUtils]: 6: Hoare triple {12779#true} assume !(0 != main_~p3~0#1); {12779#true} is VALID [2022-02-20 14:39:42,219 INFO L290 TraceCheckUtils]: 7: Hoare triple {12779#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:42,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:42,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:42,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:42,220 INFO L290 TraceCheckUtils]: 11: Hoare triple {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:42,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:42,221 INFO L290 TraceCheckUtils]: 13: Hoare triple {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:42,221 INFO L290 TraceCheckUtils]: 14: Hoare triple {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p11~0#1); {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:42,222 INFO L290 TraceCheckUtils]: 15: Hoare triple {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:42,222 INFO L290 TraceCheckUtils]: 16: Hoare triple {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:42,222 INFO L290 TraceCheckUtils]: 17: Hoare triple {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:42,223 INFO L290 TraceCheckUtils]: 18: Hoare triple {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p1~0#1); {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:42,223 INFO L290 TraceCheckUtils]: 19: Hoare triple {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p2~0#1); {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:42,223 INFO L290 TraceCheckUtils]: 20: Hoare triple {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p3~0#1); {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:42,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {12781#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p4~0#1); {12780#false} is VALID [2022-02-20 14:39:42,224 INFO L290 TraceCheckUtils]: 22: Hoare triple {12780#false} assume 0 != main_~p5~0#1; {12780#false} is VALID [2022-02-20 14:39:42,224 INFO L290 TraceCheckUtils]: 23: Hoare triple {12780#false} assume 1 != main_~lk5~0#1; {12780#false} is VALID [2022-02-20 14:39:42,224 INFO L290 TraceCheckUtils]: 24: Hoare triple {12780#false} assume !false; {12780#false} is VALID [2022-02-20 14:39:42,224 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:42,224 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:42,224 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610392834] [2022-02-20 14:39:42,225 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610392834] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:42,225 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:42,225 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:42,225 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [533046634] [2022-02-20 14:39:42,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:42,225 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 25 [2022-02-20 14:39:42,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:42,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 14:39:42,238 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:42,239 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:42,239 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:42,239 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:42,239 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:42,239 INFO L87 Difference]: Start difference. First operand 681 states and 1195 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-02-20 14:39:42,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:42,374 INFO L93 Difference]: Finished difference Result 1029 states and 1801 transitions. [2022-02-20 14:39:42,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:42,375 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 25 [2022-02-20 14:39:42,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:42,375 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 14:39:42,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2022-02-20 14:39:42,376 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 14:39:42,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 246 transitions. [2022-02-20 14:39:42,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 246 transitions. [2022-02-20 14:39:42,503 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:42,523 INFO L225 Difference]: With dead ends: 1029 [2022-02-20 14:39:42,523 INFO L226 Difference]: Without dead ends: 695 [2022-02-20 14:39:42,524 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-02-20 14:39:42,524 INFO L933 BasicCegarLoop]: 133 mSDtfsCounter, 67 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:42,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 212 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:42,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 695 states. [2022-02-20 14:39:42,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 695 to 693. [2022-02-20 14:39:42,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:42,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 695 states. Second operand has 693 states, 692 states have (on average 1.7384393063583814) internal successors, (1203), 692 states have internal predecessors, (1203), 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-02-20 14:39:42,538 INFO L74 IsIncluded]: Start isIncluded. First operand 695 states. Second operand has 693 states, 692 states have (on average 1.7384393063583814) internal successors, (1203), 692 states have internal predecessors, (1203), 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-02-20 14:39:42,539 INFO L87 Difference]: Start difference. First operand 695 states. Second operand has 693 states, 692 states have (on average 1.7384393063583814) internal successors, (1203), 692 states have internal predecessors, (1203), 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-02-20 14:39:42,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:42,557 INFO L93 Difference]: Finished difference Result 695 states and 1204 transitions. [2022-02-20 14:39:42,557 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1204 transitions. [2022-02-20 14:39:42,558 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:42,558 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:42,559 INFO L74 IsIncluded]: Start isIncluded. First operand has 693 states, 692 states have (on average 1.7384393063583814) internal successors, (1203), 692 states have internal predecessors, (1203), 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 695 states. [2022-02-20 14:39:42,559 INFO L87 Difference]: Start difference. First operand has 693 states, 692 states have (on average 1.7384393063583814) internal successors, (1203), 692 states have internal predecessors, (1203), 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 695 states. [2022-02-20 14:39:42,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:42,575 INFO L93 Difference]: Finished difference Result 695 states and 1204 transitions. [2022-02-20 14:39:42,575 INFO L276 IsEmpty]: Start isEmpty. Operand 695 states and 1204 transitions. [2022-02-20 14:39:42,576 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:42,576 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:42,576 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:42,576 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:42,577 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 693 states, 692 states have (on average 1.7384393063583814) internal successors, (1203), 692 states have internal predecessors, (1203), 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-02-20 14:39:42,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 693 states to 693 states and 1203 transitions. [2022-02-20 14:39:42,594 INFO L78 Accepts]: Start accepts. Automaton has 693 states and 1203 transitions. Word has length 25 [2022-02-20 14:39:42,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:42,594 INFO L470 AbstractCegarLoop]: Abstraction has 693 states and 1203 transitions. [2022-02-20 14:39:42,595 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-02-20 14:39:42,595 INFO L276 IsEmpty]: Start isEmpty. Operand 693 states and 1203 transitions. [2022-02-20 14:39:42,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 14:39:42,595 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:42,596 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-02-20 14:39:42,596 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 14:39:42,596 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:42,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:42,596 INFO L85 PathProgramCache]: Analyzing trace with hash -807485125, now seen corresponding path program 1 times [2022-02-20 14:39:42,597 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:42,597 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922002438] [2022-02-20 14:39:42,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:42,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:42,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:42,623 INFO L290 TraceCheckUtils]: 0: Hoare triple {15942#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {15942#true} is VALID [2022-02-20 14:39:42,623 INFO L290 TraceCheckUtils]: 1: Hoare triple {15942#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {15942#true} is VALID [2022-02-20 14:39:42,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {15942#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {15942#true} is VALID [2022-02-20 14:39:42,624 INFO L290 TraceCheckUtils]: 3: Hoare triple {15942#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; {15942#true} is VALID [2022-02-20 14:39:42,624 INFO L290 TraceCheckUtils]: 4: Hoare triple {15942#true} assume !(0 != main_~p1~0#1); {15942#true} is VALID [2022-02-20 14:39:42,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {15942#true} assume !(0 != main_~p2~0#1); {15942#true} is VALID [2022-02-20 14:39:42,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {15942#true} assume !(0 != main_~p3~0#1); {15942#true} is VALID [2022-02-20 14:39:42,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {15942#true} assume !(0 != main_~p4~0#1); {15942#true} is VALID [2022-02-20 14:39:42,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {15942#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:42,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:42,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:42,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:42,626 INFO L290 TraceCheckUtils]: 12: Hoare triple {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:42,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:42,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p11~0#1); {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:42,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:42,627 INFO L290 TraceCheckUtils]: 16: Hoare triple {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:42,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:42,628 INFO L290 TraceCheckUtils]: 18: Hoare triple {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p1~0#1); {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:42,628 INFO L290 TraceCheckUtils]: 19: Hoare triple {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p2~0#1); {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:42,629 INFO L290 TraceCheckUtils]: 20: Hoare triple {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p3~0#1); {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:42,629 INFO L290 TraceCheckUtils]: 21: Hoare triple {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p4~0#1); {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:42,629 INFO L290 TraceCheckUtils]: 22: Hoare triple {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p5~0#1; {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:42,630 INFO L290 TraceCheckUtils]: 23: Hoare triple {15944#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 1 != main_~lk5~0#1; {15943#false} is VALID [2022-02-20 14:39:42,630 INFO L290 TraceCheckUtils]: 24: Hoare triple {15943#false} assume !false; {15943#false} is VALID [2022-02-20 14:39:42,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:42,630 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:42,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922002438] [2022-02-20 14:39:42,630 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922002438] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:42,630 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:42,631 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:42,631 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742685284] [2022-02-20 14:39:42,631 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:42,631 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 25 [2022-02-20 14:39:42,631 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:42,631 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 14:39:42,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:42,646 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:42,646 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:42,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:42,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:42,646 INFO L87 Difference]: Start difference. First operand 693 states and 1203 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-02-20 14:39:42,782 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:42,783 INFO L93 Difference]: Finished difference Result 1289 states and 2269 transitions. [2022-02-20 14:39:42,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:42,783 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 25 [2022-02-20 14:39:42,783 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:42,783 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 14:39:42,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2022-02-20 14:39:42,785 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 14:39:42,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 159 transitions. [2022-02-20 14:39:42,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 159 transitions. [2022-02-20 14:39:42,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:42,929 INFO L225 Difference]: With dead ends: 1289 [2022-02-20 14:39:42,930 INFO L226 Difference]: Without dead ends: 1287 [2022-02-20 14:39:42,930 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-02-20 14:39:42,931 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 56 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 167 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-02-20 14:39:42,931 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 167 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:42,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1287 states. [2022-02-20 14:39:42,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1287 to 965. [2022-02-20 14:39:42,949 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:42,951 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1287 states. Second operand has 965 states, 964 states have (on average 1.704356846473029) internal successors, (1643), 964 states have internal predecessors, (1643), 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-02-20 14:39:42,952 INFO L74 IsIncluded]: Start isIncluded. First operand 1287 states. Second operand has 965 states, 964 states have (on average 1.704356846473029) internal successors, (1643), 964 states have internal predecessors, (1643), 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-02-20 14:39:42,953 INFO L87 Difference]: Start difference. First operand 1287 states. Second operand has 965 states, 964 states have (on average 1.704356846473029) internal successors, (1643), 964 states have internal predecessors, (1643), 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-02-20 14:39:43,039 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:43,039 INFO L93 Difference]: Finished difference Result 1287 states and 2252 transitions. [2022-02-20 14:39:43,039 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 2252 transitions. [2022-02-20 14:39:43,041 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:43,041 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:43,043 INFO L74 IsIncluded]: Start isIncluded. First operand has 965 states, 964 states have (on average 1.704356846473029) internal successors, (1643), 964 states have internal predecessors, (1643), 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 1287 states. [2022-02-20 14:39:43,044 INFO L87 Difference]: Start difference. First operand has 965 states, 964 states have (on average 1.704356846473029) internal successors, (1643), 964 states have internal predecessors, (1643), 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 1287 states. [2022-02-20 14:39:43,107 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:43,107 INFO L93 Difference]: Finished difference Result 1287 states and 2252 transitions. [2022-02-20 14:39:43,107 INFO L276 IsEmpty]: Start isEmpty. Operand 1287 states and 2252 transitions. [2022-02-20 14:39:43,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:43,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:43,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:43,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:43,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 965 states, 964 states have (on average 1.704356846473029) internal successors, (1643), 964 states have internal predecessors, (1643), 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-02-20 14:39:43,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 965 states to 965 states and 1643 transitions. [2022-02-20 14:39:43,144 INFO L78 Accepts]: Start accepts. Automaton has 965 states and 1643 transitions. Word has length 25 [2022-02-20 14:39:43,144 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:43,144 INFO L470 AbstractCegarLoop]: Abstraction has 965 states and 1643 transitions. [2022-02-20 14:39:43,144 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-02-20 14:39:43,145 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1643 transitions. [2022-02-20 14:39:43,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 14:39:43,146 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:43,146 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-02-20 14:39:43,146 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 14:39:43,146 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:43,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:43,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1899134269, now seen corresponding path program 1 times [2022-02-20 14:39:43,147 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:43,147 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056093842] [2022-02-20 14:39:43,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:43,147 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:43,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:43,173 INFO L290 TraceCheckUtils]: 0: Hoare triple {20829#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {20829#true} is VALID [2022-02-20 14:39:43,173 INFO L290 TraceCheckUtils]: 1: Hoare triple {20829#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {20829#true} is VALID [2022-02-20 14:39:43,173 INFO L290 TraceCheckUtils]: 2: Hoare triple {20829#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {20829#true} is VALID [2022-02-20 14:39:43,173 INFO L290 TraceCheckUtils]: 3: Hoare triple {20829#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; {20829#true} is VALID [2022-02-20 14:39:43,174 INFO L290 TraceCheckUtils]: 4: Hoare triple {20829#true} assume !(0 != main_~p1~0#1); {20829#true} is VALID [2022-02-20 14:39:43,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {20829#true} assume !(0 != main_~p2~0#1); {20829#true} is VALID [2022-02-20 14:39:43,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {20829#true} assume !(0 != main_~p3~0#1); {20829#true} is VALID [2022-02-20 14:39:43,174 INFO L290 TraceCheckUtils]: 7: Hoare triple {20829#true} assume !(0 != main_~p4~0#1); {20829#true} is VALID [2022-02-20 14:39:43,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {20829#true} assume !(0 != main_~p5~0#1); {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:43,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:43,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:43,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:43,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:43,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:43,177 INFO L290 TraceCheckUtils]: 14: Hoare triple {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p11~0#1); {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:43,177 INFO L290 TraceCheckUtils]: 15: Hoare triple {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:43,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:43,178 INFO L290 TraceCheckUtils]: 17: Hoare triple {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:43,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p1~0#1); {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:43,179 INFO L290 TraceCheckUtils]: 19: Hoare triple {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p2~0#1); {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:43,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p3~0#1); {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:43,179 INFO L290 TraceCheckUtils]: 21: Hoare triple {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p4~0#1); {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:43,180 INFO L290 TraceCheckUtils]: 22: Hoare triple {20831#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p5~0#1; {20830#false} is VALID [2022-02-20 14:39:43,180 INFO L290 TraceCheckUtils]: 23: Hoare triple {20830#false} assume 1 != main_~lk5~0#1; {20830#false} is VALID [2022-02-20 14:39:43,180 INFO L290 TraceCheckUtils]: 24: Hoare triple {20830#false} assume !false; {20830#false} is VALID [2022-02-20 14:39:43,180 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:43,180 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:43,181 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056093842] [2022-02-20 14:39:43,181 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056093842] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:43,181 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:43,181 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:43,181 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375688591] [2022-02-20 14:39:43,181 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:43,182 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 25 [2022-02-20 14:39:43,182 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:43,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 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-02-20 14:39:43,196 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:43,196 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:43,197 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:43,197 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:43,197 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:43,197 INFO L87 Difference]: Start difference. First operand 965 states and 1643 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-02-20 14:39:43,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:43,460 INFO L93 Difference]: Finished difference Result 2297 states and 3933 transitions. [2022-02-20 14:39:43,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:43,460 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 25 [2022-02-20 14:39:43,460 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:43,460 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 14:39:43,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2022-02-20 14:39:43,461 INFO L82 GeneralOperation]: Start removeUnreachable. 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-02-20 14:39:43,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 248 transitions. [2022-02-20 14:39:43,462 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 248 transitions. [2022-02-20 14:39:43,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 248 edges. 248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:43,656 INFO L225 Difference]: With dead ends: 2297 [2022-02-20 14:39:43,656 INFO L226 Difference]: Without dead ends: 1351 [2022-02-20 14:39:43,657 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-02-20 14:39:43,658 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 64 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 203 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:43,658 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 203 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:43,659 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1351 states. [2022-02-20 14:39:43,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1351 to 1349. [2022-02-20 14:39:43,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:43,680 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1351 states. Second operand has 1349 states, 1348 states have (on average 1.6995548961424332) internal successors, (2291), 1348 states have internal predecessors, (2291), 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-02-20 14:39:43,682 INFO L74 IsIncluded]: Start isIncluded. First operand 1351 states. Second operand has 1349 states, 1348 states have (on average 1.6995548961424332) internal successors, (2291), 1348 states have internal predecessors, (2291), 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-02-20 14:39:43,683 INFO L87 Difference]: Start difference. First operand 1351 states. Second operand has 1349 states, 1348 states have (on average 1.6995548961424332) internal successors, (2291), 1348 states have internal predecessors, (2291), 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-02-20 14:39:43,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:43,734 INFO L93 Difference]: Finished difference Result 1351 states and 2292 transitions. [2022-02-20 14:39:43,734 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 2292 transitions. [2022-02-20 14:39:43,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:43,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:43,739 INFO L74 IsIncluded]: Start isIncluded. First operand has 1349 states, 1348 states have (on average 1.6995548961424332) internal successors, (2291), 1348 states have internal predecessors, (2291), 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 1351 states. [2022-02-20 14:39:43,740 INFO L87 Difference]: Start difference. First operand has 1349 states, 1348 states have (on average 1.6995548961424332) internal successors, (2291), 1348 states have internal predecessors, (2291), 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 1351 states. [2022-02-20 14:39:43,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:43,799 INFO L93 Difference]: Finished difference Result 1351 states and 2292 transitions. [2022-02-20 14:39:43,799 INFO L276 IsEmpty]: Start isEmpty. Operand 1351 states and 2292 transitions. [2022-02-20 14:39:43,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:43,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:43,801 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:43,801 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:43,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1349 states, 1348 states have (on average 1.6995548961424332) internal successors, (2291), 1348 states have internal predecessors, (2291), 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-02-20 14:39:43,869 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1349 states to 1349 states and 2291 transitions. [2022-02-20 14:39:43,870 INFO L78 Accepts]: Start accepts. Automaton has 1349 states and 2291 transitions. Word has length 25 [2022-02-20 14:39:43,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:43,870 INFO L470 AbstractCegarLoop]: Abstraction has 1349 states and 2291 transitions. [2022-02-20 14:39:43,870 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-02-20 14:39:43,870 INFO L276 IsEmpty]: Start isEmpty. Operand 1349 states and 2291 transitions. [2022-02-20 14:39:43,871 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 14:39:43,871 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:43,871 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:43,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 14:39:43,872 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:43,872 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:43,872 INFO L85 PathProgramCache]: Analyzing trace with hash 737978317, now seen corresponding path program 1 times [2022-02-20 14:39:43,872 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:43,872 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [577061032] [2022-02-20 14:39:43,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:43,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:43,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:43,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {27268#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {27268#true} is VALID [2022-02-20 14:39:43,911 INFO L290 TraceCheckUtils]: 1: Hoare triple {27268#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {27268#true} is VALID [2022-02-20 14:39:43,911 INFO L290 TraceCheckUtils]: 2: Hoare triple {27268#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {27268#true} is VALID [2022-02-20 14:39:43,911 INFO L290 TraceCheckUtils]: 3: Hoare triple {27268#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; {27268#true} is VALID [2022-02-20 14:39:43,912 INFO L290 TraceCheckUtils]: 4: Hoare triple {27268#true} assume !(0 != main_~p1~0#1); {27268#true} is VALID [2022-02-20 14:39:43,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {27268#true} assume !(0 != main_~p2~0#1); {27268#true} is VALID [2022-02-20 14:39:43,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {27268#true} assume !(0 != main_~p3~0#1); {27268#true} is VALID [2022-02-20 14:39:43,912 INFO L290 TraceCheckUtils]: 7: Hoare triple {27268#true} assume !(0 != main_~p4~0#1); {27268#true} is VALID [2022-02-20 14:39:43,913 INFO L290 TraceCheckUtils]: 8: Hoare triple {27268#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:43,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:43,914 INFO L290 TraceCheckUtils]: 10: Hoare triple {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:43,914 INFO L290 TraceCheckUtils]: 11: Hoare triple {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:43,915 INFO L290 TraceCheckUtils]: 12: Hoare triple {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:43,915 INFO L290 TraceCheckUtils]: 13: Hoare triple {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:43,915 INFO L290 TraceCheckUtils]: 14: Hoare triple {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p11~0#1); {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:43,916 INFO L290 TraceCheckUtils]: 15: Hoare triple {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:43,916 INFO L290 TraceCheckUtils]: 16: Hoare triple {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:43,916 INFO L290 TraceCheckUtils]: 17: Hoare triple {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:43,917 INFO L290 TraceCheckUtils]: 18: Hoare triple {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p1~0#1); {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:43,917 INFO L290 TraceCheckUtils]: 19: Hoare triple {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p2~0#1); {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:43,917 INFO L290 TraceCheckUtils]: 20: Hoare triple {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p3~0#1); {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:43,918 INFO L290 TraceCheckUtils]: 21: Hoare triple {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p4~0#1); {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:43,918 INFO L290 TraceCheckUtils]: 22: Hoare triple {27270#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p5~0#1); {27269#false} is VALID [2022-02-20 14:39:43,918 INFO L290 TraceCheckUtils]: 23: Hoare triple {27269#false} assume 0 != main_~p6~0#1; {27269#false} is VALID [2022-02-20 14:39:43,918 INFO L290 TraceCheckUtils]: 24: Hoare triple {27269#false} assume 1 != main_~lk6~0#1; {27269#false} is VALID [2022-02-20 14:39:43,918 INFO L290 TraceCheckUtils]: 25: Hoare triple {27269#false} assume !false; {27269#false} is VALID [2022-02-20 14:39:43,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:43,919 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:43,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [577061032] [2022-02-20 14:39:43,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [577061032] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:43,919 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:43,919 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:43,920 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1188496872] [2022-02-20 14:39:43,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:43,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 14:39:43,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:43,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 14:39:43,935 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:43,935 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:43,935 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:43,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:43,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:43,936 INFO L87 Difference]: Start difference. First operand 1349 states and 2291 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 14:39:44,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:44,160 INFO L93 Difference]: Finished difference Result 2025 states and 3429 transitions. [2022-02-20 14:39:44,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:44,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 14:39:44,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 14:39:44,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2022-02-20 14:39:44,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 14:39:44,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 243 transitions. [2022-02-20 14:39:44,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 243 transitions. [2022-02-20 14:39:44,290 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 243 edges. 243 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:44,363 INFO L225 Difference]: With dead ends: 2025 [2022-02-20 14:39:44,363 INFO L226 Difference]: Without dead ends: 1367 [2022-02-20 14:39:44,364 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-02-20 14:39:44,365 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 66 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:44,365 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [66 Valid, 208 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:44,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1367 states. [2022-02-20 14:39:44,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1367 to 1365. [2022-02-20 14:39:44,386 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:44,388 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1367 states. Second operand has 1365 states, 1364 states have (on average 1.6796187683284458) internal successors, (2291), 1364 states have internal predecessors, (2291), 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-02-20 14:39:44,389 INFO L74 IsIncluded]: Start isIncluded. First operand 1367 states. Second operand has 1365 states, 1364 states have (on average 1.6796187683284458) internal successors, (2291), 1364 states have internal predecessors, (2291), 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-02-20 14:39:44,390 INFO L87 Difference]: Start difference. First operand 1367 states. Second operand has 1365 states, 1364 states have (on average 1.6796187683284458) internal successors, (2291), 1364 states have internal predecessors, (2291), 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-02-20 14:39:44,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:44,449 INFO L93 Difference]: Finished difference Result 1367 states and 2292 transitions. [2022-02-20 14:39:44,449 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 2292 transitions. [2022-02-20 14:39:44,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:44,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:44,452 INFO L74 IsIncluded]: Start isIncluded. First operand has 1365 states, 1364 states have (on average 1.6796187683284458) internal successors, (2291), 1364 states have internal predecessors, (2291), 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 1367 states. [2022-02-20 14:39:44,453 INFO L87 Difference]: Start difference. First operand has 1365 states, 1364 states have (on average 1.6796187683284458) internal successors, (2291), 1364 states have internal predecessors, (2291), 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 1367 states. [2022-02-20 14:39:44,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:44,519 INFO L93 Difference]: Finished difference Result 1367 states and 2292 transitions. [2022-02-20 14:39:44,519 INFO L276 IsEmpty]: Start isEmpty. Operand 1367 states and 2292 transitions. [2022-02-20 14:39:44,520 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:44,520 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:44,520 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:44,520 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:44,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1365 states, 1364 states have (on average 1.6796187683284458) internal successors, (2291), 1364 states have internal predecessors, (2291), 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-02-20 14:39:44,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1365 states to 1365 states and 2291 transitions. [2022-02-20 14:39:44,584 INFO L78 Accepts]: Start accepts. Automaton has 1365 states and 2291 transitions. Word has length 26 [2022-02-20 14:39:44,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:44,585 INFO L470 AbstractCegarLoop]: Abstraction has 1365 states and 2291 transitions. [2022-02-20 14:39:44,585 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 14:39:44,585 INFO L276 IsEmpty]: Start isEmpty. Operand 1365 states and 2291 transitions. [2022-02-20 14:39:44,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 14:39:44,587 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:44,587 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:44,587 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 14:39:44,587 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:44,588 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:44,588 INFO L85 PathProgramCache]: Analyzing trace with hash -1256166389, now seen corresponding path program 1 times [2022-02-20 14:39:44,588 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:44,588 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765896017] [2022-02-20 14:39:44,588 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:44,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:44,608 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:44,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {33483#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {33483#true} is VALID [2022-02-20 14:39:44,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {33483#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {33483#true} is VALID [2022-02-20 14:39:44,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {33483#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {33483#true} is VALID [2022-02-20 14:39:44,628 INFO L290 TraceCheckUtils]: 3: Hoare triple {33483#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; {33483#true} is VALID [2022-02-20 14:39:44,628 INFO L290 TraceCheckUtils]: 4: Hoare triple {33483#true} assume !(0 != main_~p1~0#1); {33483#true} is VALID [2022-02-20 14:39:44,628 INFO L290 TraceCheckUtils]: 5: Hoare triple {33483#true} assume !(0 != main_~p2~0#1); {33483#true} is VALID [2022-02-20 14:39:44,628 INFO L290 TraceCheckUtils]: 6: Hoare triple {33483#true} assume !(0 != main_~p3~0#1); {33483#true} is VALID [2022-02-20 14:39:44,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {33483#true} assume !(0 != main_~p4~0#1); {33483#true} is VALID [2022-02-20 14:39:44,629 INFO L290 TraceCheckUtils]: 8: Hoare triple {33483#true} assume !(0 != main_~p5~0#1); {33483#true} is VALID [2022-02-20 14:39:44,629 INFO L290 TraceCheckUtils]: 9: Hoare triple {33483#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:44,629 INFO L290 TraceCheckUtils]: 10: Hoare triple {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:44,629 INFO L290 TraceCheckUtils]: 11: Hoare triple {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:44,630 INFO L290 TraceCheckUtils]: 12: Hoare triple {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:44,630 INFO L290 TraceCheckUtils]: 13: Hoare triple {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:44,630 INFO L290 TraceCheckUtils]: 14: Hoare triple {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p11~0#1); {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:44,631 INFO L290 TraceCheckUtils]: 15: Hoare triple {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:44,631 INFO L290 TraceCheckUtils]: 16: Hoare triple {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:44,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:44,632 INFO L290 TraceCheckUtils]: 18: Hoare triple {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p1~0#1); {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:44,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p2~0#1); {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:44,632 INFO L290 TraceCheckUtils]: 20: Hoare triple {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p3~0#1); {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:44,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p4~0#1); {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:44,638 INFO L290 TraceCheckUtils]: 22: Hoare triple {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p5~0#1); {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:44,639 INFO L290 TraceCheckUtils]: 23: Hoare triple {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p6~0#1; {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:44,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {33485#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 1 != main_~lk6~0#1; {33484#false} is VALID [2022-02-20 14:39:44,639 INFO L290 TraceCheckUtils]: 25: Hoare triple {33484#false} assume !false; {33484#false} is VALID [2022-02-20 14:39:44,639 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:44,639 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:44,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765896017] [2022-02-20 14:39:44,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765896017] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:44,640 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:44,640 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:44,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2082866922] [2022-02-20 14:39:44,640 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:44,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 14:39:44,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:44,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 14:39:44,655 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:44,655 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:44,655 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:44,656 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:44,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:44,656 INFO L87 Difference]: Start difference. First operand 1365 states and 2291 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 14:39:44,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:44,984 INFO L93 Difference]: Finished difference Result 2505 states and 4277 transitions. [2022-02-20 14:39:44,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:44,984 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 14:39:44,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:44,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 14:39:44,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2022-02-20 14:39:44,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 14:39:44,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2022-02-20 14:39:44,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 155 transitions. [2022-02-20 14:39:45,084 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:45,308 INFO L225 Difference]: With dead ends: 2505 [2022-02-20 14:39:45,309 INFO L226 Difference]: Without dead ends: 2503 [2022-02-20 14:39:45,311 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-02-20 14:39:45,313 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 53 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 165 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-02-20 14:39:45,313 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 165 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:45,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2503 states. [2022-02-20 14:39:45,339 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2503 to 1925. [2022-02-20 14:39:45,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:45,342 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2503 states. Second operand has 1925 states, 1924 states have (on average 1.6398128898128899) internal successors, (3155), 1924 states have internal predecessors, (3155), 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-02-20 14:39:45,343 INFO L74 IsIncluded]: Start isIncluded. First operand 2503 states. Second operand has 1925 states, 1924 states have (on average 1.6398128898128899) internal successors, (3155), 1924 states have internal predecessors, (3155), 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-02-20 14:39:45,345 INFO L87 Difference]: Start difference. First operand 2503 states. Second operand has 1925 states, 1924 states have (on average 1.6398128898128899) internal successors, (3155), 1924 states have internal predecessors, (3155), 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-02-20 14:39:45,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:45,552 INFO L93 Difference]: Finished difference Result 2503 states and 4244 transitions. [2022-02-20 14:39:45,552 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 4244 transitions. [2022-02-20 14:39:45,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:45,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:45,558 INFO L74 IsIncluded]: Start isIncluded. First operand has 1925 states, 1924 states have (on average 1.6398128898128899) internal successors, (3155), 1924 states have internal predecessors, (3155), 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 2503 states. [2022-02-20 14:39:45,559 INFO L87 Difference]: Start difference. First operand has 1925 states, 1924 states have (on average 1.6398128898128899) internal successors, (3155), 1924 states have internal predecessors, (3155), 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 2503 states. [2022-02-20 14:39:45,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:45,761 INFO L93 Difference]: Finished difference Result 2503 states and 4244 transitions. [2022-02-20 14:39:45,761 INFO L276 IsEmpty]: Start isEmpty. Operand 2503 states and 4244 transitions. [2022-02-20 14:39:45,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:45,763 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:45,763 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:45,764 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:45,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1925 states, 1924 states have (on average 1.6398128898128899) internal successors, (3155), 1924 states have internal predecessors, (3155), 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-02-20 14:39:45,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1925 states to 1925 states and 3155 transitions. [2022-02-20 14:39:45,905 INFO L78 Accepts]: Start accepts. Automaton has 1925 states and 3155 transitions. Word has length 26 [2022-02-20 14:39:45,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:45,905 INFO L470 AbstractCegarLoop]: Abstraction has 1925 states and 3155 transitions. [2022-02-20 14:39:45,905 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 14:39:45,906 INFO L276 IsEmpty]: Start isEmpty. Operand 1925 states and 3155 transitions. [2022-02-20 14:39:45,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 14:39:45,907 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:45,907 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:45,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 14:39:45,907 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:45,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:45,907 INFO L85 PathProgramCache]: Analyzing trace with hash 1450453005, now seen corresponding path program 1 times [2022-02-20 14:39:45,908 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:45,908 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1336013057] [2022-02-20 14:39:45,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:45,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:45,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:45,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {43026#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {43026#true} is VALID [2022-02-20 14:39:45,931 INFO L290 TraceCheckUtils]: 1: Hoare triple {43026#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {43026#true} is VALID [2022-02-20 14:39:45,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {43026#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {43026#true} is VALID [2022-02-20 14:39:45,931 INFO L290 TraceCheckUtils]: 3: Hoare triple {43026#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; {43026#true} is VALID [2022-02-20 14:39:45,931 INFO L290 TraceCheckUtils]: 4: Hoare triple {43026#true} assume !(0 != main_~p1~0#1); {43026#true} is VALID [2022-02-20 14:39:45,931 INFO L290 TraceCheckUtils]: 5: Hoare triple {43026#true} assume !(0 != main_~p2~0#1); {43026#true} is VALID [2022-02-20 14:39:45,932 INFO L290 TraceCheckUtils]: 6: Hoare triple {43026#true} assume !(0 != main_~p3~0#1); {43026#true} is VALID [2022-02-20 14:39:45,932 INFO L290 TraceCheckUtils]: 7: Hoare triple {43026#true} assume !(0 != main_~p4~0#1); {43026#true} is VALID [2022-02-20 14:39:45,932 INFO L290 TraceCheckUtils]: 8: Hoare triple {43026#true} assume !(0 != main_~p5~0#1); {43026#true} is VALID [2022-02-20 14:39:45,932 INFO L290 TraceCheckUtils]: 9: Hoare triple {43026#true} assume !(0 != main_~p6~0#1); {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:45,932 INFO L290 TraceCheckUtils]: 10: Hoare triple {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:45,933 INFO L290 TraceCheckUtils]: 11: Hoare triple {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:45,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:45,933 INFO L290 TraceCheckUtils]: 13: Hoare triple {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:45,934 INFO L290 TraceCheckUtils]: 14: Hoare triple {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p11~0#1); {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:45,934 INFO L290 TraceCheckUtils]: 15: Hoare triple {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:45,934 INFO L290 TraceCheckUtils]: 16: Hoare triple {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:45,935 INFO L290 TraceCheckUtils]: 17: Hoare triple {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:45,935 INFO L290 TraceCheckUtils]: 18: Hoare triple {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p1~0#1); {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:45,935 INFO L290 TraceCheckUtils]: 19: Hoare triple {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p2~0#1); {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:45,936 INFO L290 TraceCheckUtils]: 20: Hoare triple {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p3~0#1); {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:45,936 INFO L290 TraceCheckUtils]: 21: Hoare triple {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p4~0#1); {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:45,936 INFO L290 TraceCheckUtils]: 22: Hoare triple {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p5~0#1); {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:45,937 INFO L290 TraceCheckUtils]: 23: Hoare triple {43028#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p6~0#1; {43027#false} is VALID [2022-02-20 14:39:45,937 INFO L290 TraceCheckUtils]: 24: Hoare triple {43027#false} assume 1 != main_~lk6~0#1; {43027#false} is VALID [2022-02-20 14:39:45,937 INFO L290 TraceCheckUtils]: 25: Hoare triple {43027#false} assume !false; {43027#false} is VALID [2022-02-20 14:39:45,937 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:45,937 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:45,938 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1336013057] [2022-02-20 14:39:45,938 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1336013057] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:45,938 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:45,938 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:45,938 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1201496976] [2022-02-20 14:39:45,938 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:45,939 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 14:39:45,939 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:45,939 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 14:39:45,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:45,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:45,954 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:45,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:45,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:45,955 INFO L87 Difference]: Start difference. First operand 1925 states and 3155 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 14:39:46,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:46,622 INFO L93 Difference]: Finished difference Result 4553 states and 7509 transitions. [2022-02-20 14:39:46,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:46,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 14:39:46,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:46,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 14:39:46,624 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2022-02-20 14:39:46,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 14:39:46,625 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 245 transitions. [2022-02-20 14:39:46,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 245 transitions. [2022-02-20 14:39:46,752 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:46,932 INFO L225 Difference]: With dead ends: 4553 [2022-02-20 14:39:46,932 INFO L226 Difference]: Without dead ends: 2663 [2022-02-20 14:39:46,934 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-02-20 14:39:46,935 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 63 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:46,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 204 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:46,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2663 states. [2022-02-20 14:39:46,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2663 to 2661. [2022-02-20 14:39:46,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:46,967 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2663 states. Second operand has 2661 states, 2660 states have (on average 1.637218045112782) internal successors, (4355), 2660 states have internal predecessors, (4355), 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-02-20 14:39:46,969 INFO L74 IsIncluded]: Start isIncluded. First operand 2663 states. Second operand has 2661 states, 2660 states have (on average 1.637218045112782) internal successors, (4355), 2660 states have internal predecessors, (4355), 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-02-20 14:39:46,971 INFO L87 Difference]: Start difference. First operand 2663 states. Second operand has 2661 states, 2660 states have (on average 1.637218045112782) internal successors, (4355), 2660 states have internal predecessors, (4355), 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-02-20 14:39:47,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:47,137 INFO L93 Difference]: Finished difference Result 2663 states and 4356 transitions. [2022-02-20 14:39:47,137 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 4356 transitions. [2022-02-20 14:39:47,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:47,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:47,142 INFO L74 IsIncluded]: Start isIncluded. First operand has 2661 states, 2660 states have (on average 1.637218045112782) internal successors, (4355), 2660 states have internal predecessors, (4355), 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 2663 states. [2022-02-20 14:39:47,144 INFO L87 Difference]: Start difference. First operand has 2661 states, 2660 states have (on average 1.637218045112782) internal successors, (4355), 2660 states have internal predecessors, (4355), 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 2663 states. [2022-02-20 14:39:47,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:47,316 INFO L93 Difference]: Finished difference Result 2663 states and 4356 transitions. [2022-02-20 14:39:47,316 INFO L276 IsEmpty]: Start isEmpty. Operand 2663 states and 4356 transitions. [2022-02-20 14:39:47,318 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:47,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:47,319 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:47,319 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:47,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2661 states, 2660 states have (on average 1.637218045112782) internal successors, (4355), 2660 states have internal predecessors, (4355), 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-02-20 14:39:47,515 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2661 states to 2661 states and 4355 transitions. [2022-02-20 14:39:47,515 INFO L78 Accepts]: Start accepts. Automaton has 2661 states and 4355 transitions. Word has length 26 [2022-02-20 14:39:47,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:47,516 INFO L470 AbstractCegarLoop]: Abstraction has 2661 states and 4355 transitions. [2022-02-20 14:39:47,516 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 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-02-20 14:39:47,516 INFO L276 IsEmpty]: Start isEmpty. Operand 2661 states and 4355 transitions. [2022-02-20 14:39:47,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 14:39:47,517 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:47,517 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:47,517 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 14:39:47,518 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:47,518 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:47,518 INFO L85 PathProgramCache]: Analyzing trace with hash -286238638, now seen corresponding path program 1 times [2022-02-20 14:39:47,518 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:47,518 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729294845] [2022-02-20 14:39:47,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:47,519 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:47,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:47,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {55737#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {55737#true} is VALID [2022-02-20 14:39:47,542 INFO L290 TraceCheckUtils]: 1: Hoare triple {55737#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {55737#true} is VALID [2022-02-20 14:39:47,542 INFO L290 TraceCheckUtils]: 2: Hoare triple {55737#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {55737#true} is VALID [2022-02-20 14:39:47,542 INFO L290 TraceCheckUtils]: 3: Hoare triple {55737#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; {55737#true} is VALID [2022-02-20 14:39:47,542 INFO L290 TraceCheckUtils]: 4: Hoare triple {55737#true} assume !(0 != main_~p1~0#1); {55737#true} is VALID [2022-02-20 14:39:47,542 INFO L290 TraceCheckUtils]: 5: Hoare triple {55737#true} assume !(0 != main_~p2~0#1); {55737#true} is VALID [2022-02-20 14:39:47,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {55737#true} assume !(0 != main_~p3~0#1); {55737#true} is VALID [2022-02-20 14:39:47,543 INFO L290 TraceCheckUtils]: 7: Hoare triple {55737#true} assume !(0 != main_~p4~0#1); {55737#true} is VALID [2022-02-20 14:39:47,543 INFO L290 TraceCheckUtils]: 8: Hoare triple {55737#true} assume !(0 != main_~p5~0#1); {55737#true} is VALID [2022-02-20 14:39:47,543 INFO L290 TraceCheckUtils]: 9: Hoare triple {55737#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:47,544 INFO L290 TraceCheckUtils]: 10: Hoare triple {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:47,544 INFO L290 TraceCheckUtils]: 11: Hoare triple {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:47,544 INFO L290 TraceCheckUtils]: 12: Hoare triple {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:47,545 INFO L290 TraceCheckUtils]: 13: Hoare triple {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:47,545 INFO L290 TraceCheckUtils]: 14: Hoare triple {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p11~0#1); {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:47,545 INFO L290 TraceCheckUtils]: 15: Hoare triple {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:47,546 INFO L290 TraceCheckUtils]: 16: Hoare triple {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:47,546 INFO L290 TraceCheckUtils]: 17: Hoare triple {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:47,546 INFO L290 TraceCheckUtils]: 18: Hoare triple {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p1~0#1); {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:47,547 INFO L290 TraceCheckUtils]: 19: Hoare triple {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p2~0#1); {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:47,547 INFO L290 TraceCheckUtils]: 20: Hoare triple {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p3~0#1); {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:47,547 INFO L290 TraceCheckUtils]: 21: Hoare triple {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p4~0#1); {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:47,548 INFO L290 TraceCheckUtils]: 22: Hoare triple {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p5~0#1); {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:47,548 INFO L290 TraceCheckUtils]: 23: Hoare triple {55739#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p6~0#1); {55738#false} is VALID [2022-02-20 14:39:47,548 INFO L290 TraceCheckUtils]: 24: Hoare triple {55738#false} assume 0 != main_~p7~0#1; {55738#false} is VALID [2022-02-20 14:39:47,548 INFO L290 TraceCheckUtils]: 25: Hoare triple {55738#false} assume 1 != main_~lk7~0#1; {55738#false} is VALID [2022-02-20 14:39:47,548 INFO L290 TraceCheckUtils]: 26: Hoare triple {55738#false} assume !false; {55738#false} is VALID [2022-02-20 14:39:47,549 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:47,549 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:47,549 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729294845] [2022-02-20 14:39:47,549 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729294845] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:47,549 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:47,549 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:47,549 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [310273591] [2022-02-20 14:39:47,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:47,550 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 14:39:47,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:47,550 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:47,567 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:47,567 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:47,567 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:47,568 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:47,568 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:47,568 INFO L87 Difference]: Start difference. First operand 2661 states and 4355 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:48,083 INFO L93 Difference]: Finished difference Result 3993 states and 6517 transitions. [2022-02-20 14:39:48,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:48,083 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 14:39:48,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:48,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2022-02-20 14:39:48,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 240 transitions. [2022-02-20 14:39:48,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 240 transitions. [2022-02-20 14:39:48,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:48,405 INFO L225 Difference]: With dead ends: 3993 [2022-02-20 14:39:48,405 INFO L226 Difference]: Without dead ends: 2695 [2022-02-20 14:39:48,406 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-02-20 14:39:48,407 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 65 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:48,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [65 Valid, 204 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:48,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2695 states. [2022-02-20 14:39:48,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2695 to 2693. [2022-02-20 14:39:48,436 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:48,439 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2695 states. Second operand has 2693 states, 2692 states have (on average 1.6177563150074294) internal successors, (4355), 2692 states have internal predecessors, (4355), 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-02-20 14:39:48,440 INFO L74 IsIncluded]: Start isIncluded. First operand 2695 states. Second operand has 2693 states, 2692 states have (on average 1.6177563150074294) internal successors, (4355), 2692 states have internal predecessors, (4355), 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-02-20 14:39:48,442 INFO L87 Difference]: Start difference. First operand 2695 states. Second operand has 2693 states, 2692 states have (on average 1.6177563150074294) internal successors, (4355), 2692 states have internal predecessors, (4355), 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-02-20 14:39:48,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:48,610 INFO L93 Difference]: Finished difference Result 2695 states and 4356 transitions. [2022-02-20 14:39:48,611 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 4356 transitions. [2022-02-20 14:39:48,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:48,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:48,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 2693 states, 2692 states have (on average 1.6177563150074294) internal successors, (4355), 2692 states have internal predecessors, (4355), 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 2695 states. [2022-02-20 14:39:48,631 INFO L87 Difference]: Start difference. First operand has 2693 states, 2692 states have (on average 1.6177563150074294) internal successors, (4355), 2692 states have internal predecessors, (4355), 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 2695 states. [2022-02-20 14:39:48,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:48,809 INFO L93 Difference]: Finished difference Result 2695 states and 4356 transitions. [2022-02-20 14:39:48,810 INFO L276 IsEmpty]: Start isEmpty. Operand 2695 states and 4356 transitions. [2022-02-20 14:39:48,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:48,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:48,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:48,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:48,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2693 states, 2692 states have (on average 1.6177563150074294) internal successors, (4355), 2692 states have internal predecessors, (4355), 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-02-20 14:39:48,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2693 states to 2693 states and 4355 transitions. [2022-02-20 14:39:48,994 INFO L78 Accepts]: Start accepts. Automaton has 2693 states and 4355 transitions. Word has length 27 [2022-02-20 14:39:48,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:48,994 INFO L470 AbstractCegarLoop]: Abstraction has 2693 states and 4355 transitions. [2022-02-20 14:39:48,994 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:48,994 INFO L276 IsEmpty]: Start isEmpty. Operand 2693 states and 4355 transitions. [2022-02-20 14:39:48,995 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 14:39:48,995 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:48,995 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:48,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 14:39:48,996 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:48,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:48,996 INFO L85 PathProgramCache]: Analyzing trace with hash 2014583952, now seen corresponding path program 1 times [2022-02-20 14:39:48,996 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:48,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431510767] [2022-02-20 14:39:48,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:48,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:49,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:49,017 INFO L290 TraceCheckUtils]: 0: Hoare triple {67984#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {67984#true} is VALID [2022-02-20 14:39:49,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {67984#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {67984#true} is VALID [2022-02-20 14:39:49,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {67984#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {67984#true} is VALID [2022-02-20 14:39:49,017 INFO L290 TraceCheckUtils]: 3: Hoare triple {67984#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; {67984#true} is VALID [2022-02-20 14:39:49,017 INFO L290 TraceCheckUtils]: 4: Hoare triple {67984#true} assume !(0 != main_~p1~0#1); {67984#true} is VALID [2022-02-20 14:39:49,017 INFO L290 TraceCheckUtils]: 5: Hoare triple {67984#true} assume !(0 != main_~p2~0#1); {67984#true} is VALID [2022-02-20 14:39:49,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {67984#true} assume !(0 != main_~p3~0#1); {67984#true} is VALID [2022-02-20 14:39:49,018 INFO L290 TraceCheckUtils]: 7: Hoare triple {67984#true} assume !(0 != main_~p4~0#1); {67984#true} is VALID [2022-02-20 14:39:49,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {67984#true} assume !(0 != main_~p5~0#1); {67984#true} is VALID [2022-02-20 14:39:49,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {67984#true} assume !(0 != main_~p6~0#1); {67984#true} is VALID [2022-02-20 14:39:49,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {67984#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:49,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:49,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:49,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:49,019 INFO L290 TraceCheckUtils]: 14: Hoare triple {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p11~0#1); {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:49,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:49,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:49,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:49,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p1~0#1); {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:49,021 INFO L290 TraceCheckUtils]: 19: Hoare triple {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p2~0#1); {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:49,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p3~0#1); {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:49,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p4~0#1); {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:49,022 INFO L290 TraceCheckUtils]: 22: Hoare triple {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p5~0#1); {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:49,022 INFO L290 TraceCheckUtils]: 23: Hoare triple {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p6~0#1); {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:49,022 INFO L290 TraceCheckUtils]: 24: Hoare triple {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p7~0#1; {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:49,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {67986#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 1 != main_~lk7~0#1; {67985#false} is VALID [2022-02-20 14:39:49,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {67985#false} assume !false; {67985#false} is VALID [2022-02-20 14:39:49,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:49,023 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:49,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431510767] [2022-02-20 14:39:49,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [431510767] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:49,023 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:49,023 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:49,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381438292] [2022-02-20 14:39:49,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:49,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 14:39:49,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:49,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:49,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:49,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:49,038 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:49,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:49,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:49,039 INFO L87 Difference]: Start difference. First operand 2693 states and 4355 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:49,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:49,757 INFO L93 Difference]: Finished difference Result 4873 states and 8037 transitions. [2022-02-20 14:39:49,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:49,758 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 14:39:49,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:49,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2022-02-20 14:39:49,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:49,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 151 transitions. [2022-02-20 14:39:49,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 151 transitions. [2022-02-20 14:39:49,843 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:50,490 INFO L225 Difference]: With dead ends: 4873 [2022-02-20 14:39:50,491 INFO L226 Difference]: Without dead ends: 4871 [2022-02-20 14:39:50,491 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-02-20 14:39:50,493 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 50 mSDsluCounter, 78 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 163 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-02-20 14:39:50,494 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 163 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:50,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4871 states. [2022-02-20 14:39:50,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4871 to 3845. [2022-02-20 14:39:50,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:50,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4871 states. Second operand has 3845 states, 3844 states have (on average 1.5741415192507804) internal successors, (6051), 3844 states have internal predecessors, (6051), 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-02-20 14:39:50,540 INFO L74 IsIncluded]: Start isIncluded. First operand 4871 states. Second operand has 3845 states, 3844 states have (on average 1.5741415192507804) internal successors, (6051), 3844 states have internal predecessors, (6051), 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-02-20 14:39:50,542 INFO L87 Difference]: Start difference. First operand 4871 states. Second operand has 3845 states, 3844 states have (on average 1.5741415192507804) internal successors, (6051), 3844 states have internal predecessors, (6051), 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-02-20 14:39:51,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:51,144 INFO L93 Difference]: Finished difference Result 4871 states and 7972 transitions. [2022-02-20 14:39:51,144 INFO L276 IsEmpty]: Start isEmpty. Operand 4871 states and 7972 transitions. [2022-02-20 14:39:51,148 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:51,148 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:51,152 INFO L74 IsIncluded]: Start isIncluded. First operand has 3845 states, 3844 states have (on average 1.5741415192507804) internal successors, (6051), 3844 states have internal predecessors, (6051), 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 4871 states. [2022-02-20 14:39:51,154 INFO L87 Difference]: Start difference. First operand has 3845 states, 3844 states have (on average 1.5741415192507804) internal successors, (6051), 3844 states have internal predecessors, (6051), 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 4871 states. [2022-02-20 14:39:51,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:51,762 INFO L93 Difference]: Finished difference Result 4871 states and 7972 transitions. [2022-02-20 14:39:51,762 INFO L276 IsEmpty]: Start isEmpty. Operand 4871 states and 7972 transitions. [2022-02-20 14:39:51,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:51,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:51,767 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:51,767 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:51,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3845 states, 3844 states have (on average 1.5741415192507804) internal successors, (6051), 3844 states have internal predecessors, (6051), 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-02-20 14:39:52,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3845 states to 3845 states and 6051 transitions. [2022-02-20 14:39:52,216 INFO L78 Accepts]: Start accepts. Automaton has 3845 states and 6051 transitions. Word has length 27 [2022-02-20 14:39:52,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:52,217 INFO L470 AbstractCegarLoop]: Abstraction has 3845 states and 6051 transitions. [2022-02-20 14:39:52,217 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:52,217 INFO L276 IsEmpty]: Start isEmpty. Operand 3845 states and 6051 transitions. [2022-02-20 14:39:52,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 14:39:52,219 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:52,219 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:52,219 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 14:39:52,220 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:52,221 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:52,221 INFO L85 PathProgramCache]: Analyzing trace with hash 426236050, now seen corresponding path program 1 times [2022-02-20 14:39:52,221 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:52,221 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1680465919] [2022-02-20 14:39:52,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:52,222 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:52,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:52,300 INFO L290 TraceCheckUtils]: 0: Hoare triple {86647#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {86647#true} is VALID [2022-02-20 14:39:52,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {86647#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {86647#true} is VALID [2022-02-20 14:39:52,301 INFO L290 TraceCheckUtils]: 2: Hoare triple {86647#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {86647#true} is VALID [2022-02-20 14:39:52,301 INFO L290 TraceCheckUtils]: 3: Hoare triple {86647#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; {86647#true} is VALID [2022-02-20 14:39:52,301 INFO L290 TraceCheckUtils]: 4: Hoare triple {86647#true} assume !(0 != main_~p1~0#1); {86647#true} is VALID [2022-02-20 14:39:52,301 INFO L290 TraceCheckUtils]: 5: Hoare triple {86647#true} assume !(0 != main_~p2~0#1); {86647#true} is VALID [2022-02-20 14:39:52,301 INFO L290 TraceCheckUtils]: 6: Hoare triple {86647#true} assume !(0 != main_~p3~0#1); {86647#true} is VALID [2022-02-20 14:39:52,301 INFO L290 TraceCheckUtils]: 7: Hoare triple {86647#true} assume !(0 != main_~p4~0#1); {86647#true} is VALID [2022-02-20 14:39:52,302 INFO L290 TraceCheckUtils]: 8: Hoare triple {86647#true} assume !(0 != main_~p5~0#1); {86647#true} is VALID [2022-02-20 14:39:52,302 INFO L290 TraceCheckUtils]: 9: Hoare triple {86647#true} assume !(0 != main_~p6~0#1); {86647#true} is VALID [2022-02-20 14:39:52,315 INFO L290 TraceCheckUtils]: 10: Hoare triple {86647#true} assume !(0 != main_~p7~0#1); {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:52,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:52,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:52,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:52,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p11~0#1); {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:52,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:52,317 INFO L290 TraceCheckUtils]: 16: Hoare triple {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:52,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:52,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p1~0#1); {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:52,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p2~0#1); {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:52,318 INFO L290 TraceCheckUtils]: 20: Hoare triple {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p3~0#1); {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:52,319 INFO L290 TraceCheckUtils]: 21: Hoare triple {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p4~0#1); {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:52,319 INFO L290 TraceCheckUtils]: 22: Hoare triple {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p5~0#1); {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:52,319 INFO L290 TraceCheckUtils]: 23: Hoare triple {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p6~0#1); {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:52,319 INFO L290 TraceCheckUtils]: 24: Hoare triple {86649#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p7~0#1; {86648#false} is VALID [2022-02-20 14:39:52,319 INFO L290 TraceCheckUtils]: 25: Hoare triple {86648#false} assume 1 != main_~lk7~0#1; {86648#false} is VALID [2022-02-20 14:39:52,320 INFO L290 TraceCheckUtils]: 26: Hoare triple {86648#false} assume !false; {86648#false} is VALID [2022-02-20 14:39:52,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:52,320 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:52,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1680465919] [2022-02-20 14:39:52,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1680465919] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:52,320 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:52,320 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:52,320 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789373490] [2022-02-20 14:39:52,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:52,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 14:39:52,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:52,322 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:52,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:52,336 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:52,336 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:52,336 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:52,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:52,337 INFO L87 Difference]: Start difference. First operand 3845 states and 6051 transitions. Second operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:54,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:54,666 INFO L93 Difference]: Finished difference Result 9033 states and 14309 transitions. [2022-02-20 14:39:54,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:54,666 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 14:39:54,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:54,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:54,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2022-02-20 14:39:54,668 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:54,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 242 transitions. [2022-02-20 14:39:54,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 242 transitions. [2022-02-20 14:39:54,799 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 242 edges. 242 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:55,530 INFO L225 Difference]: With dead ends: 9033 [2022-02-20 14:39:55,530 INFO L226 Difference]: Without dead ends: 5255 [2022-02-20 14:39:55,532 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-02-20 14:39:55,532 INFO L933 BasicCegarLoop]: 128 mSDtfsCounter, 62 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 205 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:55,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 205 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:55,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5255 states. [2022-02-20 14:39:55,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5255 to 5253. [2022-02-20 14:39:55,635 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:55,641 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5255 states. Second operand has 5253 states, 5252 states have (on average 1.5725437928408226) internal successors, (8259), 5252 states have internal predecessors, (8259), 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-02-20 14:39:55,661 INFO L74 IsIncluded]: Start isIncluded. First operand 5255 states. Second operand has 5253 states, 5252 states have (on average 1.5725437928408226) internal successors, (8259), 5252 states have internal predecessors, (8259), 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-02-20 14:39:55,667 INFO L87 Difference]: Start difference. First operand 5255 states. Second operand has 5253 states, 5252 states have (on average 1.5725437928408226) internal successors, (8259), 5252 states have internal predecessors, (8259), 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-02-20 14:39:56,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:56,409 INFO L93 Difference]: Finished difference Result 5255 states and 8260 transitions. [2022-02-20 14:39:56,409 INFO L276 IsEmpty]: Start isEmpty. Operand 5255 states and 8260 transitions. [2022-02-20 14:39:56,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:56,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:56,420 INFO L74 IsIncluded]: Start isIncluded. First operand has 5253 states, 5252 states have (on average 1.5725437928408226) internal successors, (8259), 5252 states have internal predecessors, (8259), 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 5255 states. [2022-02-20 14:39:56,426 INFO L87 Difference]: Start difference. First operand has 5253 states, 5252 states have (on average 1.5725437928408226) internal successors, (8259), 5252 states have internal predecessors, (8259), 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 5255 states. [2022-02-20 14:39:57,142 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,142 INFO L93 Difference]: Finished difference Result 5255 states and 8260 transitions. [2022-02-20 14:39:57,142 INFO L276 IsEmpty]: Start isEmpty. Operand 5255 states and 8260 transitions. [2022-02-20 14:39:57,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:57,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:57,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:57,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:57,198 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5253 states, 5252 states have (on average 1.5725437928408226) internal successors, (8259), 5252 states have internal predecessors, (8259), 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-02-20 14:39:57,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5253 states to 5253 states and 8259 transitions. [2022-02-20 14:39:57,938 INFO L78 Accepts]: Start accepts. Automaton has 5253 states and 8259 transitions. Word has length 27 [2022-02-20 14:39:57,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:57,939 INFO L470 AbstractCegarLoop]: Abstraction has 5253 states and 8259 transitions. [2022-02-20 14:39:57,939 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.0) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:57,939 INFO L276 IsEmpty]: Start isEmpty. Operand 5253 states and 8259 transitions. [2022-02-20 14:39:57,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 14:39:57,941 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:57,941 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:57,941 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-20 14:39:57,941 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:57,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:57,942 INFO L85 PathProgramCache]: Analyzing trace with hash -1972192830, now seen corresponding path program 1 times [2022-02-20 14:39:57,942 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:57,942 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [199355687] [2022-02-20 14:39:57,942 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:57,942 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:57,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:57,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {111774#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {111774#true} is VALID [2022-02-20 14:39:57,962 INFO L290 TraceCheckUtils]: 1: Hoare triple {111774#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {111774#true} is VALID [2022-02-20 14:39:57,962 INFO L290 TraceCheckUtils]: 2: Hoare triple {111774#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {111774#true} is VALID [2022-02-20 14:39:57,962 INFO L290 TraceCheckUtils]: 3: Hoare triple {111774#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; {111774#true} is VALID [2022-02-20 14:39:57,962 INFO L290 TraceCheckUtils]: 4: Hoare triple {111774#true} assume !(0 != main_~p1~0#1); {111774#true} is VALID [2022-02-20 14:39:57,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {111774#true} assume !(0 != main_~p2~0#1); {111774#true} is VALID [2022-02-20 14:39:57,963 INFO L290 TraceCheckUtils]: 6: Hoare triple {111774#true} assume !(0 != main_~p3~0#1); {111774#true} is VALID [2022-02-20 14:39:57,963 INFO L290 TraceCheckUtils]: 7: Hoare triple {111774#true} assume !(0 != main_~p4~0#1); {111774#true} is VALID [2022-02-20 14:39:57,963 INFO L290 TraceCheckUtils]: 8: Hoare triple {111774#true} assume !(0 != main_~p5~0#1); {111774#true} is VALID [2022-02-20 14:39:57,963 INFO L290 TraceCheckUtils]: 9: Hoare triple {111774#true} assume !(0 != main_~p6~0#1); {111774#true} is VALID [2022-02-20 14:39:57,963 INFO L290 TraceCheckUtils]: 10: Hoare triple {111774#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:57,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:57,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:57,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:57,964 INFO L290 TraceCheckUtils]: 14: Hoare triple {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p11~0#1); {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:57,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:57,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:57,965 INFO L290 TraceCheckUtils]: 17: Hoare triple {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:57,965 INFO L290 TraceCheckUtils]: 18: Hoare triple {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p1~0#1); {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:57,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p2~0#1); {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:57,966 INFO L290 TraceCheckUtils]: 20: Hoare triple {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p3~0#1); {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:57,966 INFO L290 TraceCheckUtils]: 21: Hoare triple {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p4~0#1); {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:57,966 INFO L290 TraceCheckUtils]: 22: Hoare triple {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p5~0#1); {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:57,967 INFO L290 TraceCheckUtils]: 23: Hoare triple {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p6~0#1); {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:57,967 INFO L290 TraceCheckUtils]: 24: Hoare triple {111776#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p7~0#1); {111775#false} is VALID [2022-02-20 14:39:57,967 INFO L290 TraceCheckUtils]: 25: Hoare triple {111775#false} assume 0 != main_~p8~0#1; {111775#false} is VALID [2022-02-20 14:39:57,967 INFO L290 TraceCheckUtils]: 26: Hoare triple {111775#false} assume 1 != main_~lk8~0#1; {111775#false} is VALID [2022-02-20 14:39:57,967 INFO L290 TraceCheckUtils]: 27: Hoare triple {111775#false} assume !false; {111775#false} is VALID [2022-02-20 14:39:57,968 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:57,968 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:57,968 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [199355687] [2022-02-20 14:39:57,968 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [199355687] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:57,968 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:57,968 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:57,968 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1026652902] [2022-02-20 14:39:57,968 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:57,969 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 14:39:57,969 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:57,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:57,983 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:57,983 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:57,984 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:57,984 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:57,984 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:57,984 INFO L87 Difference]: Start difference. First operand 5253 states and 8259 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:59,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:59,821 INFO L93 Difference]: Finished difference Result 7881 states and 12357 transitions. [2022-02-20 14:39:59,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:59,822 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 14:39:59,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:59,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:59,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2022-02-20 14:39:59,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:59,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 237 transitions. [2022-02-20 14:39:59,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 237 transitions. [2022-02-20 14:39:59,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 237 edges. 237 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:00,695 INFO L225 Difference]: With dead ends: 7881 [2022-02-20 14:40:00,695 INFO L226 Difference]: Without dead ends: 5319 [2022-02-20 14:40:00,696 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-02-20 14:40:00,697 INFO L933 BasicCegarLoop]: 124 mSDtfsCounter, 64 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 200 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:40:00,697 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 200 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:40:00,699 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5319 states. [2022-02-20 14:40:00,741 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5319 to 5317. [2022-02-20 14:40:00,741 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:00,746 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5319 states. Second operand has 5317 states, 5316 states have (on average 1.5536117381489842) internal successors, (8259), 5316 states have internal predecessors, (8259), 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-02-20 14:40:00,749 INFO L74 IsIncluded]: Start isIncluded. First operand 5319 states. Second operand has 5317 states, 5316 states have (on average 1.5536117381489842) internal successors, (8259), 5316 states have internal predecessors, (8259), 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-02-20 14:40:00,752 INFO L87 Difference]: Start difference. First operand 5319 states. Second operand has 5317 states, 5316 states have (on average 1.5536117381489842) internal successors, (8259), 5316 states have internal predecessors, (8259), 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-02-20 14:40:01,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:01,433 INFO L93 Difference]: Finished difference Result 5319 states and 8260 transitions. [2022-02-20 14:40:01,434 INFO L276 IsEmpty]: Start isEmpty. Operand 5319 states and 8260 transitions. [2022-02-20 14:40:01,436 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:01,437 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:01,441 INFO L74 IsIncluded]: Start isIncluded. First operand has 5317 states, 5316 states have (on average 1.5536117381489842) internal successors, (8259), 5316 states have internal predecessors, (8259), 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 5319 states. [2022-02-20 14:40:01,444 INFO L87 Difference]: Start difference. First operand has 5317 states, 5316 states have (on average 1.5536117381489842) internal successors, (8259), 5316 states have internal predecessors, (8259), 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 5319 states. [2022-02-20 14:40:02,165 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:02,165 INFO L93 Difference]: Finished difference Result 5319 states and 8260 transitions. [2022-02-20 14:40:02,166 INFO L276 IsEmpty]: Start isEmpty. Operand 5319 states and 8260 transitions. [2022-02-20 14:40:02,169 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:02,169 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:02,169 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:02,169 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:02,173 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5317 states, 5316 states have (on average 1.5536117381489842) internal successors, (8259), 5316 states have internal predecessors, (8259), 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-02-20 14:40:02,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5317 states to 5317 states and 8259 transitions. [2022-02-20 14:40:02,919 INFO L78 Accepts]: Start accepts. Automaton has 5317 states and 8259 transitions. Word has length 28 [2022-02-20 14:40:02,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:02,919 INFO L470 AbstractCegarLoop]: Abstraction has 5317 states and 8259 transitions. [2022-02-20 14:40:02,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:02,920 INFO L276 IsEmpty]: Start isEmpty. Operand 5317 states and 8259 transitions. [2022-02-20 14:40:02,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 14:40:02,921 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:02,921 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:40:02,922 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-20 14:40:02,922 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:02,922 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:02,922 INFO L85 PathProgramCache]: Analyzing trace with hash 328629760, now seen corresponding path program 1 times [2022-02-20 14:40:02,922 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:02,922 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925370548] [2022-02-20 14:40:02,923 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:02,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:02,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:02,945 INFO L290 TraceCheckUtils]: 0: Hoare triple {135941#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {135941#true} is VALID [2022-02-20 14:40:02,945 INFO L290 TraceCheckUtils]: 1: Hoare triple {135941#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {135941#true} is VALID [2022-02-20 14:40:02,945 INFO L290 TraceCheckUtils]: 2: Hoare triple {135941#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {135941#true} is VALID [2022-02-20 14:40:02,945 INFO L290 TraceCheckUtils]: 3: Hoare triple {135941#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; {135941#true} is VALID [2022-02-20 14:40:02,945 INFO L290 TraceCheckUtils]: 4: Hoare triple {135941#true} assume !(0 != main_~p1~0#1); {135941#true} is VALID [2022-02-20 14:40:02,945 INFO L290 TraceCheckUtils]: 5: Hoare triple {135941#true} assume !(0 != main_~p2~0#1); {135941#true} is VALID [2022-02-20 14:40:02,945 INFO L290 TraceCheckUtils]: 6: Hoare triple {135941#true} assume !(0 != main_~p3~0#1); {135941#true} is VALID [2022-02-20 14:40:02,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {135941#true} assume !(0 != main_~p4~0#1); {135941#true} is VALID [2022-02-20 14:40:02,946 INFO L290 TraceCheckUtils]: 8: Hoare triple {135941#true} assume !(0 != main_~p5~0#1); {135941#true} is VALID [2022-02-20 14:40:02,946 INFO L290 TraceCheckUtils]: 9: Hoare triple {135941#true} assume !(0 != main_~p6~0#1); {135941#true} is VALID [2022-02-20 14:40:02,946 INFO L290 TraceCheckUtils]: 10: Hoare triple {135941#true} assume !(0 != main_~p7~0#1); {135941#true} is VALID [2022-02-20 14:40:02,946 INFO L290 TraceCheckUtils]: 11: Hoare triple {135941#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:02,946 INFO L290 TraceCheckUtils]: 12: Hoare triple {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:02,947 INFO L290 TraceCheckUtils]: 13: Hoare triple {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:02,947 INFO L290 TraceCheckUtils]: 14: Hoare triple {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p11~0#1); {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:02,947 INFO L290 TraceCheckUtils]: 15: Hoare triple {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:02,948 INFO L290 TraceCheckUtils]: 16: Hoare triple {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:02,948 INFO L290 TraceCheckUtils]: 17: Hoare triple {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:02,948 INFO L290 TraceCheckUtils]: 18: Hoare triple {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p1~0#1); {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:02,948 INFO L290 TraceCheckUtils]: 19: Hoare triple {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p2~0#1); {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:02,949 INFO L290 TraceCheckUtils]: 20: Hoare triple {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p3~0#1); {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:02,949 INFO L290 TraceCheckUtils]: 21: Hoare triple {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p4~0#1); {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:02,949 INFO L290 TraceCheckUtils]: 22: Hoare triple {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p5~0#1); {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:02,950 INFO L290 TraceCheckUtils]: 23: Hoare triple {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p6~0#1); {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:02,950 INFO L290 TraceCheckUtils]: 24: Hoare triple {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p7~0#1); {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:02,950 INFO L290 TraceCheckUtils]: 25: Hoare triple {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p8~0#1; {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:02,950 INFO L290 TraceCheckUtils]: 26: Hoare triple {135943#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 1 != main_~lk8~0#1; {135942#false} is VALID [2022-02-20 14:40:02,951 INFO L290 TraceCheckUtils]: 27: Hoare triple {135942#false} assume !false; {135942#false} is VALID [2022-02-20 14:40:02,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:40:02,951 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:02,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925370548] [2022-02-20 14:40:02,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925370548] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:02,951 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:02,951 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:02,951 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277155681] [2022-02-20 14:40:02,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:02,952 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 14:40:02,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:02,952 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:02,966 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:02,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:02,966 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:02,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:02,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:02,967 INFO L87 Difference]: Start difference. First operand 5317 states and 8259 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:05,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:05,368 INFO L93 Difference]: Finished difference Result 9481 states and 15045 transitions. [2022-02-20 14:40:05,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:05,368 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 14:40:05,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:05,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:05,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2022-02-20 14:40:05,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:05,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2022-02-20 14:40:05,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2022-02-20 14:40:05,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:07,688 INFO L225 Difference]: With dead ends: 9481 [2022-02-20 14:40:07,689 INFO L226 Difference]: Without dead ends: 9479 [2022-02-20 14:40:07,690 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-02-20 14:40:07,690 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 47 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 161 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-02-20 14:40:07,690 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 161 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:40:07,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9479 states. [2022-02-20 14:40:07,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9479 to 7685. [2022-02-20 14:40:07,753 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:07,759 INFO L82 GeneralOperation]: Start isEquivalent. First operand 9479 states. Second operand has 7685 states, 7684 states have (on average 1.5079385736595523) internal successors, (11587), 7684 states have internal predecessors, (11587), 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-02-20 14:40:07,763 INFO L74 IsIncluded]: Start isIncluded. First operand 9479 states. Second operand has 7685 states, 7684 states have (on average 1.5079385736595523) internal successors, (11587), 7684 states have internal predecessors, (11587), 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-02-20 14:40:07,767 INFO L87 Difference]: Start difference. First operand 9479 states. Second operand has 7685 states, 7684 states have (on average 1.5079385736595523) internal successors, (11587), 7684 states have internal predecessors, (11587), 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-02-20 14:40:10,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:10,063 INFO L93 Difference]: Finished difference Result 9479 states and 14916 transitions. [2022-02-20 14:40:10,063 INFO L276 IsEmpty]: Start isEmpty. Operand 9479 states and 14916 transitions. [2022-02-20 14:40:10,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:10,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:10,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 7685 states, 7684 states have (on average 1.5079385736595523) internal successors, (11587), 7684 states have internal predecessors, (11587), 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 9479 states. [2022-02-20 14:40:10,080 INFO L87 Difference]: Start difference. First operand has 7685 states, 7684 states have (on average 1.5079385736595523) internal successors, (11587), 7684 states have internal predecessors, (11587), 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 9479 states. [2022-02-20 14:40:12,542 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:12,542 INFO L93 Difference]: Finished difference Result 9479 states and 14916 transitions. [2022-02-20 14:40:12,542 INFO L276 IsEmpty]: Start isEmpty. Operand 9479 states and 14916 transitions. [2022-02-20 14:40:12,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:12,549 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:12,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:12,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:12,555 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7685 states, 7684 states have (on average 1.5079385736595523) internal successors, (11587), 7684 states have internal predecessors, (11587), 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-02-20 14:40:14,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7685 states to 7685 states and 11587 transitions. [2022-02-20 14:40:14,204 INFO L78 Accepts]: Start accepts. Automaton has 7685 states and 11587 transitions. Word has length 28 [2022-02-20 14:40:14,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:14,204 INFO L470 AbstractCegarLoop]: Abstraction has 7685 states and 11587 transitions. [2022-02-20 14:40:14,205 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:14,205 INFO L276 IsEmpty]: Start isEmpty. Operand 7685 states and 11587 transitions. [2022-02-20 14:40:14,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 14:40:14,209 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:14,209 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:40:14,209 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-20 14:40:14,209 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:14,210 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:14,210 INFO L85 PathProgramCache]: Analyzing trace with hash -1259718142, now seen corresponding path program 1 times [2022-02-20 14:40:14,210 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:14,210 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352391336] [2022-02-20 14:40:14,210 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:14,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:14,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:14,232 INFO L290 TraceCheckUtils]: 0: Hoare triple {172460#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {172460#true} is VALID [2022-02-20 14:40:14,232 INFO L290 TraceCheckUtils]: 1: Hoare triple {172460#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {172460#true} is VALID [2022-02-20 14:40:14,232 INFO L290 TraceCheckUtils]: 2: Hoare triple {172460#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {172460#true} is VALID [2022-02-20 14:40:14,232 INFO L290 TraceCheckUtils]: 3: Hoare triple {172460#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; {172460#true} is VALID [2022-02-20 14:40:14,232 INFO L290 TraceCheckUtils]: 4: Hoare triple {172460#true} assume !(0 != main_~p1~0#1); {172460#true} is VALID [2022-02-20 14:40:14,232 INFO L290 TraceCheckUtils]: 5: Hoare triple {172460#true} assume !(0 != main_~p2~0#1); {172460#true} is VALID [2022-02-20 14:40:14,233 INFO L290 TraceCheckUtils]: 6: Hoare triple {172460#true} assume !(0 != main_~p3~0#1); {172460#true} is VALID [2022-02-20 14:40:14,233 INFO L290 TraceCheckUtils]: 7: Hoare triple {172460#true} assume !(0 != main_~p4~0#1); {172460#true} is VALID [2022-02-20 14:40:14,233 INFO L290 TraceCheckUtils]: 8: Hoare triple {172460#true} assume !(0 != main_~p5~0#1); {172460#true} is VALID [2022-02-20 14:40:14,233 INFO L290 TraceCheckUtils]: 9: Hoare triple {172460#true} assume !(0 != main_~p6~0#1); {172460#true} is VALID [2022-02-20 14:40:14,233 INFO L290 TraceCheckUtils]: 10: Hoare triple {172460#true} assume !(0 != main_~p7~0#1); {172460#true} is VALID [2022-02-20 14:40:14,234 INFO L290 TraceCheckUtils]: 11: Hoare triple {172460#true} assume !(0 != main_~p8~0#1); {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:14,234 INFO L290 TraceCheckUtils]: 12: Hoare triple {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:14,234 INFO L290 TraceCheckUtils]: 13: Hoare triple {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:14,234 INFO L290 TraceCheckUtils]: 14: Hoare triple {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p11~0#1); {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:14,235 INFO L290 TraceCheckUtils]: 15: Hoare triple {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:14,235 INFO L290 TraceCheckUtils]: 16: Hoare triple {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:14,235 INFO L290 TraceCheckUtils]: 17: Hoare triple {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:14,236 INFO L290 TraceCheckUtils]: 18: Hoare triple {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p1~0#1); {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:14,236 INFO L290 TraceCheckUtils]: 19: Hoare triple {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p2~0#1); {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:14,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p3~0#1); {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:14,237 INFO L290 TraceCheckUtils]: 21: Hoare triple {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p4~0#1); {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:14,237 INFO L290 TraceCheckUtils]: 22: Hoare triple {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p5~0#1); {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:14,237 INFO L290 TraceCheckUtils]: 23: Hoare triple {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p6~0#1); {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:14,237 INFO L290 TraceCheckUtils]: 24: Hoare triple {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p7~0#1); {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:14,238 INFO L290 TraceCheckUtils]: 25: Hoare triple {172462#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p8~0#1; {172461#false} is VALID [2022-02-20 14:40:14,238 INFO L290 TraceCheckUtils]: 26: Hoare triple {172461#false} assume 1 != main_~lk8~0#1; {172461#false} is VALID [2022-02-20 14:40:14,238 INFO L290 TraceCheckUtils]: 27: Hoare triple {172461#false} assume !false; {172461#false} is VALID [2022-02-20 14:40:14,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:40:14,238 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:14,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352391336] [2022-02-20 14:40:14,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352391336] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:14,239 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:14,239 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:14,239 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [818240892] [2022-02-20 14:40:14,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:14,240 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 14:40:14,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:14,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:14,255 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:14,255 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:14,255 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:14,255 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:14,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:14,256 INFO L87 Difference]: Start difference. First operand 7685 states and 11587 transitions. Second operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:23,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:23,036 INFO L93 Difference]: Finished difference Result 17929 states and 27205 transitions. [2022-02-20 14:40:23,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:23,037 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 14:40:23,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:23,037 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:23,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 239 transitions. [2022-02-20 14:40:23,038 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:23,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 239 transitions. [2022-02-20 14:40:23,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 239 transitions. [2022-02-20 14:40:23,168 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 239 edges. 239 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:26,051 INFO L225 Difference]: With dead ends: 17929 [2022-02-20 14:40:26,051 INFO L226 Difference]: Without dead ends: 10375 [2022-02-20 14:40:26,056 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-02-20 14:40:26,057 INFO L933 BasicCegarLoop]: 130 mSDtfsCounter, 61 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:40:26,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [61 Valid, 206 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:40:26,062 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10375 states. [2022-02-20 14:40:26,178 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10375 to 10373. [2022-02-20 14:40:26,178 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:26,191 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10375 states. Second operand has 10373 states, 10372 states have (on average 1.5058812186656383) internal successors, (15619), 10372 states have internal predecessors, (15619), 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-02-20 14:40:26,203 INFO L74 IsIncluded]: Start isIncluded. First operand 10375 states. Second operand has 10373 states, 10372 states have (on average 1.5058812186656383) internal successors, (15619), 10372 states have internal predecessors, (15619), 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-02-20 14:40:26,216 INFO L87 Difference]: Start difference. First operand 10375 states. Second operand has 10373 states, 10372 states have (on average 1.5058812186656383) internal successors, (15619), 10372 states have internal predecessors, (15619), 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-02-20 14:40:28,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:28,976 INFO L93 Difference]: Finished difference Result 10375 states and 15620 transitions. [2022-02-20 14:40:28,976 INFO L276 IsEmpty]: Start isEmpty. Operand 10375 states and 15620 transitions. [2022-02-20 14:40:28,983 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:28,984 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:28,996 INFO L74 IsIncluded]: Start isIncluded. First operand has 10373 states, 10372 states have (on average 1.5058812186656383) internal successors, (15619), 10372 states have internal predecessors, (15619), 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 10375 states. [2022-02-20 14:40:29,010 INFO L87 Difference]: Start difference. First operand has 10373 states, 10372 states have (on average 1.5058812186656383) internal successors, (15619), 10372 states have internal predecessors, (15619), 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 10375 states. [2022-02-20 14:40:32,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:32,638 INFO L93 Difference]: Finished difference Result 10375 states and 15620 transitions. [2022-02-20 14:40:32,638 INFO L276 IsEmpty]: Start isEmpty. Operand 10375 states and 15620 transitions. [2022-02-20 14:40:32,645 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:32,646 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:32,646 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:32,646 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:32,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10373 states, 10372 states have (on average 1.5058812186656383) internal successors, (15619), 10372 states have internal predecessors, (15619), 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-02-20 14:40:36,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10373 states to 10373 states and 15619 transitions. [2022-02-20 14:40:36,929 INFO L78 Accepts]: Start accepts. Automaton has 10373 states and 15619 transitions. Word has length 28 [2022-02-20 14:40:36,930 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:36,930 INFO L470 AbstractCegarLoop]: Abstraction has 10373 states and 15619 transitions. [2022-02-20 14:40:36,930 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 9.333333333333334) internal successors, (28), 3 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:36,930 INFO L276 IsEmpty]: Start isEmpty. Operand 10373 states and 15619 transitions. [2022-02-20 14:40:36,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 14:40:36,934 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:36,934 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:40:36,935 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-20 14:40:36,935 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:36,935 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:36,935 INFO L85 PathProgramCache]: Analyzing trace with hash 1597802407, now seen corresponding path program 1 times [2022-02-20 14:40:36,935 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:36,936 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594008621] [2022-02-20 14:40:36,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:36,936 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:36,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:36,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {222163#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3); {222163#true} is VALID [2022-02-20 14:40:36,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {222163#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_#t~nondet16#1, main_#t~nondet17#1, main_#t~nondet18#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~p12~0#1, main_~lk12~0#1, main_~p13~0#1, main_~lk13~0#1, main_~p14~0#1, main_~lk14~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~p12~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1;havoc main_~lk12~0#1;assume -2147483648 <= main_#t~nondet16#1 && main_#t~nondet16#1 <= 2147483647;main_~p13~0#1 := main_#t~nondet16#1;havoc main_#t~nondet16#1;havoc main_~lk13~0#1;assume -2147483648 <= main_#t~nondet17#1 && main_#t~nondet17#1 <= 2147483647;main_~p14~0#1 := main_#t~nondet17#1;havoc main_#t~nondet17#1;havoc main_~lk14~0#1;havoc main_~cond~0#1; {222163#true} is VALID [2022-02-20 14:40:36,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {222163#true} assume !false;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet18#1;havoc main_#t~nondet18#1; {222163#true} is VALID [2022-02-20 14:40:36,989 INFO L290 TraceCheckUtils]: 3: Hoare triple {222163#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0;main_~lk12~0#1 := 0;main_~lk13~0#1 := 0;main_~lk14~0#1 := 0; {222163#true} is VALID [2022-02-20 14:40:36,989 INFO L290 TraceCheckUtils]: 4: Hoare triple {222163#true} assume !(0 != main_~p1~0#1); {222163#true} is VALID [2022-02-20 14:40:36,989 INFO L290 TraceCheckUtils]: 5: Hoare triple {222163#true} assume !(0 != main_~p2~0#1); {222163#true} is VALID [2022-02-20 14:40:36,989 INFO L290 TraceCheckUtils]: 6: Hoare triple {222163#true} assume !(0 != main_~p3~0#1); {222163#true} is VALID [2022-02-20 14:40:36,989 INFO L290 TraceCheckUtils]: 7: Hoare triple {222163#true} assume !(0 != main_~p4~0#1); {222163#true} is VALID [2022-02-20 14:40:36,989 INFO L290 TraceCheckUtils]: 8: Hoare triple {222163#true} assume !(0 != main_~p5~0#1); {222163#true} is VALID [2022-02-20 14:40:36,989 INFO L290 TraceCheckUtils]: 9: Hoare triple {222163#true} assume !(0 != main_~p6~0#1); {222163#true} is VALID [2022-02-20 14:40:36,990 INFO L290 TraceCheckUtils]: 10: Hoare triple {222163#true} assume !(0 != main_~p7~0#1); {222163#true} is VALID [2022-02-20 14:40:36,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {222163#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:36,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:36,992 INFO L290 TraceCheckUtils]: 13: Hoare triple {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:36,992 INFO L290 TraceCheckUtils]: 14: Hoare triple {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p11~0#1); {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:36,992 INFO L290 TraceCheckUtils]: 15: Hoare triple {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p12~0#1;main_~lk12~0#1 := 1; {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:36,993 INFO L290 TraceCheckUtils]: 16: Hoare triple {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p13~0#1;main_~lk13~0#1 := 1; {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:36,993 INFO L290 TraceCheckUtils]: 17: Hoare triple {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p14~0#1;main_~lk14~0#1 := 1; {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:36,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p1~0#1); {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:36,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p2~0#1); {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:36,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p3~0#1); {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:36,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p4~0#1); {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:36,994 INFO L290 TraceCheckUtils]: 22: Hoare triple {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p5~0#1); {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:36,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p6~0#1); {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:36,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p7~0#1); {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:36,995 INFO L290 TraceCheckUtils]: 25: Hoare triple {222165#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p8~0#1); {222164#false} is VALID [2022-02-20 14:40:36,995 INFO L290 TraceCheckUtils]: 26: Hoare triple {222164#false} assume 0 != main_~p9~0#1; {222164#false} is VALID [2022-02-20 14:40:36,995 INFO L290 TraceCheckUtils]: 27: Hoare triple {222164#false} assume 1 != main_~lk9~0#1; {222164#false} is VALID [2022-02-20 14:40:36,995 INFO L290 TraceCheckUtils]: 28: Hoare triple {222164#false} assume !false; {222164#false} is VALID [2022-02-20 14:40:36,996 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:40:36,996 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:36,996 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594008621] [2022-02-20 14:40:36,996 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594008621] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:36,996 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:36,996 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:36,996 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083448480] [2022-02-20 14:40:36,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:36,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 14:40:36,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:36,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:37,012 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:37,012 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:37,012 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:37,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:37,013 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:37,013 INFO L87 Difference]: Start difference. First operand 10373 states and 15619 transitions. Second operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:44,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:44,159 INFO L93 Difference]: Finished difference Result 15561 states and 23365 transitions. [2022-02-20 14:40:44,159 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:44,160 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 14:40:44,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:44,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:44,161 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2022-02-20 14:40:44,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 9.666666666666666) internal successors, (29), 3 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:44,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 234 transitions. [2022-02-20 14:40:44,162 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 234 transitions. [2022-02-20 14:40:44,291 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:47,005 INFO L225 Difference]: With dead ends: 15561 [2022-02-20 14:40:47,005 INFO L226 Difference]: Without dead ends: 10503 [2022-02-20 14:40:47,008 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-02-20 14:40:47,009 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 63 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:40:47,009 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 196 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:40:47,012 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10503 states. [2022-02-20 14:40:47,116 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10503 to 10501. [2022-02-20 14:40:47,117 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:47,128 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10503 states. Second operand has 10501 states, 10500 states have (on average 1.4875238095238095) internal successors, (15619), 10500 states have internal predecessors, (15619), 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-02-20 14:40:47,140 INFO L74 IsIncluded]: Start isIncluded. First operand 10503 states. Second operand has 10501 states, 10500 states have (on average 1.4875238095238095) internal successors, (15619), 10500 states have internal predecessors, (15619), 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-02-20 14:40:47,152 INFO L87 Difference]: Start difference. First operand 10503 states. Second operand has 10501 states, 10500 states have (on average 1.4875238095238095) internal successors, (15619), 10500 states have internal predecessors, (15619), 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-02-20 14:40:49,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:49,928 INFO L93 Difference]: Finished difference Result 10503 states and 15620 transitions. [2022-02-20 14:40:49,929 INFO L276 IsEmpty]: Start isEmpty. Operand 10503 states and 15620 transitions. [2022-02-20 14:40:49,935 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:49,935 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:49,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 10501 states, 10500 states have (on average 1.4875238095238095) internal successors, (15619), 10500 states have internal predecessors, (15619), 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 10503 states. [2022-02-20 14:40:49,959 INFO L87 Difference]: Start difference. First operand has 10501 states, 10500 states have (on average 1.4875238095238095) internal successors, (15619), 10500 states have internal predecessors, (15619), 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 10503 states.