./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_11.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_11.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 dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:39:16,467 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:39:16,469 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:39:16,510 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:39:16,510 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:39:16,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:39:16,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:39:16,521 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:39:16,523 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:39:16,528 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:39:16,529 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:39:16,530 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:39:16,532 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:39:16,534 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:39:16,535 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:39:16,537 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:39:16,541 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:39:16,542 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:39:16,543 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:39:16,546 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:39:16,550 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:39:16,551 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:39:16,552 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:39:16,553 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:39:16,557 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:39:16,559 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:39:16,559 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:39:16,561 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:39:16,561 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:39:16,562 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:39:16,563 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:39:16,564 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:39:16,565 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:39:16,566 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:39:16,567 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:39:16,568 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:39:16,568 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:39:16,568 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:39:16,569 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:39:16,569 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:39:16,570 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:39:16,571 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:16,603 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:39:16,604 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:39:16,604 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:39:16,605 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:39:16,606 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:39:16,606 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:39:16,607 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:39:16,607 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:39:16,607 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:39:16,607 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:39:16,608 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:39:16,608 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:39:16,609 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:39:16,609 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:39:16,609 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:39:16,609 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:39:16,609 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:39:16,610 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:39:16,610 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:39:16,610 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:39:16,610 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:39:16,610 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:39:16,611 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:39:16,611 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:39:16,611 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:39:16,611 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:39:16,611 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:39:16,612 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:39:16,612 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:39:16,612 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:39:16,612 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:39:16,612 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:39:16,613 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:39:16,613 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 -> dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 [2022-02-20 14:39:16,847 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:39:16,871 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:39:16,873 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:39:16,874 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:39:16,875 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:39:16,876 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_11.c [2022-02-20 14:39:16,932 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/238a5acfa/b03a885c892c4e879c84f8697f42923a/FLAGdc495bd76 [2022-02-20 14:39:17,357 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:39:17,358 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c [2022-02-20 14:39:17,366 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/238a5acfa/b03a885c892c4e879c84f8697f42923a/FLAGdc495bd76 [2022-02-20 14:39:17,380 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/238a5acfa/b03a885c892c4e879c84f8697f42923a [2022-02-20 14:39:17,382 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:39:17,385 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:39:17,387 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:39:17,388 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:39:17,390 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:39:17,392 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:39:17" (1/1) ... [2022-02-20 14:39:17,392 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d026bde and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:17, skipping insertion in model container [2022-02-20 14:39:17,393 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:39:17" (1/1) ... [2022-02-20 14:39:17,399 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:39:17,415 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:39:17,594 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_11.c[4246,4259] [2022-02-20 14:39:17,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:39:17,619 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:39:17,663 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_11.c[4246,4259] [2022-02-20 14:39:17,671 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:39:17,684 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:39:17,685 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:17 WrapperNode [2022-02-20 14:39:17,685 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:39:17,686 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:39:17,686 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:39:17,687 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:39:17,693 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:17" (1/1) ... [2022-02-20 14:39:17,707 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:17" (1/1) ... [2022-02-20 14:39:17,741 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 149 [2022-02-20 14:39:17,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:39:17,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:39:17,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:39:17,743 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:39:17,750 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:17" (1/1) ... [2022-02-20 14:39:17,751 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:17" (1/1) ... [2022-02-20 14:39:17,760 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:17" (1/1) ... [2022-02-20 14:39:17,761 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:17" (1/1) ... [2022-02-20 14:39:17,768 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:17" (1/1) ... [2022-02-20 14:39:17,778 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:17" (1/1) ... [2022-02-20 14:39:17,780 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:17" (1/1) ... [2022-02-20 14:39:17,786 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:39:17,788 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:39:17,788 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:39:17,789 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:39:17,790 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:17" (1/1) ... [2022-02-20 14:39:17,796 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:39:17,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:39:17,821 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:17,830 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:17,853 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:39:17,853 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:39:17,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:39:17,854 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:39:17,903 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:39:17,904 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:39:18,246 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:39:18,252 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:39:18,252 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 14:39:18,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:39:18 BoogieIcfgContainer [2022-02-20 14:39:18,254 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:39:18,256 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:39:18,256 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:39:18,259 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:39:18,259 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:39:17" (1/3) ... [2022-02-20 14:39:18,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a79c69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:39:18, skipping insertion in model container [2022-02-20 14:39:18,260 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:17" (2/3) ... [2022-02-20 14:39:18,260 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@21a79c69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:39:18, skipping insertion in model container [2022-02-20 14:39:18,261 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:39:18" (3/3) ... [2022-02-20 14:39:18,262 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2022-02-20 14:39:18,267 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:39:18,267 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:39:18,354 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:39:18,365 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:18,365 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:39:18,386 INFO L276 IsEmpty]: Start isEmpty. Operand has 43 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 0 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:18,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:39:18,391 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:18,392 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:18,393 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:18,399 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:18,399 INFO L85 PathProgramCache]: Analyzing trace with hash 458919617, now seen corresponding path program 1 times [2022-02-20 14:39:18,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:18,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310510507] [2022-02-20 14:39:18,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:18,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:18,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:18,616 INFO L290 TraceCheckUtils]: 0: Hoare triple {46#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(16, 2);call #Ultimate.allocInit(12, 3); {46#true} is VALID [2022-02-20 14:39:18,618 INFO L290 TraceCheckUtils]: 1: Hoare triple {46#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_~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_~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;havoc main_~cond~0#1; {46#true} is VALID [2022-02-20 14:39:18,618 INFO L290 TraceCheckUtils]: 2: Hoare triple {46#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {46#true} is VALID [2022-02-20 14:39:18,618 INFO L290 TraceCheckUtils]: 3: Hoare triple {46#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; {46#true} is VALID [2022-02-20 14:39:18,619 INFO L290 TraceCheckUtils]: 4: Hoare triple {46#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {48#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:18,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {48#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {48#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:18,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {48#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume !(0 != main_~p3~0#1); {48#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:18,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {48#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {48#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:18,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {48#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {48#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:18,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {48#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {48#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:18,624 INFO L290 TraceCheckUtils]: 10: Hoare triple {48#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {48#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:18,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {48#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {48#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:18,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {48#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {48#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:18,626 INFO L290 TraceCheckUtils]: 13: Hoare triple {48#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {48#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:18,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {48#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume !(0 != main_~p11~0#1); {48#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:18,627 INFO L290 TraceCheckUtils]: 15: Hoare triple {48#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p1~0#1; {48#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:18,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {48#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 1 != main_~lk1~0#1; {47#false} is VALID [2022-02-20 14:39:18,628 INFO L290 TraceCheckUtils]: 17: Hoare triple {47#false} assume !false; {47#false} is VALID [2022-02-20 14:39:18,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:18,630 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:18,630 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310510507] [2022-02-20 14:39:18,631 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310510507] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:18,631 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:18,632 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:18,635 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [822069087] [2022-02-20 14:39:18,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:18,640 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 14:39:18,641 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:18,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:18,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:18,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:18,669 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:18,694 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:18,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:18,699 INFO L87 Difference]: Start difference. First operand has 43 states, 41 states have (on average 1.9024390243902438) internal successors, (78), 42 states have internal predecessors, (78), 0 states have call successors, (0), 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 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:18,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:18,864 INFO L93 Difference]: Finished difference Result 89 states and 157 transitions. [2022-02-20 14:39:18,864 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:18,865 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 14:39:18,865 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:18,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:18,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2022-02-20 14:39:18,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:18,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2022-02-20 14:39:18,878 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 157 transitions. [2022-02-20 14:39:19,015 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 157 edges. 157 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:19,027 INFO L225 Difference]: With dead ends: 89 [2022-02-20 14:39:19,027 INFO L226 Difference]: Without dead ends: 75 [2022-02-20 14:39:19,039 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:19,042 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 57 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 57 SdHoareTripleChecker+Valid, 151 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:19,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [57 Valid, 151 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:19,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-20 14:39:19,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 51. [2022-02-20 14:39:19,070 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:19,071 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 51 states, 50 states have (on average 1.88) internal successors, (94), 50 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:19,072 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 51 states, 50 states have (on average 1.88) internal successors, (94), 50 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:19,072 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 51 states, 50 states have (on average 1.88) internal successors, (94), 50 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:19,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:19,078 INFO L93 Difference]: Finished difference Result 75 states and 137 transitions. [2022-02-20 14:39:19,078 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 137 transitions. [2022-02-20 14:39:19,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:19,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:19,079 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 50 states have (on average 1.88) internal successors, (94), 50 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 75 states. [2022-02-20 14:39:19,080 INFO L87 Difference]: Start difference. First operand has 51 states, 50 states have (on average 1.88) internal successors, (94), 50 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 75 states. [2022-02-20 14:39:19,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:19,085 INFO L93 Difference]: Finished difference Result 75 states and 137 transitions. [2022-02-20 14:39:19,085 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 137 transitions. [2022-02-20 14:39:19,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:19,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:19,086 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:19,086 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:19,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.88) internal successors, (94), 50 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:19,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 94 transitions. [2022-02-20 14:39:19,090 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 94 transitions. Word has length 18 [2022-02-20 14:39:19,091 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:19,091 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 94 transitions. [2022-02-20 14:39:19,091 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:19,092 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 94 transitions. [2022-02-20 14:39:19,092 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:39:19,092 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:19,093 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:19,093 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:39:19,093 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:19,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:19,094 INFO L85 PathProgramCache]: Analyzing trace with hash -552197633, now seen corresponding path program 1 times [2022-02-20 14:39:19,094 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:19,094 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1060681177] [2022-02-20 14:39:19,095 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:19,095 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:19,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:19,161 INFO L290 TraceCheckUtils]: 0: Hoare triple {354#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(16, 2);call #Ultimate.allocInit(12, 3); {354#true} is VALID [2022-02-20 14:39:19,161 INFO L290 TraceCheckUtils]: 1: Hoare triple {354#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_~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_~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;havoc main_~cond~0#1; {354#true} is VALID [2022-02-20 14:39:19,162 INFO L290 TraceCheckUtils]: 2: Hoare triple {354#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {354#true} is VALID [2022-02-20 14:39:19,162 INFO L290 TraceCheckUtils]: 3: Hoare triple {354#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; {354#true} is VALID [2022-02-20 14:39:19,164 INFO L290 TraceCheckUtils]: 4: Hoare triple {354#true} assume !(0 != main_~p1~0#1); {356#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:19,164 INFO L290 TraceCheckUtils]: 5: Hoare triple {356#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {356#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:19,165 INFO L290 TraceCheckUtils]: 6: Hoare triple {356#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume !(0 != main_~p3~0#1); {356#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:19,165 INFO L290 TraceCheckUtils]: 7: Hoare triple {356#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {356#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:19,166 INFO L290 TraceCheckUtils]: 8: Hoare triple {356#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {356#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:19,166 INFO L290 TraceCheckUtils]: 9: Hoare triple {356#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {356#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:19,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {356#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {356#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:19,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {356#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {356#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:19,167 INFO L290 TraceCheckUtils]: 12: Hoare triple {356#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {356#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:19,168 INFO L290 TraceCheckUtils]: 13: Hoare triple {356#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {356#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:19,168 INFO L290 TraceCheckUtils]: 14: Hoare triple {356#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume !(0 != main_~p11~0#1); {356#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:19,169 INFO L290 TraceCheckUtils]: 15: Hoare triple {356#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p1~0#1; {355#false} is VALID [2022-02-20 14:39:19,169 INFO L290 TraceCheckUtils]: 16: Hoare triple {355#false} assume 1 != main_~lk1~0#1; {355#false} is VALID [2022-02-20 14:39:19,169 INFO L290 TraceCheckUtils]: 17: Hoare triple {355#false} assume !false; {355#false} is VALID [2022-02-20 14:39:19,169 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:19,170 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:19,170 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1060681177] [2022-02-20 14:39:19,170 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1060681177] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:19,171 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:19,171 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:19,171 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305802801] [2022-02-20 14:39:19,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:19,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 14:39:19,177 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:19,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:19,191 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:19,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:19,192 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:19,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:19,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:19,194 INFO L87 Difference]: Start difference. First operand 51 states and 94 transitions. Second operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:19,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:19,320 INFO L93 Difference]: Finished difference Result 124 states and 229 transitions. [2022-02-20 14:39:19,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:19,320 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 14:39:19,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:19,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:19,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2022-02-20 14:39:19,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:19,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 206 transitions. [2022-02-20 14:39:19,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 206 transitions. [2022-02-20 14:39:19,524 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:19,526 INFO L225 Difference]: With dead ends: 124 [2022-02-20 14:39:19,527 INFO L226 Difference]: Without dead ends: 75 [2022-02-20 14:39:19,527 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:19,528 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 53 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 157 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:19,529 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 157 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:19,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-20 14:39:19,534 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2022-02-20 14:39:19,535 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:19,535 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 73 states, 72 states have (on average 1.8611111111111112) internal successors, (134), 72 states have internal predecessors, (134), 0 states have call successors, (0), 0 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:19,536 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 73 states, 72 states have (on average 1.8611111111111112) internal successors, (134), 72 states have internal predecessors, (134), 0 states have call successors, (0), 0 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:19,536 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 73 states, 72 states have (on average 1.8611111111111112) internal successors, (134), 72 states have internal predecessors, (134), 0 states have call successors, (0), 0 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:19,539 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:19,540 INFO L93 Difference]: Finished difference Result 75 states and 135 transitions. [2022-02-20 14:39:19,540 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 135 transitions. [2022-02-20 14:39:19,540 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:19,540 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:19,541 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 72 states have (on average 1.8611111111111112) internal successors, (134), 72 states have internal predecessors, (134), 0 states have call successors, (0), 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 75 states. [2022-02-20 14:39:19,542 INFO L87 Difference]: Start difference. First operand has 73 states, 72 states have (on average 1.8611111111111112) internal successors, (134), 72 states have internal predecessors, (134), 0 states have call successors, (0), 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 75 states. [2022-02-20 14:39:19,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:19,548 INFO L93 Difference]: Finished difference Result 75 states and 135 transitions. [2022-02-20 14:39:19,549 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 135 transitions. [2022-02-20 14:39:19,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:19,550 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:19,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:19,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:19,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.8611111111111112) internal successors, (134), 72 states have internal predecessors, (134), 0 states have call successors, (0), 0 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:19,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 134 transitions. [2022-02-20 14:39:19,557 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 134 transitions. Word has length 18 [2022-02-20 14:39:19,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:19,557 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 134 transitions. [2022-02-20 14:39:19,558 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.0) internal successors, (18), 3 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:19,558 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 134 transitions. [2022-02-20 14:39:19,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 14:39:19,561 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:19,561 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:19,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:39:19,562 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:19,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:19,563 INFO L85 PathProgramCache]: Analyzing trace with hash 1341819263, now seen corresponding path program 1 times [2022-02-20 14:39:19,563 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:19,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061606674] [2022-02-20 14:39:19,563 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:19,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:19,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:19,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {715#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(16, 2);call #Ultimate.allocInit(12, 3); {715#true} is VALID [2022-02-20 14:39:19,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {715#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_~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_~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;havoc main_~cond~0#1; {715#true} is VALID [2022-02-20 14:39:19,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {715#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {715#true} is VALID [2022-02-20 14:39:19,644 INFO L290 TraceCheckUtils]: 3: Hoare triple {715#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; {715#true} is VALID [2022-02-20 14:39:19,644 INFO L290 TraceCheckUtils]: 4: Hoare triple {715#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {717#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:19,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {717#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {717#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:19,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {717#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p3~0#1); {717#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:19,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {717#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {717#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:19,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {717#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {717#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:19,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {717#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {717#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:19,647 INFO L290 TraceCheckUtils]: 10: Hoare triple {717#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {717#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:19,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {717#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {717#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:19,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {717#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {717#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:19,648 INFO L290 TraceCheckUtils]: 13: Hoare triple {717#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {717#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:19,648 INFO L290 TraceCheckUtils]: 14: Hoare triple {717#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p11~0#1); {717#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:19,649 INFO L290 TraceCheckUtils]: 15: Hoare triple {717#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p1~0#1); {716#false} is VALID [2022-02-20 14:39:19,649 INFO L290 TraceCheckUtils]: 16: Hoare triple {716#false} assume 0 != main_~p2~0#1; {716#false} is VALID [2022-02-20 14:39:19,649 INFO L290 TraceCheckUtils]: 17: Hoare triple {716#false} assume 1 != main_~lk2~0#1; {716#false} is VALID [2022-02-20 14:39:19,649 INFO L290 TraceCheckUtils]: 18: Hoare triple {716#false} assume !false; {716#false} is VALID [2022-02-20 14:39:19,650 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:19,650 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:19,650 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061606674] [2022-02-20 14:39:19,650 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2061606674] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:19,651 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:19,651 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:19,651 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781765999] [2022-02-20 14:39:19,651 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:19,652 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 14:39:19,652 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:19,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 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:19,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:19,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:19,666 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:19,667 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:19,667 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:19,667 INFO L87 Difference]: Start difference. First operand 73 states and 134 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 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:19,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:19,776 INFO L93 Difference]: Finished difference Result 114 states and 204 transitions. [2022-02-20 14:39:19,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:19,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 14:39:19,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:19,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 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:19,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2022-02-20 14:39:19,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 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:19,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2022-02-20 14:39:19,782 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 201 transitions. [2022-02-20 14:39:19,931 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:19,933 INFO L225 Difference]: With dead ends: 114 [2022-02-20 14:39:19,933 INFO L226 Difference]: Without dead ends: 78 [2022-02-20 14:39:19,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:19,939 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 55 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 176 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:19,941 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 176 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:19,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-20 14:39:19,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-02-20 14:39:19,957 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:19,958 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 76 states, 75 states have (on average 1.8133333333333332) internal successors, (136), 75 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:19,959 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 76 states, 75 states have (on average 1.8133333333333332) internal successors, (136), 75 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:19,960 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 76 states, 75 states have (on average 1.8133333333333332) internal successors, (136), 75 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:19,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:19,963 INFO L93 Difference]: Finished difference Result 78 states and 137 transitions. [2022-02-20 14:39:19,963 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 137 transitions. [2022-02-20 14:39:19,964 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:19,964 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:19,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 75 states have (on average 1.8133333333333332) internal successors, (136), 75 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 78 states. [2022-02-20 14:39:19,965 INFO L87 Difference]: Start difference. First operand has 76 states, 75 states have (on average 1.8133333333333332) internal successors, (136), 75 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 78 states. [2022-02-20 14:39:19,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:19,969 INFO L93 Difference]: Finished difference Result 78 states and 137 transitions. [2022-02-20 14:39:19,969 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 137 transitions. [2022-02-20 14:39:19,970 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:19,970 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:19,970 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:19,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:19,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.8133333333333332) internal successors, (136), 75 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:19,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 136 transitions. [2022-02-20 14:39:19,974 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 136 transitions. Word has length 19 [2022-02-20 14:39:19,974 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:19,974 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 136 transitions. [2022-02-20 14:39:19,974 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 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:19,975 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 136 transitions. [2022-02-20 14:39:19,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 14:39:19,975 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:19,975 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:19,976 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 14:39:19,976 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:19,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:19,977 INFO L85 PathProgramCache]: Analyzing trace with hash 61955585, now seen corresponding path program 1 times [2022-02-20 14:39:19,977 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:19,977 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [722793336] [2022-02-20 14:39:19,977 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:19,978 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:20,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:20,054 INFO L290 TraceCheckUtils]: 0: Hoare triple {1077#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(16, 2);call #Ultimate.allocInit(12, 3); {1077#true} is VALID [2022-02-20 14:39:20,054 INFO L290 TraceCheckUtils]: 1: Hoare triple {1077#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_~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_~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;havoc main_~cond~0#1; {1077#true} is VALID [2022-02-20 14:39:20,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {1077#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {1077#true} is VALID [2022-02-20 14:39:20,055 INFO L290 TraceCheckUtils]: 3: Hoare triple {1077#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; {1077#true} is VALID [2022-02-20 14:39:20,055 INFO L290 TraceCheckUtils]: 4: Hoare triple {1077#true} assume !(0 != main_~p1~0#1); {1077#true} is VALID [2022-02-20 14:39:20,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {1077#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {1079#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:20,056 INFO L290 TraceCheckUtils]: 6: Hoare triple {1079#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p3~0#1); {1079#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:20,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {1079#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1079#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:20,058 INFO L290 TraceCheckUtils]: 8: Hoare triple {1079#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1079#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:20,058 INFO L290 TraceCheckUtils]: 9: Hoare triple {1079#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1079#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:20,059 INFO L290 TraceCheckUtils]: 10: Hoare triple {1079#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1079#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:20,059 INFO L290 TraceCheckUtils]: 11: Hoare triple {1079#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1079#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:20,060 INFO L290 TraceCheckUtils]: 12: Hoare triple {1079#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {1079#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:20,060 INFO L290 TraceCheckUtils]: 13: Hoare triple {1079#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {1079#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:20,061 INFO L290 TraceCheckUtils]: 14: Hoare triple {1079#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p11~0#1); {1079#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:20,061 INFO L290 TraceCheckUtils]: 15: Hoare triple {1079#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p1~0#1); {1079#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:20,062 INFO L290 TraceCheckUtils]: 16: Hoare triple {1079#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p2~0#1; {1079#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:20,062 INFO L290 TraceCheckUtils]: 17: Hoare triple {1079#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 1 != main_~lk2~0#1; {1078#false} is VALID [2022-02-20 14:39:20,062 INFO L290 TraceCheckUtils]: 18: Hoare triple {1078#false} assume !false; {1078#false} is VALID [2022-02-20 14:39:20,063 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:20,063 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:20,063 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [722793336] [2022-02-20 14:39:20,063 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [722793336] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:20,064 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:20,064 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:20,064 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365435059] [2022-02-20 14:39:20,064 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:20,065 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 14:39:20,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:20,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 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:20,080 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:20,080 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:20,080 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:20,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:20,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:20,082 INFO L87 Difference]: Start difference. First operand 76 states and 136 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 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:20,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:20,163 INFO L93 Difference]: Finished difference Result 145 states and 261 transitions. [2022-02-20 14:39:20,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:20,164 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 14:39:20,164 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:20,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 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:20,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2022-02-20 14:39:20,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 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:20,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2022-02-20 14:39:20,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 135 transitions. [2022-02-20 14:39:20,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:20,260 INFO L225 Difference]: With dead ends: 145 [2022-02-20 14:39:20,260 INFO L226 Difference]: Without dead ends: 143 [2022-02-20 14:39:20,260 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:20,262 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 50 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 137 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:20,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 137 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:20,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-02-20 14:39:20,267 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 101. [2022-02-20 14:39:20,268 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:20,268 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 101 states, 100 states have (on average 1.81) internal successors, (181), 100 states have internal predecessors, (181), 0 states have call successors, (0), 0 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:20,268 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 101 states, 100 states have (on average 1.81) internal successors, (181), 100 states have internal predecessors, (181), 0 states have call successors, (0), 0 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:20,269 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 101 states, 100 states have (on average 1.81) internal successors, (181), 100 states have internal predecessors, (181), 0 states have call successors, (0), 0 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:20,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:20,273 INFO L93 Difference]: Finished difference Result 143 states and 258 transitions. [2022-02-20 14:39:20,273 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 258 transitions. [2022-02-20 14:39:20,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:20,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:20,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 100 states have (on average 1.81) internal successors, (181), 100 states have internal predecessors, (181), 0 states have call successors, (0), 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 143 states. [2022-02-20 14:39:20,274 INFO L87 Difference]: Start difference. First operand has 101 states, 100 states have (on average 1.81) internal successors, (181), 100 states have internal predecessors, (181), 0 states have call successors, (0), 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 143 states. [2022-02-20 14:39:20,278 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:20,278 INFO L93 Difference]: Finished difference Result 143 states and 258 transitions. [2022-02-20 14:39:20,279 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 258 transitions. [2022-02-20 14:39:20,279 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:20,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:20,279 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:20,279 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:20,280 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.81) internal successors, (181), 100 states have internal predecessors, (181), 0 states have call successors, (0), 0 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:20,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 181 transitions. [2022-02-20 14:39:20,283 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 181 transitions. Word has length 19 [2022-02-20 14:39:20,283 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:20,283 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 181 transitions. [2022-02-20 14:39:20,283 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 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:20,283 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 181 transitions. [2022-02-20 14:39:20,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 14:39:20,284 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:20,284 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:20,284 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 14:39:20,285 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:20,285 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:20,285 INFO L85 PathProgramCache]: Analyzing trace with hash -949161665, now seen corresponding path program 1 times [2022-02-20 14:39:20,286 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:20,286 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [272261199] [2022-02-20 14:39:20,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:20,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:20,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:20,320 INFO L290 TraceCheckUtils]: 0: Hoare triple {1626#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(16, 2);call #Ultimate.allocInit(12, 3); {1626#true} is VALID [2022-02-20 14:39:20,320 INFO L290 TraceCheckUtils]: 1: Hoare triple {1626#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_~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_~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;havoc main_~cond~0#1; {1626#true} is VALID [2022-02-20 14:39:20,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {1626#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {1626#true} is VALID [2022-02-20 14:39:20,321 INFO L290 TraceCheckUtils]: 3: Hoare triple {1626#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; {1626#true} is VALID [2022-02-20 14:39:20,321 INFO L290 TraceCheckUtils]: 4: Hoare triple {1626#true} assume !(0 != main_~p1~0#1); {1626#true} is VALID [2022-02-20 14:39:20,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {1626#true} assume !(0 != main_~p2~0#1); {1628#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:20,322 INFO L290 TraceCheckUtils]: 6: Hoare triple {1628#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p3~0#1); {1628#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:20,322 INFO L290 TraceCheckUtils]: 7: Hoare triple {1628#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1628#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:20,323 INFO L290 TraceCheckUtils]: 8: Hoare triple {1628#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1628#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:20,323 INFO L290 TraceCheckUtils]: 9: Hoare triple {1628#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1628#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:20,324 INFO L290 TraceCheckUtils]: 10: Hoare triple {1628#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1628#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:20,324 INFO L290 TraceCheckUtils]: 11: Hoare triple {1628#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1628#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:20,324 INFO L290 TraceCheckUtils]: 12: Hoare triple {1628#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {1628#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:20,325 INFO L290 TraceCheckUtils]: 13: Hoare triple {1628#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {1628#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:20,325 INFO L290 TraceCheckUtils]: 14: Hoare triple {1628#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p11~0#1); {1628#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:20,326 INFO L290 TraceCheckUtils]: 15: Hoare triple {1628#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p1~0#1); {1628#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:20,326 INFO L290 TraceCheckUtils]: 16: Hoare triple {1628#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p2~0#1; {1627#false} is VALID [2022-02-20 14:39:20,326 INFO L290 TraceCheckUtils]: 17: Hoare triple {1627#false} assume 1 != main_~lk2~0#1; {1627#false} is VALID [2022-02-20 14:39:20,326 INFO L290 TraceCheckUtils]: 18: Hoare triple {1627#false} assume !false; {1627#false} is VALID [2022-02-20 14:39:20,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:20,327 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:20,327 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [272261199] [2022-02-20 14:39:20,327 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [272261199] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:20,327 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:20,328 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:20,328 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1979418600] [2022-02-20 14:39:20,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:20,328 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 14:39:20,329 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:20,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 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:20,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:20,352 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:20,353 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:20,353 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:20,353 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:20,353 INFO L87 Difference]: Start difference. First operand 101 states and 181 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 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:20,434 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:20,434 INFO L93 Difference]: Finished difference Result 241 states and 435 transitions. [2022-02-20 14:39:20,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:20,434 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2022-02-20 14:39:20,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:20,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 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:20,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2022-02-20 14:39:20,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 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:20,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 203 transitions. [2022-02-20 14:39:20,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 203 transitions. [2022-02-20 14:39:20,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:20,574 INFO L225 Difference]: With dead ends: 241 [2022-02-20 14:39:20,574 INFO L226 Difference]: Without dead ends: 145 [2022-02-20 14:39:20,575 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:20,576 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 52 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 158 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:20,576 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 158 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:20,577 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-02-20 14:39:20,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2022-02-20 14:39:20,582 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:20,582 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 143 states, 142 states have (on average 1.795774647887324) internal successors, (255), 142 states have internal predecessors, (255), 0 states have call successors, (0), 0 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:20,583 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 143 states, 142 states have (on average 1.795774647887324) internal successors, (255), 142 states have internal predecessors, (255), 0 states have call successors, (0), 0 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:20,583 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 143 states, 142 states have (on average 1.795774647887324) internal successors, (255), 142 states have internal predecessors, (255), 0 states have call successors, (0), 0 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:20,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:20,587 INFO L93 Difference]: Finished difference Result 145 states and 256 transitions. [2022-02-20 14:39:20,587 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 256 transitions. [2022-02-20 14:39:20,587 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:20,587 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:20,588 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 142 states have (on average 1.795774647887324) internal successors, (255), 142 states have internal predecessors, (255), 0 states have call successors, (0), 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 145 states. [2022-02-20 14:39:20,588 INFO L87 Difference]: Start difference. First operand has 143 states, 142 states have (on average 1.795774647887324) internal successors, (255), 142 states have internal predecessors, (255), 0 states have call successors, (0), 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 145 states. [2022-02-20 14:39:20,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:20,592 INFO L93 Difference]: Finished difference Result 145 states and 256 transitions. [2022-02-20 14:39:20,592 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 256 transitions. [2022-02-20 14:39:20,592 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:20,592 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:20,592 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:20,592 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:20,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.795774647887324) internal successors, (255), 142 states have internal predecessors, (255), 0 states have call successors, (0), 0 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:20,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 255 transitions. [2022-02-20 14:39:20,596 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 255 transitions. Word has length 19 [2022-02-20 14:39:20,596 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:20,596 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 255 transitions. [2022-02-20 14:39:20,597 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 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:20,597 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 255 transitions. [2022-02-20 14:39:20,597 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 14:39:20,597 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:20,597 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] [2022-02-20 14:39:20,598 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 14:39:20,598 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:20,598 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:20,598 INFO L85 PathProgramCache]: Analyzing trace with hash 1920836500, now seen corresponding path program 1 times [2022-02-20 14:39:20,599 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:20,599 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584100863] [2022-02-20 14:39:20,599 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:20,599 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:20,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:20,633 INFO L290 TraceCheckUtils]: 0: Hoare triple {2321#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(16, 2);call #Ultimate.allocInit(12, 3); {2321#true} is VALID [2022-02-20 14:39:20,634 INFO L290 TraceCheckUtils]: 1: Hoare triple {2321#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_~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_~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;havoc main_~cond~0#1; {2321#true} is VALID [2022-02-20 14:39:20,634 INFO L290 TraceCheckUtils]: 2: Hoare triple {2321#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {2321#true} is VALID [2022-02-20 14:39:20,634 INFO L290 TraceCheckUtils]: 3: Hoare triple {2321#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; {2321#true} is VALID [2022-02-20 14:39:20,634 INFO L290 TraceCheckUtils]: 4: Hoare triple {2321#true} assume !(0 != main_~p1~0#1); {2321#true} is VALID [2022-02-20 14:39:20,635 INFO L290 TraceCheckUtils]: 5: Hoare triple {2321#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {2323#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:20,635 INFO L290 TraceCheckUtils]: 6: Hoare triple {2323#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p3~0#1); {2323#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:20,636 INFO L290 TraceCheckUtils]: 7: Hoare triple {2323#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {2323#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:20,636 INFO L290 TraceCheckUtils]: 8: Hoare triple {2323#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2323#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:20,636 INFO L290 TraceCheckUtils]: 9: Hoare triple {2323#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2323#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:20,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {2323#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {2323#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:20,637 INFO L290 TraceCheckUtils]: 11: Hoare triple {2323#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {2323#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:20,638 INFO L290 TraceCheckUtils]: 12: Hoare triple {2323#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {2323#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:20,638 INFO L290 TraceCheckUtils]: 13: Hoare triple {2323#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {2323#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:20,639 INFO L290 TraceCheckUtils]: 14: Hoare triple {2323#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p11~0#1); {2323#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:20,639 INFO L290 TraceCheckUtils]: 15: Hoare triple {2323#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p1~0#1); {2323#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:20,639 INFO L290 TraceCheckUtils]: 16: Hoare triple {2323#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p2~0#1); {2322#false} is VALID [2022-02-20 14:39:20,644 INFO L290 TraceCheckUtils]: 17: Hoare triple {2322#false} assume 0 != main_~p3~0#1; {2322#false} is VALID [2022-02-20 14:39:20,645 INFO L290 TraceCheckUtils]: 18: Hoare triple {2322#false} assume 1 != main_~lk3~0#1; {2322#false} is VALID [2022-02-20 14:39:20,645 INFO L290 TraceCheckUtils]: 19: Hoare triple {2322#false} assume !false; {2322#false} is VALID [2022-02-20 14:39:20,645 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:20,645 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:20,645 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584100863] [2022-02-20 14:39:20,646 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [584100863] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:20,646 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:20,646 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:20,646 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477788395] [2022-02-20 14:39:20,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:20,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 14:39:20,647 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:20,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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:20,662 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:20,662 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:20,662 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:20,663 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:20,663 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:20,664 INFO L87 Difference]: Start difference. First operand 143 states and 255 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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:20,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:20,762 INFO L93 Difference]: Finished difference Result 216 states and 382 transitions. [2022-02-20 14:39:20,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:20,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 14:39:20,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:20,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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:20,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2022-02-20 14:39:20,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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:20,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2022-02-20 14:39:20,767 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 198 transitions. [2022-02-20 14:39:20,907 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:20,909 INFO L225 Difference]: With dead ends: 216 [2022-02-20 14:39:20,909 INFO L226 Difference]: Without dead ends: 147 [2022-02-20 14:39:20,909 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:20,910 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 54 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 172 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:20,911 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 172 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:20,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-02-20 14:39:20,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2022-02-20 14:39:20,916 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:20,921 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 145 states, 144 states have (on average 1.7708333333333333) internal successors, (255), 144 states have internal predecessors, (255), 0 states have call successors, (0), 0 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:20,922 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 145 states, 144 states have (on average 1.7708333333333333) internal successors, (255), 144 states have internal predecessors, (255), 0 states have call successors, (0), 0 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:20,922 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 145 states, 144 states have (on average 1.7708333333333333) internal successors, (255), 144 states have internal predecessors, (255), 0 states have call successors, (0), 0 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:20,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:20,926 INFO L93 Difference]: Finished difference Result 147 states and 256 transitions. [2022-02-20 14:39:20,926 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 256 transitions. [2022-02-20 14:39:20,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:20,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:20,927 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 144 states have (on average 1.7708333333333333) internal successors, (255), 144 states have internal predecessors, (255), 0 states have call successors, (0), 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 147 states. [2022-02-20 14:39:20,927 INFO L87 Difference]: Start difference. First operand has 145 states, 144 states have (on average 1.7708333333333333) internal successors, (255), 144 states have internal predecessors, (255), 0 states have call successors, (0), 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 147 states. [2022-02-20 14:39:20,930 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:20,930 INFO L93 Difference]: Finished difference Result 147 states and 256 transitions. [2022-02-20 14:39:20,931 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 256 transitions. [2022-02-20 14:39:20,931 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:20,931 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:20,931 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:20,931 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:20,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.7708333333333333) internal successors, (255), 144 states have internal predecessors, (255), 0 states have call successors, (0), 0 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:20,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 255 transitions. [2022-02-20 14:39:20,935 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 255 transitions. Word has length 20 [2022-02-20 14:39:20,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:20,935 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 255 transitions. [2022-02-20 14:39:20,936 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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:20,936 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 255 transitions. [2022-02-20 14:39:20,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 14:39:20,936 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:20,936 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] [2022-02-20 14:39:20,937 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 14:39:20,937 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:20,937 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:20,937 INFO L85 PathProgramCache]: Analyzing trace with hash 640972822, now seen corresponding path program 1 times [2022-02-20 14:39:20,937 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:20,938 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [759052135] [2022-02-20 14:39:20,938 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:20,938 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:20,953 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:20,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {2997#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(16, 2);call #Ultimate.allocInit(12, 3); {2997#true} is VALID [2022-02-20 14:39:20,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {2997#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_~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_~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;havoc main_~cond~0#1; {2997#true} is VALID [2022-02-20 14:39:20,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {2997#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {2997#true} is VALID [2022-02-20 14:39:20,969 INFO L290 TraceCheckUtils]: 3: Hoare triple {2997#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; {2997#true} is VALID [2022-02-20 14:39:20,969 INFO L290 TraceCheckUtils]: 4: Hoare triple {2997#true} assume !(0 != main_~p1~0#1); {2997#true} is VALID [2022-02-20 14:39:20,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {2997#true} assume !(0 != main_~p2~0#1); {2997#true} is VALID [2022-02-20 14:39:20,970 INFO L290 TraceCheckUtils]: 6: Hoare triple {2997#true} assume !(0 != main_~p3~0#1); {2999#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:20,970 INFO L290 TraceCheckUtils]: 7: Hoare triple {2999#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {2999#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:20,971 INFO L290 TraceCheckUtils]: 8: Hoare triple {2999#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2999#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:20,971 INFO L290 TraceCheckUtils]: 9: Hoare triple {2999#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2999#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:20,972 INFO L290 TraceCheckUtils]: 10: Hoare triple {2999#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {2999#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:20,972 INFO L290 TraceCheckUtils]: 11: Hoare triple {2999#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {2999#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:20,972 INFO L290 TraceCheckUtils]: 12: Hoare triple {2999#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {2999#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:20,973 INFO L290 TraceCheckUtils]: 13: Hoare triple {2999#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {2999#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:20,973 INFO L290 TraceCheckUtils]: 14: Hoare triple {2999#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p11~0#1); {2999#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:20,973 INFO L290 TraceCheckUtils]: 15: Hoare triple {2999#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p1~0#1); {2999#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:20,974 INFO L290 TraceCheckUtils]: 16: Hoare triple {2999#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p2~0#1); {2999#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:20,974 INFO L290 TraceCheckUtils]: 17: Hoare triple {2999#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p3~0#1; {2998#false} is VALID [2022-02-20 14:39:20,974 INFO L290 TraceCheckUtils]: 18: Hoare triple {2998#false} assume 1 != main_~lk3~0#1; {2998#false} is VALID [2022-02-20 14:39:20,975 INFO L290 TraceCheckUtils]: 19: Hoare triple {2998#false} assume !false; {2998#false} is VALID [2022-02-20 14:39:20,975 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:20,975 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:20,975 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [759052135] [2022-02-20 14:39:20,975 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [759052135] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:20,975 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:20,976 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:20,976 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337121207] [2022-02-20 14:39:20,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:20,976 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 14:39:20,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:20,977 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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:20,989 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:20,990 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:20,990 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:20,990 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:20,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:20,991 INFO L87 Difference]: Start difference. First operand 145 states and 255 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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:21,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:21,082 INFO L93 Difference]: Finished difference Result 417 states and 737 transitions. [2022-02-20 14:39:21,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:21,082 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 14:39:21,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:21,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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:21,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2022-02-20 14:39:21,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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:21,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 201 transitions. [2022-02-20 14:39:21,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 201 transitions. [2022-02-20 14:39:21,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 201 edges. 201 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:21,226 INFO L225 Difference]: With dead ends: 417 [2022-02-20 14:39:21,226 INFO L226 Difference]: Without dead ends: 279 [2022-02-20 14:39:21,226 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:21,227 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 52 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 139 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:21,227 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 139 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:21,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-02-20 14:39:21,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2022-02-20 14:39:21,235 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:21,236 INFO L82 GeneralOperation]: Start isEquivalent. First operand 279 states. Second operand has 277 states, 276 states have (on average 1.75) internal successors, (483), 276 states have internal predecessors, (483), 0 states have call successors, (0), 0 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:21,237 INFO L74 IsIncluded]: Start isIncluded. First operand 279 states. Second operand has 277 states, 276 states have (on average 1.75) internal successors, (483), 276 states have internal predecessors, (483), 0 states have call successors, (0), 0 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:21,237 INFO L87 Difference]: Start difference. First operand 279 states. Second operand has 277 states, 276 states have (on average 1.75) internal successors, (483), 276 states have internal predecessors, (483), 0 states have call successors, (0), 0 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:21,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:21,243 INFO L93 Difference]: Finished difference Result 279 states and 484 transitions. [2022-02-20 14:39:21,244 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 484 transitions. [2022-02-20 14:39:21,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:21,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:21,245 INFO L74 IsIncluded]: Start isIncluded. First operand has 277 states, 276 states have (on average 1.75) internal successors, (483), 276 states have internal predecessors, (483), 0 states have call successors, (0), 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 279 states. [2022-02-20 14:39:21,246 INFO L87 Difference]: Start difference. First operand has 277 states, 276 states have (on average 1.75) internal successors, (483), 276 states have internal predecessors, (483), 0 states have call successors, (0), 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 279 states. [2022-02-20 14:39:21,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:21,251 INFO L93 Difference]: Finished difference Result 279 states and 484 transitions. [2022-02-20 14:39:21,252 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 484 transitions. [2022-02-20 14:39:21,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:21,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:21,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:21,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:21,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.75) internal successors, (483), 276 states have internal predecessors, (483), 0 states have call successors, (0), 0 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:21,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 483 transitions. [2022-02-20 14:39:21,258 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 483 transitions. Word has length 20 [2022-02-20 14:39:21,259 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:21,259 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 483 transitions. [2022-02-20 14:39:21,259 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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:21,259 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 483 transitions. [2022-02-20 14:39:21,260 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 14:39:21,260 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:21,260 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] [2022-02-20 14:39:21,260 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 14:39:21,260 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:21,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:21,261 INFO L85 PathProgramCache]: Analyzing trace with hash 1652090072, now seen corresponding path program 1 times [2022-02-20 14:39:21,261 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:21,261 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2065005226] [2022-02-20 14:39:21,261 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:21,261 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:21,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:21,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {4280#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(16, 2);call #Ultimate.allocInit(12, 3); {4280#true} is VALID [2022-02-20 14:39:21,290 INFO L290 TraceCheckUtils]: 1: Hoare triple {4280#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_~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_~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;havoc main_~cond~0#1; {4280#true} is VALID [2022-02-20 14:39:21,290 INFO L290 TraceCheckUtils]: 2: Hoare triple {4280#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {4280#true} is VALID [2022-02-20 14:39:21,290 INFO L290 TraceCheckUtils]: 3: Hoare triple {4280#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; {4280#true} is VALID [2022-02-20 14:39:21,290 INFO L290 TraceCheckUtils]: 4: Hoare triple {4280#true} assume !(0 != main_~p1~0#1); {4280#true} is VALID [2022-02-20 14:39:21,291 INFO L290 TraceCheckUtils]: 5: Hoare triple {4280#true} assume !(0 != main_~p2~0#1); {4280#true} is VALID [2022-02-20 14:39:21,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {4280#true} assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; {4282#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:21,291 INFO L290 TraceCheckUtils]: 7: Hoare triple {4282#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {4282#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:21,292 INFO L290 TraceCheckUtils]: 8: Hoare triple {4282#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {4282#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:21,292 INFO L290 TraceCheckUtils]: 9: Hoare triple {4282#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {4282#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:21,292 INFO L290 TraceCheckUtils]: 10: Hoare triple {4282#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {4282#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:21,293 INFO L290 TraceCheckUtils]: 11: Hoare triple {4282#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {4282#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:21,293 INFO L290 TraceCheckUtils]: 12: Hoare triple {4282#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {4282#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:21,294 INFO L290 TraceCheckUtils]: 13: Hoare triple {4282#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {4282#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:21,294 INFO L290 TraceCheckUtils]: 14: Hoare triple {4282#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p11~0#1); {4282#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:21,294 INFO L290 TraceCheckUtils]: 15: Hoare triple {4282#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p1~0#1); {4282#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:21,295 INFO L290 TraceCheckUtils]: 16: Hoare triple {4282#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p2~0#1); {4282#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:21,295 INFO L290 TraceCheckUtils]: 17: Hoare triple {4282#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p3~0#1; {4282#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:21,296 INFO L290 TraceCheckUtils]: 18: Hoare triple {4282#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 1 != main_~lk3~0#1; {4281#false} is VALID [2022-02-20 14:39:21,296 INFO L290 TraceCheckUtils]: 19: Hoare triple {4281#false} assume !false; {4281#false} is VALID [2022-02-20 14:39:21,296 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:21,296 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:21,296 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2065005226] [2022-02-20 14:39:21,296 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2065005226] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:21,297 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:21,297 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:21,297 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1390706728] [2022-02-20 14:39:21,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:21,297 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 14:39:21,298 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:21,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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:21,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:21,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:21,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:21,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:21,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:21,311 INFO L87 Difference]: Start difference. First operand 277 states and 483 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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:21,395 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:21,395 INFO L93 Difference]: Finished difference Result 353 states and 621 transitions. [2022-02-20 14:39:21,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:21,396 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 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 20 [2022-02-20 14:39:21,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:21,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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:21,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2022-02-20 14:39:21,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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:21,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2022-02-20 14:39:21,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 128 transitions. [2022-02-20 14:39:21,489 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:21,496 INFO L225 Difference]: With dead ends: 353 [2022-02-20 14:39:21,496 INFO L226 Difference]: Without dead ends: 351 [2022-02-20 14:39:21,496 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:21,497 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 47 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 188 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:21,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 188 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:21,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-02-20 14:39:21,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 277. [2022-02-20 14:39:21,504 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:21,504 INFO L82 GeneralOperation]: Start isEquivalent. First operand 351 states. Second operand has 277 states, 276 states have (on average 1.7355072463768115) internal successors, (479), 276 states have internal predecessors, (479), 0 states have call successors, (0), 0 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:21,505 INFO L74 IsIncluded]: Start isIncluded. First operand 351 states. Second operand has 277 states, 276 states have (on average 1.7355072463768115) internal successors, (479), 276 states have internal predecessors, (479), 0 states have call successors, (0), 0 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:21,506 INFO L87 Difference]: Start difference. First operand 351 states. Second operand has 277 states, 276 states have (on average 1.7355072463768115) internal successors, (479), 276 states have internal predecessors, (479), 0 states have call successors, (0), 0 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:21,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:21,513 INFO L93 Difference]: Finished difference Result 351 states and 616 transitions. [2022-02-20 14:39:21,513 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 616 transitions. [2022-02-20 14:39:21,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:21,514 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:21,515 INFO L74 IsIncluded]: Start isIncluded. First operand has 277 states, 276 states have (on average 1.7355072463768115) internal successors, (479), 276 states have internal predecessors, (479), 0 states have call successors, (0), 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:21,515 INFO L87 Difference]: Start difference. First operand has 277 states, 276 states have (on average 1.7355072463768115) internal successors, (479), 276 states have internal predecessors, (479), 0 states have call successors, (0), 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:21,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:21,523 INFO L93 Difference]: Finished difference Result 351 states and 616 transitions. [2022-02-20 14:39:21,523 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 616 transitions. [2022-02-20 14:39:21,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:21,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:21,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:21,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:21,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.7355072463768115) internal successors, (479), 276 states have internal predecessors, (479), 0 states have call successors, (0), 0 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:21,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 479 transitions. [2022-02-20 14:39:21,530 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 479 transitions. Word has length 20 [2022-02-20 14:39:21,530 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:21,530 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 479 transitions. [2022-02-20 14:39:21,531 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 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:21,531 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 479 transitions. [2022-02-20 14:39:21,531 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:39:21,531 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:21,531 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:21,532 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 14:39:21,532 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:21,532 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:21,532 INFO L85 PathProgramCache]: Analyzing trace with hash -1604465292, now seen corresponding path program 1 times [2022-02-20 14:39:21,532 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:21,533 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106241682] [2022-02-20 14:39:21,533 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:21,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:21,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:21,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {5643#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(16, 2);call #Ultimate.allocInit(12, 3); {5643#true} is VALID [2022-02-20 14:39:21,565 INFO L290 TraceCheckUtils]: 1: Hoare triple {5643#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_~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_~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;havoc main_~cond~0#1; {5643#true} is VALID [2022-02-20 14:39:21,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {5643#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {5643#true} is VALID [2022-02-20 14:39:21,565 INFO L290 TraceCheckUtils]: 3: Hoare triple {5643#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; {5643#true} is VALID [2022-02-20 14:39:21,565 INFO L290 TraceCheckUtils]: 4: Hoare triple {5643#true} assume !(0 != main_~p1~0#1); {5643#true} is VALID [2022-02-20 14:39:21,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {5643#true} assume !(0 != main_~p2~0#1); {5643#true} is VALID [2022-02-20 14:39:21,566 INFO L290 TraceCheckUtils]: 6: Hoare triple {5643#true} assume !(0 != main_~p3~0#1); {5643#true} is VALID [2022-02-20 14:39:21,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {5643#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {5645#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:21,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {5645#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {5645#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:21,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {5645#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {5645#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:21,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {5645#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {5645#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:21,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {5645#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {5645#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:21,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {5645#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {5645#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:21,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {5645#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {5645#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:21,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {5645#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p11~0#1); {5645#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:21,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {5645#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p1~0#1); {5645#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:21,569 INFO L290 TraceCheckUtils]: 16: Hoare triple {5645#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p2~0#1); {5645#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:21,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {5645#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p3~0#1); {5645#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:21,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {5645#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p4~0#1; {5645#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:21,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {5645#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 1 != main_~lk4~0#1; {5644#false} is VALID [2022-02-20 14:39:21,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {5644#false} assume !false; {5644#false} is VALID [2022-02-20 14:39:21,571 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:21,571 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:21,571 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106241682] [2022-02-20 14:39:21,572 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106241682] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:21,572 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:21,572 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:21,572 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1043248951] [2022-02-20 14:39:21,572 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:21,573 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:21,573 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:21,573 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:21,586 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:21,586 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:21,587 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:21,587 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:21,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:21,587 INFO L87 Difference]: Start difference. First operand 277 states and 479 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:21,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:21,666 INFO L93 Difference]: Finished difference Result 517 states and 905 transitions. [2022-02-20 14:39:21,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:21,667 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:21,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:21,667 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:21,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2022-02-20 14:39:21,668 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:21,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2022-02-20 14:39:21,669 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 127 transitions. [2022-02-20 14:39:21,749 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:21,762 INFO L225 Difference]: With dead ends: 517 [2022-02-20 14:39:21,762 INFO L226 Difference]: Without dead ends: 515 [2022-02-20 14:39:21,762 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:21,763 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 44 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 133 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:21,763 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 133 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:21,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-02-20 14:39:21,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 385. [2022-02-20 14:39:21,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:21,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 515 states. Second operand has 385 states, 384 states have (on average 1.7057291666666667) internal successors, (655), 384 states have internal predecessors, (655), 0 states have call successors, (0), 0 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:21,773 INFO L74 IsIncluded]: Start isIncluded. First operand 515 states. Second operand has 385 states, 384 states have (on average 1.7057291666666667) internal successors, (655), 384 states have internal predecessors, (655), 0 states have call successors, (0), 0 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:21,773 INFO L87 Difference]: Start difference. First operand 515 states. Second operand has 385 states, 384 states have (on average 1.7057291666666667) internal successors, (655), 384 states have internal predecessors, (655), 0 states have call successors, (0), 0 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:21,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:21,787 INFO L93 Difference]: Finished difference Result 515 states and 896 transitions. [2022-02-20 14:39:21,788 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 896 transitions. [2022-02-20 14:39:21,788 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:21,789 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:21,789 INFO L74 IsIncluded]: Start isIncluded. First operand has 385 states, 384 states have (on average 1.7057291666666667) internal successors, (655), 384 states have internal predecessors, (655), 0 states have call successors, (0), 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 515 states. [2022-02-20 14:39:21,790 INFO L87 Difference]: Start difference. First operand has 385 states, 384 states have (on average 1.7057291666666667) internal successors, (655), 384 states have internal predecessors, (655), 0 states have call successors, (0), 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 515 states. [2022-02-20 14:39:21,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:21,804 INFO L93 Difference]: Finished difference Result 515 states and 896 transitions. [2022-02-20 14:39:21,805 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 896 transitions. [2022-02-20 14:39:21,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:21,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:21,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:21,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:21,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.7057291666666667) internal successors, (655), 384 states have internal predecessors, (655), 0 states have call successors, (0), 0 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:21,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 655 transitions. [2022-02-20 14:39:21,815 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 655 transitions. Word has length 21 [2022-02-20 14:39:21,815 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:21,815 INFO L470 AbstractCegarLoop]: Abstraction has 385 states and 655 transitions. [2022-02-20 14:39:21,815 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:21,816 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 655 transitions. [2022-02-20 14:39:21,816 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:39:21,816 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:21,816 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:21,817 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 14:39:21,817 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:21,817 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:21,817 INFO L85 PathProgramCache]: Analyzing trace with hash 1679384754, now seen corresponding path program 1 times [2022-02-20 14:39:21,817 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:21,818 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [219653096] [2022-02-20 14:39:21,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:21,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:21,856 INFO L290 TraceCheckUtils]: 0: Hoare triple {7610#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(16, 2);call #Ultimate.allocInit(12, 3); {7610#true} is VALID [2022-02-20 14:39:21,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {7610#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_~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_~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;havoc main_~cond~0#1; {7610#true} is VALID [2022-02-20 14:39:21,857 INFO L290 TraceCheckUtils]: 2: Hoare triple {7610#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {7610#true} is VALID [2022-02-20 14:39:21,857 INFO L290 TraceCheckUtils]: 3: Hoare triple {7610#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; {7610#true} is VALID [2022-02-20 14:39:21,857 INFO L290 TraceCheckUtils]: 4: Hoare triple {7610#true} assume !(0 != main_~p1~0#1); {7610#true} is VALID [2022-02-20 14:39:21,857 INFO L290 TraceCheckUtils]: 5: Hoare triple {7610#true} assume !(0 != main_~p2~0#1); {7610#true} is VALID [2022-02-20 14:39:21,857 INFO L290 TraceCheckUtils]: 6: Hoare triple {7610#true} assume !(0 != main_~p3~0#1); {7610#true} is VALID [2022-02-20 14:39:21,858 INFO L290 TraceCheckUtils]: 7: Hoare triple {7610#true} assume !(0 != main_~p4~0#1); {7612#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:21,858 INFO L290 TraceCheckUtils]: 8: Hoare triple {7612#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {7612#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:21,858 INFO L290 TraceCheckUtils]: 9: Hoare triple {7612#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {7612#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:21,859 INFO L290 TraceCheckUtils]: 10: Hoare triple {7612#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {7612#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:21,859 INFO L290 TraceCheckUtils]: 11: Hoare triple {7612#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {7612#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:21,860 INFO L290 TraceCheckUtils]: 12: Hoare triple {7612#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {7612#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:21,860 INFO L290 TraceCheckUtils]: 13: Hoare triple {7612#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {7612#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:21,860 INFO L290 TraceCheckUtils]: 14: Hoare triple {7612#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p11~0#1); {7612#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:21,861 INFO L290 TraceCheckUtils]: 15: Hoare triple {7612#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p1~0#1); {7612#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:21,861 INFO L290 TraceCheckUtils]: 16: Hoare triple {7612#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p2~0#1); {7612#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:21,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {7612#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p3~0#1); {7612#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:21,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {7612#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p4~0#1; {7611#false} is VALID [2022-02-20 14:39:21,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {7611#false} assume 1 != main_~lk4~0#1; {7611#false} is VALID [2022-02-20 14:39:21,862 INFO L290 TraceCheckUtils]: 20: Hoare triple {7611#false} assume !false; {7611#false} is VALID [2022-02-20 14:39:21,862 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:21,862 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:21,863 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [219653096] [2022-02-20 14:39:21,863 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [219653096] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:21,863 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:21,863 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:21,863 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [155127220] [2022-02-20 14:39:21,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:21,864 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:21,864 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:21,864 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:21,877 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:21,877 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:21,877 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:21,878 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:21,878 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:21,878 INFO L87 Difference]: Start difference. First operand 385 states and 655 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:21,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:21,988 INFO L93 Difference]: Finished difference Result 917 states and 1569 transitions. [2022-02-20 14:39:21,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:21,989 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:21,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:21,989 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:21,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2022-02-20 14:39:21,990 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:21,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 197 transitions. [2022-02-20 14:39:21,991 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 197 transitions. [2022-02-20 14:39:22,129 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 197 edges. 197 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:22,143 INFO L225 Difference]: With dead ends: 917 [2022-02-20 14:39:22,144 INFO L226 Difference]: Without dead ends: 539 [2022-02-20 14:39:22,144 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:22,145 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 50 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 160 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:22,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 160 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:22,147 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2022-02-20 14:39:22,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 537. [2022-02-20 14:39:22,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:22,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 539 states. Second operand has 537 states, 536 states have (on average 1.6921641791044777) internal successors, (907), 536 states have internal predecessors, (907), 0 states have call successors, (0), 0 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:22,159 INFO L74 IsIncluded]: Start isIncluded. First operand 539 states. Second operand has 537 states, 536 states have (on average 1.6921641791044777) internal successors, (907), 536 states have internal predecessors, (907), 0 states have call successors, (0), 0 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:22,160 INFO L87 Difference]: Start difference. First operand 539 states. Second operand has 537 states, 536 states have (on average 1.6921641791044777) internal successors, (907), 536 states have internal predecessors, (907), 0 states have call successors, (0), 0 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:22,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:22,176 INFO L93 Difference]: Finished difference Result 539 states and 908 transitions. [2022-02-20 14:39:22,176 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 908 transitions. [2022-02-20 14:39:22,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:22,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:22,178 INFO L74 IsIncluded]: Start isIncluded. First operand has 537 states, 536 states have (on average 1.6921641791044777) internal successors, (907), 536 states have internal predecessors, (907), 0 states have call successors, (0), 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 539 states. [2022-02-20 14:39:22,179 INFO L87 Difference]: Start difference. First operand has 537 states, 536 states have (on average 1.6921641791044777) internal successors, (907), 536 states have internal predecessors, (907), 0 states have call successors, (0), 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 539 states. [2022-02-20 14:39:22,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:22,195 INFO L93 Difference]: Finished difference Result 539 states and 908 transitions. [2022-02-20 14:39:22,195 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 908 transitions. [2022-02-20 14:39:22,196 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:22,196 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:22,196 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:22,196 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:22,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.6921641791044777) internal successors, (907), 536 states have internal predecessors, (907), 0 states have call successors, (0), 0 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:22,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 907 transitions. [2022-02-20 14:39:22,213 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 907 transitions. Word has length 21 [2022-02-20 14:39:22,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:22,213 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 907 transitions. [2022-02-20 14:39:22,213 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:22,213 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 907 transitions. [2022-02-20 14:39:22,215 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 14:39:22,215 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:22,216 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:22,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 14:39:22,216 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:22,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:22,217 INFO L85 PathProgramCache]: Analyzing trace with hash 1801397547, now seen corresponding path program 1 times [2022-02-20 14:39:22,217 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:22,217 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638300570] [2022-02-20 14:39:22,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:22,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:22,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:22,265 INFO L290 TraceCheckUtils]: 0: Hoare triple {10193#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(16, 2);call #Ultimate.allocInit(12, 3); {10193#true} is VALID [2022-02-20 14:39:22,266 INFO L290 TraceCheckUtils]: 1: Hoare triple {10193#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_~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_~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;havoc main_~cond~0#1; {10193#true} is VALID [2022-02-20 14:39:22,266 INFO L290 TraceCheckUtils]: 2: Hoare triple {10193#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {10193#true} is VALID [2022-02-20 14:39:22,266 INFO L290 TraceCheckUtils]: 3: Hoare triple {10193#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; {10193#true} is VALID [2022-02-20 14:39:22,266 INFO L290 TraceCheckUtils]: 4: Hoare triple {10193#true} assume !(0 != main_~p1~0#1); {10193#true} is VALID [2022-02-20 14:39:22,267 INFO L290 TraceCheckUtils]: 5: Hoare triple {10193#true} assume !(0 != main_~p2~0#1); {10193#true} is VALID [2022-02-20 14:39:22,267 INFO L290 TraceCheckUtils]: 6: Hoare triple {10193#true} assume !(0 != main_~p3~0#1); {10193#true} is VALID [2022-02-20 14:39:22,267 INFO L290 TraceCheckUtils]: 7: Hoare triple {10193#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {10195#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:22,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {10195#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {10195#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:22,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {10195#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {10195#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:22,272 INFO L290 TraceCheckUtils]: 10: Hoare triple {10195#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {10195#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:22,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {10195#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {10195#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:22,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {10195#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {10195#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:22,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {10195#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {10195#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:22,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {10195#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p11~0#1); {10195#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:22,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {10195#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p1~0#1); {10195#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:22,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {10195#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p2~0#1); {10195#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:22,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {10195#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p3~0#1); {10195#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:22,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {10195#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p4~0#1); {10194#false} is VALID [2022-02-20 14:39:22,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {10194#false} assume 0 != main_~p5~0#1; {10194#false} is VALID [2022-02-20 14:39:22,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {10194#false} assume 1 != main_~lk5~0#1; {10194#false} is VALID [2022-02-20 14:39:22,275 INFO L290 TraceCheckUtils]: 21: Hoare triple {10194#false} assume !false; {10194#false} is VALID [2022-02-20 14:39:22,275 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:22,276 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:22,276 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638300570] [2022-02-20 14:39:22,276 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638300570] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:22,276 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:22,276 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:22,276 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1536678728] [2022-02-20 14:39:22,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:22,277 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:22,277 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:22,277 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:22,291 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:22,292 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:22,292 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:22,292 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:22,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:22,293 INFO L87 Difference]: Start difference. First operand 537 states and 907 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:22,413 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:22,413 INFO L93 Difference]: Finished difference Result 813 states and 1369 transitions. [2022-02-20 14:39:22,413 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:22,413 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:22,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:22,414 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:22,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2022-02-20 14:39:22,415 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:22,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2022-02-20 14:39:22,417 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 192 transitions. [2022-02-20 14:39:22,560 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:22,576 INFO L225 Difference]: With dead ends: 813 [2022-02-20 14:39:22,576 INFO L226 Difference]: Without dead ends: 551 [2022-02-20 14:39:22,576 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:22,577 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 52 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 164 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:22,577 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 164 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:22,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-02-20 14:39:22,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 549. [2022-02-20 14:39:22,589 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:22,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 551 states. Second operand has 549 states, 548 states have (on average 1.6697080291970803) internal successors, (915), 548 states have internal predecessors, (915), 0 states have call successors, (0), 0 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:22,591 INFO L74 IsIncluded]: Start isIncluded. First operand 551 states. Second operand has 549 states, 548 states have (on average 1.6697080291970803) internal successors, (915), 548 states have internal predecessors, (915), 0 states have call successors, (0), 0 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:22,592 INFO L87 Difference]: Start difference. First operand 551 states. Second operand has 549 states, 548 states have (on average 1.6697080291970803) internal successors, (915), 548 states have internal predecessors, (915), 0 states have call successors, (0), 0 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:22,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:22,608 INFO L93 Difference]: Finished difference Result 551 states and 916 transitions. [2022-02-20 14:39:22,608 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 916 transitions. [2022-02-20 14:39:22,609 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:22,609 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:22,610 INFO L74 IsIncluded]: Start isIncluded. First operand has 549 states, 548 states have (on average 1.6697080291970803) internal successors, (915), 548 states have internal predecessors, (915), 0 states have call successors, (0), 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 551 states. [2022-02-20 14:39:22,611 INFO L87 Difference]: Start difference. First operand has 549 states, 548 states have (on average 1.6697080291970803) internal successors, (915), 548 states have internal predecessors, (915), 0 states have call successors, (0), 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 551 states. [2022-02-20 14:39:22,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:22,628 INFO L93 Difference]: Finished difference Result 551 states and 916 transitions. [2022-02-20 14:39:22,628 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 916 transitions. [2022-02-20 14:39:22,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:22,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:22,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:22,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:22,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.6697080291970803) internal successors, (915), 548 states have internal predecessors, (915), 0 states have call successors, (0), 0 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:22,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 915 transitions. [2022-02-20 14:39:22,646 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 915 transitions. Word has length 22 [2022-02-20 14:39:22,646 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:22,647 INFO L470 AbstractCegarLoop]: Abstraction has 549 states and 915 transitions. [2022-02-20 14:39:22,647 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:22,647 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 915 transitions. [2022-02-20 14:39:22,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 14:39:22,648 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:22,648 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:22,648 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 14:39:22,648 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:22,649 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:22,649 INFO L85 PathProgramCache]: Analyzing trace with hash 521533869, now seen corresponding path program 1 times [2022-02-20 14:39:22,649 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:22,649 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1791162911] [2022-02-20 14:39:22,649 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:22,649 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:22,663 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:22,679 INFO L290 TraceCheckUtils]: 0: Hoare triple {12708#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(16, 2);call #Ultimate.allocInit(12, 3); {12708#true} is VALID [2022-02-20 14:39:22,679 INFO L290 TraceCheckUtils]: 1: Hoare triple {12708#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_~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_~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;havoc main_~cond~0#1; {12708#true} is VALID [2022-02-20 14:39:22,679 INFO L290 TraceCheckUtils]: 2: Hoare triple {12708#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {12708#true} is VALID [2022-02-20 14:39:22,679 INFO L290 TraceCheckUtils]: 3: Hoare triple {12708#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; {12708#true} is VALID [2022-02-20 14:39:22,680 INFO L290 TraceCheckUtils]: 4: Hoare triple {12708#true} assume !(0 != main_~p1~0#1); {12708#true} is VALID [2022-02-20 14:39:22,680 INFO L290 TraceCheckUtils]: 5: Hoare triple {12708#true} assume !(0 != main_~p2~0#1); {12708#true} is VALID [2022-02-20 14:39:22,680 INFO L290 TraceCheckUtils]: 6: Hoare triple {12708#true} assume !(0 != main_~p3~0#1); {12708#true} is VALID [2022-02-20 14:39:22,680 INFO L290 TraceCheckUtils]: 7: Hoare triple {12708#true} assume !(0 != main_~p4~0#1); {12708#true} is VALID [2022-02-20 14:39:22,680 INFO L290 TraceCheckUtils]: 8: Hoare triple {12708#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {12710#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:22,681 INFO L290 TraceCheckUtils]: 9: Hoare triple {12710#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {12710#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:22,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {12710#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {12710#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:22,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {12710#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {12710#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:22,682 INFO L290 TraceCheckUtils]: 12: Hoare triple {12710#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {12710#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:22,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {12710#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {12710#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:22,683 INFO L290 TraceCheckUtils]: 14: Hoare triple {12710#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p11~0#1); {12710#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:22,683 INFO L290 TraceCheckUtils]: 15: Hoare triple {12710#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p1~0#1); {12710#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:22,683 INFO L290 TraceCheckUtils]: 16: Hoare triple {12710#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p2~0#1); {12710#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:22,684 INFO L290 TraceCheckUtils]: 17: Hoare triple {12710#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p3~0#1); {12710#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:22,684 INFO L290 TraceCheckUtils]: 18: Hoare triple {12710#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p4~0#1); {12710#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:22,684 INFO L290 TraceCheckUtils]: 19: Hoare triple {12710#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p5~0#1; {12710#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:22,685 INFO L290 TraceCheckUtils]: 20: Hoare triple {12710#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 1 != main_~lk5~0#1; {12709#false} is VALID [2022-02-20 14:39:22,685 INFO L290 TraceCheckUtils]: 21: Hoare triple {12709#false} assume !false; {12709#false} is VALID [2022-02-20 14:39:22,685 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:22,685 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:22,685 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1791162911] [2022-02-20 14:39:22,686 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1791162911] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:22,686 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:22,686 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:22,686 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678267679] [2022-02-20 14:39:22,686 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:22,687 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:22,687 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:22,687 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:22,700 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:22,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:22,701 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:22,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:22,701 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:22,702 INFO L87 Difference]: Start difference. First operand 549 states and 915 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:22,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:22,807 INFO L93 Difference]: Finished difference Result 1001 states and 1693 transitions. [2022-02-20 14:39:22,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:22,807 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:22,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:22,808 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:22,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2022-02-20 14:39:22,809 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:22,810 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2022-02-20 14:39:22,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 123 transitions. [2022-02-20 14:39:22,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:22,924 INFO L225 Difference]: With dead ends: 1001 [2022-02-20 14:39:22,925 INFO L226 Difference]: Without dead ends: 999 [2022-02-20 14:39:22,925 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:22,926 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 41 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 131 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:22,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 131 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:22,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2022-02-20 14:39:22,941 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 773. [2022-02-20 14:39:22,941 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:22,942 INFO L82 GeneralOperation]: Start isEquivalent. First operand 999 states. Second operand has 773 states, 772 states have (on average 1.6308290155440415) internal successors, (1259), 772 states have internal predecessors, (1259), 0 states have call successors, (0), 0 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:22,943 INFO L74 IsIncluded]: Start isIncluded. First operand 999 states. Second operand has 773 states, 772 states have (on average 1.6308290155440415) internal successors, (1259), 772 states have internal predecessors, (1259), 0 states have call successors, (0), 0 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:22,944 INFO L87 Difference]: Start difference. First operand 999 states. Second operand has 773 states, 772 states have (on average 1.6308290155440415) internal successors, (1259), 772 states have internal predecessors, (1259), 0 states have call successors, (0), 0 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:22,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:22,988 INFO L93 Difference]: Finished difference Result 999 states and 1676 transitions. [2022-02-20 14:39:22,988 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1676 transitions. [2022-02-20 14:39:22,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:22,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:23,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 773 states, 772 states have (on average 1.6308290155440415) internal successors, (1259), 772 states have internal predecessors, (1259), 0 states have call successors, (0), 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 999 states. [2022-02-20 14:39:23,011 INFO L87 Difference]: Start difference. First operand has 773 states, 772 states have (on average 1.6308290155440415) internal successors, (1259), 772 states have internal predecessors, (1259), 0 states have call successors, (0), 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 999 states. [2022-02-20 14:39:23,054 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:23,054 INFO L93 Difference]: Finished difference Result 999 states and 1676 transitions. [2022-02-20 14:39:23,054 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1676 transitions. [2022-02-20 14:39:23,056 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:23,056 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:23,056 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:23,056 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:23,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.6308290155440415) internal successors, (1259), 772 states have internal predecessors, (1259), 0 states have call successors, (0), 0 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:23,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1259 transitions. [2022-02-20 14:39:23,086 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1259 transitions. Word has length 22 [2022-02-20 14:39:23,086 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:23,087 INFO L470 AbstractCegarLoop]: Abstraction has 773 states and 1259 transitions. [2022-02-20 14:39:23,087 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:23,087 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1259 transitions. [2022-02-20 14:39:23,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 14:39:23,088 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:23,088 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:23,089 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 14:39:23,089 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:23,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:23,089 INFO L85 PathProgramCache]: Analyzing trace with hash -489583381, now seen corresponding path program 1 times [2022-02-20 14:39:23,089 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:23,090 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731040031] [2022-02-20 14:39:23,090 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:23,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:23,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:23,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {16539#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(16, 2);call #Ultimate.allocInit(12, 3); {16539#true} is VALID [2022-02-20 14:39:23,116 INFO L290 TraceCheckUtils]: 1: Hoare triple {16539#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_~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_~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;havoc main_~cond~0#1; {16539#true} is VALID [2022-02-20 14:39:23,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {16539#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {16539#true} is VALID [2022-02-20 14:39:23,116 INFO L290 TraceCheckUtils]: 3: Hoare triple {16539#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; {16539#true} is VALID [2022-02-20 14:39:23,116 INFO L290 TraceCheckUtils]: 4: Hoare triple {16539#true} assume !(0 != main_~p1~0#1); {16539#true} is VALID [2022-02-20 14:39:23,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {16539#true} assume !(0 != main_~p2~0#1); {16539#true} is VALID [2022-02-20 14:39:23,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {16539#true} assume !(0 != main_~p3~0#1); {16539#true} is VALID [2022-02-20 14:39:23,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {16539#true} assume !(0 != main_~p4~0#1); {16539#true} is VALID [2022-02-20 14:39:23,117 INFO L290 TraceCheckUtils]: 8: Hoare triple {16539#true} assume !(0 != main_~p5~0#1); {16541#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:23,118 INFO L290 TraceCheckUtils]: 9: Hoare triple {16541#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {16541#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:23,118 INFO L290 TraceCheckUtils]: 10: Hoare triple {16541#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {16541#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:23,118 INFO L290 TraceCheckUtils]: 11: Hoare triple {16541#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {16541#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:23,119 INFO L290 TraceCheckUtils]: 12: Hoare triple {16541#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {16541#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:23,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {16541#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {16541#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:23,120 INFO L290 TraceCheckUtils]: 14: Hoare triple {16541#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p11~0#1); {16541#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:23,120 INFO L290 TraceCheckUtils]: 15: Hoare triple {16541#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p1~0#1); {16541#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:23,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {16541#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p2~0#1); {16541#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:23,121 INFO L290 TraceCheckUtils]: 17: Hoare triple {16541#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p3~0#1); {16541#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:23,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {16541#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p4~0#1); {16541#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:23,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {16541#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p5~0#1; {16540#false} is VALID [2022-02-20 14:39:23,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {16540#false} assume 1 != main_~lk5~0#1; {16540#false} is VALID [2022-02-20 14:39:23,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {16540#false} assume !false; {16540#false} is VALID [2022-02-20 14:39:23,122 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:23,122 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:23,122 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731040031] [2022-02-20 14:39:23,122 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731040031] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:23,122 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:23,123 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:23,123 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [619129193] [2022-02-20 14:39:23,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:23,123 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:23,123 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:23,124 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:23,137 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:23,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:23,138 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:23,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:23,138 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:23,139 INFO L87 Difference]: Start difference. First operand 773 states and 1259 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:23,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:23,350 INFO L93 Difference]: Finished difference Result 1817 states and 2973 transitions. [2022-02-20 14:39:23,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:23,351 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:23,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:23,351 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:23,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2022-02-20 14:39:23,352 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:23,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 194 transitions. [2022-02-20 14:39:23,353 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 194 transitions. [2022-02-20 14:39:23,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:23,519 INFO L225 Difference]: With dead ends: 1817 [2022-02-20 14:39:23,519 INFO L226 Difference]: Without dead ends: 1063 [2022-02-20 14:39:23,521 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:23,521 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 49 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 161 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:23,522 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 161 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:23,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2022-02-20 14:39:23,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1061. [2022-02-20 14:39:23,541 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:23,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1063 states. Second operand has 1061 states, 1060 states have (on average 1.6179245283018868) internal successors, (1715), 1060 states have internal predecessors, (1715), 0 states have call successors, (0), 0 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:23,544 INFO L74 IsIncluded]: Start isIncluded. First operand 1063 states. Second operand has 1061 states, 1060 states have (on average 1.6179245283018868) internal successors, (1715), 1060 states have internal predecessors, (1715), 0 states have call successors, (0), 0 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:23,546 INFO L87 Difference]: Start difference. First operand 1063 states. Second operand has 1061 states, 1060 states have (on average 1.6179245283018868) internal successors, (1715), 1060 states have internal predecessors, (1715), 0 states have call successors, (0), 0 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:23,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:23,594 INFO L93 Difference]: Finished difference Result 1063 states and 1716 transitions. [2022-02-20 14:39:23,594 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1716 transitions. [2022-02-20 14:39:23,596 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:23,596 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:23,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 1061 states, 1060 states have (on average 1.6179245283018868) internal successors, (1715), 1060 states have internal predecessors, (1715), 0 states have call successors, (0), 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 1063 states. [2022-02-20 14:39:23,599 INFO L87 Difference]: Start difference. First operand has 1061 states, 1060 states have (on average 1.6179245283018868) internal successors, (1715), 1060 states have internal predecessors, (1715), 0 states have call successors, (0), 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 1063 states. [2022-02-20 14:39:23,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:23,648 INFO L93 Difference]: Finished difference Result 1063 states and 1716 transitions. [2022-02-20 14:39:23,648 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1716 transitions. [2022-02-20 14:39:23,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:23,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:23,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:23,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:23,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 1060 states have (on average 1.6179245283018868) internal successors, (1715), 1060 states have internal predecessors, (1715), 0 states have call successors, (0), 0 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:23,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1715 transitions. [2022-02-20 14:39:23,703 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1715 transitions. Word has length 22 [2022-02-20 14:39:23,704 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:23,704 INFO L470 AbstractCegarLoop]: Abstraction has 1061 states and 1715 transitions. [2022-02-20 14:39:23,704 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:23,704 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1715 transitions. [2022-02-20 14:39:23,705 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 14:39:23,705 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:23,705 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:23,706 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 14:39:23,706 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:23,706 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:23,706 INFO L85 PathProgramCache]: Analyzing trace with hash -1012104857, now seen corresponding path program 1 times [2022-02-20 14:39:23,706 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:23,707 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [737817554] [2022-02-20 14:39:23,707 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:23,707 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:23,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {21634#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(16, 2);call #Ultimate.allocInit(12, 3); {21634#true} is VALID [2022-02-20 14:39:23,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {21634#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_~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_~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;havoc main_~cond~0#1; {21634#true} is VALID [2022-02-20 14:39:23,746 INFO L290 TraceCheckUtils]: 2: Hoare triple {21634#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {21634#true} is VALID [2022-02-20 14:39:23,746 INFO L290 TraceCheckUtils]: 3: Hoare triple {21634#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; {21634#true} is VALID [2022-02-20 14:39:23,746 INFO L290 TraceCheckUtils]: 4: Hoare triple {21634#true} assume !(0 != main_~p1~0#1); {21634#true} is VALID [2022-02-20 14:39:23,746 INFO L290 TraceCheckUtils]: 5: Hoare triple {21634#true} assume !(0 != main_~p2~0#1); {21634#true} is VALID [2022-02-20 14:39:23,746 INFO L290 TraceCheckUtils]: 6: Hoare triple {21634#true} assume !(0 != main_~p3~0#1); {21634#true} is VALID [2022-02-20 14:39:23,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {21634#true} assume !(0 != main_~p4~0#1); {21634#true} is VALID [2022-02-20 14:39:23,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {21634#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {21636#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:23,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {21636#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {21636#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:23,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {21636#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {21636#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:23,748 INFO L290 TraceCheckUtils]: 11: Hoare triple {21636#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {21636#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:23,748 INFO L290 TraceCheckUtils]: 12: Hoare triple {21636#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {21636#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:23,749 INFO L290 TraceCheckUtils]: 13: Hoare triple {21636#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {21636#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:23,749 INFO L290 TraceCheckUtils]: 14: Hoare triple {21636#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p11~0#1); {21636#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:23,749 INFO L290 TraceCheckUtils]: 15: Hoare triple {21636#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p1~0#1); {21636#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:23,750 INFO L290 TraceCheckUtils]: 16: Hoare triple {21636#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p2~0#1); {21636#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:23,750 INFO L290 TraceCheckUtils]: 17: Hoare triple {21636#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p3~0#1); {21636#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:23,750 INFO L290 TraceCheckUtils]: 18: Hoare triple {21636#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p4~0#1); {21636#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:23,755 INFO L290 TraceCheckUtils]: 19: Hoare triple {21636#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p5~0#1); {21635#false} is VALID [2022-02-20 14:39:23,755 INFO L290 TraceCheckUtils]: 20: Hoare triple {21635#false} assume 0 != main_~p6~0#1; {21635#false} is VALID [2022-02-20 14:39:23,755 INFO L290 TraceCheckUtils]: 21: Hoare triple {21635#false} assume 1 != main_~lk6~0#1; {21635#false} is VALID [2022-02-20 14:39:23,756 INFO L290 TraceCheckUtils]: 22: Hoare triple {21635#false} assume !false; {21635#false} is VALID [2022-02-20 14:39:23,757 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:23,757 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:23,757 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [737817554] [2022-02-20 14:39:23,757 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [737817554] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:23,757 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:23,758 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:23,758 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1818921939] [2022-02-20 14:39:23,758 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:23,758 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:23,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:23,759 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:23,773 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:23,773 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:23,773 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:23,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:23,774 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:23,774 INFO L87 Difference]: Start difference. First operand 1061 states and 1715 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:23,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:23,958 INFO L93 Difference]: Finished difference Result 1593 states and 2565 transitions. [2022-02-20 14:39:23,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:23,958 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:23,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:23,958 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:23,960 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2022-02-20 14:39:23,960 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:23,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 189 transitions. [2022-02-20 14:39:23,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 189 transitions. [2022-02-20 14:39:24,075 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 189 edges. 189 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:24,125 INFO L225 Difference]: With dead ends: 1593 [2022-02-20 14:39:24,125 INFO L226 Difference]: Without dead ends: 1079 [2022-02-20 14:39:24,127 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:24,127 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 51 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 160 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:24,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 160 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:24,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2022-02-20 14:39:24,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1077. [2022-02-20 14:39:24,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:24,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1079 states. Second operand has 1077 states, 1076 states have (on average 1.5938661710037174) internal successors, (1715), 1076 states have internal predecessors, (1715), 0 states have call successors, (0), 0 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:24,150 INFO L74 IsIncluded]: Start isIncluded. First operand 1079 states. Second operand has 1077 states, 1076 states have (on average 1.5938661710037174) internal successors, (1715), 1076 states have internal predecessors, (1715), 0 states have call successors, (0), 0 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:24,151 INFO L87 Difference]: Start difference. First operand 1079 states. Second operand has 1077 states, 1076 states have (on average 1.5938661710037174) internal successors, (1715), 1076 states have internal predecessors, (1715), 0 states have call successors, (0), 0 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:24,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:24,200 INFO L93 Difference]: Finished difference Result 1079 states and 1716 transitions. [2022-02-20 14:39:24,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1716 transitions. [2022-02-20 14:39:24,202 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:24,202 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:24,204 INFO L74 IsIncluded]: Start isIncluded. First operand has 1077 states, 1076 states have (on average 1.5938661710037174) internal successors, (1715), 1076 states have internal predecessors, (1715), 0 states have call successors, (0), 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 1079 states. [2022-02-20 14:39:24,205 INFO L87 Difference]: Start difference. First operand has 1077 states, 1076 states have (on average 1.5938661710037174) internal successors, (1715), 1076 states have internal predecessors, (1715), 0 states have call successors, (0), 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 1079 states. [2022-02-20 14:39:24,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:24,254 INFO L93 Difference]: Finished difference Result 1079 states and 1716 transitions. [2022-02-20 14:39:24,254 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1716 transitions. [2022-02-20 14:39:24,256 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:24,256 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:24,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:24,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:24,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1076 states have (on average 1.5938661710037174) internal successors, (1715), 1076 states have internal predecessors, (1715), 0 states have call successors, (0), 0 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:24,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1715 transitions. [2022-02-20 14:39:24,311 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1715 transitions. Word has length 23 [2022-02-20 14:39:24,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:24,311 INFO L470 AbstractCegarLoop]: Abstraction has 1077 states and 1715 transitions. [2022-02-20 14:39:24,311 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:24,311 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1715 transitions. [2022-02-20 14:39:24,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 14:39:24,313 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:24,313 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:24,313 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 14:39:24,313 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:24,314 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:24,314 INFO L85 PathProgramCache]: Analyzing trace with hash 2002998761, now seen corresponding path program 1 times [2022-02-20 14:39:24,314 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:24,314 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601494332] [2022-02-20 14:39:24,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:24,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:24,341 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:24,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {26553#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(16, 2);call #Ultimate.allocInit(12, 3); {26553#true} is VALID [2022-02-20 14:39:24,365 INFO L290 TraceCheckUtils]: 1: Hoare triple {26553#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_~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_~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;havoc main_~cond~0#1; {26553#true} is VALID [2022-02-20 14:39:24,365 INFO L290 TraceCheckUtils]: 2: Hoare triple {26553#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {26553#true} is VALID [2022-02-20 14:39:24,365 INFO L290 TraceCheckUtils]: 3: Hoare triple {26553#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; {26553#true} is VALID [2022-02-20 14:39:24,366 INFO L290 TraceCheckUtils]: 4: Hoare triple {26553#true} assume !(0 != main_~p1~0#1); {26553#true} is VALID [2022-02-20 14:39:24,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {26553#true} assume !(0 != main_~p2~0#1); {26553#true} is VALID [2022-02-20 14:39:24,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {26553#true} assume !(0 != main_~p3~0#1); {26553#true} is VALID [2022-02-20 14:39:24,366 INFO L290 TraceCheckUtils]: 7: Hoare triple {26553#true} assume !(0 != main_~p4~0#1); {26553#true} is VALID [2022-02-20 14:39:24,366 INFO L290 TraceCheckUtils]: 8: Hoare triple {26553#true} assume !(0 != main_~p5~0#1); {26553#true} is VALID [2022-02-20 14:39:24,367 INFO L290 TraceCheckUtils]: 9: Hoare triple {26553#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {26555#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:24,367 INFO L290 TraceCheckUtils]: 10: Hoare triple {26555#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {26555#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:24,367 INFO L290 TraceCheckUtils]: 11: Hoare triple {26555#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {26555#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:24,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {26555#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {26555#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:24,368 INFO L290 TraceCheckUtils]: 13: Hoare triple {26555#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {26555#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:24,368 INFO L290 TraceCheckUtils]: 14: Hoare triple {26555#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p11~0#1); {26555#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:24,369 INFO L290 TraceCheckUtils]: 15: Hoare triple {26555#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p1~0#1); {26555#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:24,369 INFO L290 TraceCheckUtils]: 16: Hoare triple {26555#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p2~0#1); {26555#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:24,371 INFO L290 TraceCheckUtils]: 17: Hoare triple {26555#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p3~0#1); {26555#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:24,371 INFO L290 TraceCheckUtils]: 18: Hoare triple {26555#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p4~0#1); {26555#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:24,372 INFO L290 TraceCheckUtils]: 19: Hoare triple {26555#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p5~0#1); {26555#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:24,372 INFO L290 TraceCheckUtils]: 20: Hoare triple {26555#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p6~0#1; {26555#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:24,373 INFO L290 TraceCheckUtils]: 21: Hoare triple {26555#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 1 != main_~lk6~0#1; {26554#false} is VALID [2022-02-20 14:39:24,373 INFO L290 TraceCheckUtils]: 22: Hoare triple {26554#false} assume !false; {26554#false} is VALID [2022-02-20 14:39:24,373 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:24,373 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:24,373 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601494332] [2022-02-20 14:39:24,373 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1601494332] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:24,373 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:24,374 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:24,374 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462879811] [2022-02-20 14:39:24,375 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:24,375 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:24,375 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:24,376 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:24,390 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:24,390 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:24,391 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:24,391 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:24,391 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:24,391 INFO L87 Difference]: Start difference. First operand 1077 states and 1715 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:24,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:24,607 INFO L93 Difference]: Finished difference Result 1929 states and 3125 transitions. [2022-02-20 14:39:24,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:24,608 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:24,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:24,608 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:24,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2022-02-20 14:39:24,609 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:24,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 119 transitions. [2022-02-20 14:39:24,610 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 119 transitions. [2022-02-20 14:39:24,681 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:24,788 INFO L225 Difference]: With dead ends: 1929 [2022-02-20 14:39:24,788 INFO L226 Difference]: Without dead ends: 1927 [2022-02-20 14:39:24,788 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:24,789 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 38 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 129 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:24,789 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 129 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:24,791 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2022-02-20 14:39:24,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1541. [2022-02-20 14:39:24,818 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:24,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1927 states. Second operand has 1541 states, 1540 states have (on average 1.55) internal successors, (2387), 1540 states have internal predecessors, (2387), 0 states have call successors, (0), 0 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:24,823 INFO L74 IsIncluded]: Start isIncluded. First operand 1927 states. Second operand has 1541 states, 1540 states have (on average 1.55) internal successors, (2387), 1540 states have internal predecessors, (2387), 0 states have call successors, (0), 0 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:24,824 INFO L87 Difference]: Start difference. First operand 1927 states. Second operand has 1541 states, 1540 states have (on average 1.55) internal successors, (2387), 1540 states have internal predecessors, (2387), 0 states have call successors, (0), 0 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:24,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:24,938 INFO L93 Difference]: Finished difference Result 1927 states and 3092 transitions. [2022-02-20 14:39:24,938 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 3092 transitions. [2022-02-20 14:39:24,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:24,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:24,944 INFO L74 IsIncluded]: Start isIncluded. First operand has 1541 states, 1540 states have (on average 1.55) internal successors, (2387), 1540 states have internal predecessors, (2387), 0 states have call successors, (0), 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 1927 states. [2022-02-20 14:39:24,946 INFO L87 Difference]: Start difference. First operand has 1541 states, 1540 states have (on average 1.55) internal successors, (2387), 1540 states have internal predecessors, (2387), 0 states have call successors, (0), 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 1927 states. [2022-02-20 14:39:25,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:25,091 INFO L93 Difference]: Finished difference Result 1927 states and 3092 transitions. [2022-02-20 14:39:25,091 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 3092 transitions. [2022-02-20 14:39:25,093 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:25,094 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:25,094 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:25,094 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:25,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1540 states have (on average 1.55) internal successors, (2387), 1540 states have internal predecessors, (2387), 0 states have call successors, (0), 0 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:25,201 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2387 transitions. [2022-02-20 14:39:25,201 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2387 transitions. Word has length 23 [2022-02-20 14:39:25,201 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:25,201 INFO L470 AbstractCegarLoop]: Abstraction has 1541 states and 2387 transitions. [2022-02-20 14:39:25,202 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:25,202 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2387 transitions. [2022-02-20 14:39:25,203 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 14:39:25,204 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:25,204 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:25,204 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 14:39:25,204 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:25,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:25,205 INFO L85 PathProgramCache]: Analyzing trace with hash 991881511, now seen corresponding path program 1 times [2022-02-20 14:39:25,205 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:25,205 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522663245] [2022-02-20 14:39:25,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:25,205 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:25,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:25,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {33984#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(16, 2);call #Ultimate.allocInit(12, 3); {33984#true} is VALID [2022-02-20 14:39:25,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {33984#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_~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_~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;havoc main_~cond~0#1; {33984#true} is VALID [2022-02-20 14:39:25,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {33984#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {33984#true} is VALID [2022-02-20 14:39:25,244 INFO L290 TraceCheckUtils]: 3: Hoare triple {33984#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; {33984#true} is VALID [2022-02-20 14:39:25,244 INFO L290 TraceCheckUtils]: 4: Hoare triple {33984#true} assume !(0 != main_~p1~0#1); {33984#true} is VALID [2022-02-20 14:39:25,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {33984#true} assume !(0 != main_~p2~0#1); {33984#true} is VALID [2022-02-20 14:39:25,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {33984#true} assume !(0 != main_~p3~0#1); {33984#true} is VALID [2022-02-20 14:39:25,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {33984#true} assume !(0 != main_~p4~0#1); {33984#true} is VALID [2022-02-20 14:39:25,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {33984#true} assume !(0 != main_~p5~0#1); {33984#true} is VALID [2022-02-20 14:39:25,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {33984#true} assume !(0 != main_~p6~0#1); {33986#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:25,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {33986#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {33986#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:25,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {33986#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {33986#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:25,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {33986#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {33986#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:25,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {33986#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {33986#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:25,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {33986#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p11~0#1); {33986#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:25,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {33986#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p1~0#1); {33986#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:25,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {33986#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p2~0#1); {33986#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:25,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {33986#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p3~0#1); {33986#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:25,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {33986#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p4~0#1); {33986#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:25,249 INFO L290 TraceCheckUtils]: 19: Hoare triple {33986#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p5~0#1); {33986#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:25,250 INFO L290 TraceCheckUtils]: 20: Hoare triple {33986#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p6~0#1; {33985#false} is VALID [2022-02-20 14:39:25,250 INFO L290 TraceCheckUtils]: 21: Hoare triple {33985#false} assume 1 != main_~lk6~0#1; {33985#false} is VALID [2022-02-20 14:39:25,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {33985#false} assume !false; {33985#false} is VALID [2022-02-20 14:39:25,250 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:25,250 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:25,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522663245] [2022-02-20 14:39:25,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522663245] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:25,252 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:25,252 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:25,253 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331906290] [2022-02-20 14:39:25,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:25,253 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:25,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:25,253 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:25,268 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:25,268 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:25,268 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:25,268 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:25,269 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:25,269 INFO L87 Difference]: Start difference. First operand 1541 states and 2387 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:25,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:25,800 INFO L93 Difference]: Finished difference Result 3593 states and 5589 transitions. [2022-02-20 14:39:25,801 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:25,801 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:25,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:25,801 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:25,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2022-02-20 14:39:25,802 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:25,804 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 191 transitions. [2022-02-20 14:39:25,804 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 191 transitions. [2022-02-20 14:39:25,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 191 edges. 191 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:26,077 INFO L225 Difference]: With dead ends: 3593 [2022-02-20 14:39:26,077 INFO L226 Difference]: Without dead ends: 2087 [2022-02-20 14:39:26,079 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:26,080 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 48 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 162 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:26,080 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 162 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:26,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2022-02-20 14:39:26,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 2085. [2022-02-20 14:39:26,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:26,124 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2087 states. Second operand has 2085 states, 2084 states have (on average 1.5369481765834934) internal successors, (3203), 2084 states have internal predecessors, (3203), 0 states have call successors, (0), 0 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:26,126 INFO L74 IsIncluded]: Start isIncluded. First operand 2087 states. Second operand has 2085 states, 2084 states have (on average 1.5369481765834934) internal successors, (3203), 2084 states have internal predecessors, (3203), 0 states have call successors, (0), 0 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:26,128 INFO L87 Difference]: Start difference. First operand 2087 states. Second operand has 2085 states, 2084 states have (on average 1.5369481765834934) internal successors, (3203), 2084 states have internal predecessors, (3203), 0 states have call successors, (0), 0 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:26,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:26,297 INFO L93 Difference]: Finished difference Result 2087 states and 3204 transitions. [2022-02-20 14:39:26,297 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 3204 transitions. [2022-02-20 14:39:26,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:26,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:26,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 2085 states, 2084 states have (on average 1.5369481765834934) internal successors, (3203), 2084 states have internal predecessors, (3203), 0 states have call successors, (0), 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 2087 states. [2022-02-20 14:39:26,306 INFO L87 Difference]: Start difference. First operand has 2085 states, 2084 states have (on average 1.5369481765834934) internal successors, (3203), 2084 states have internal predecessors, (3203), 0 states have call successors, (0), 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 2087 states. [2022-02-20 14:39:26,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:26,445 INFO L93 Difference]: Finished difference Result 2087 states and 3204 transitions. [2022-02-20 14:39:26,445 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 3204 transitions. [2022-02-20 14:39:26,447 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:26,447 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:26,447 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:26,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:26,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2085 states, 2084 states have (on average 1.5369481765834934) internal successors, (3203), 2084 states have internal predecessors, (3203), 0 states have call successors, (0), 0 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:26,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 3203 transitions. [2022-02-20 14:39:26,618 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 3203 transitions. Word has length 23 [2022-02-20 14:39:26,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:26,619 INFO L470 AbstractCegarLoop]: Abstraction has 2085 states and 3203 transitions. [2022-02-20 14:39:26,619 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:26,619 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 3203 transitions. [2022-02-20 14:39:26,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 14:39:26,621 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:26,621 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:26,621 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 14:39:26,621 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:26,622 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:26,622 INFO L85 PathProgramCache]: Analyzing trace with hash 1963634176, now seen corresponding path program 1 times [2022-02-20 14:39:26,622 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:26,622 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1325746930] [2022-02-20 14:39:26,622 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:26,622 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:26,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:26,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {44007#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(16, 2);call #Ultimate.allocInit(12, 3); {44007#true} is VALID [2022-02-20 14:39:26,654 INFO L290 TraceCheckUtils]: 1: Hoare triple {44007#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_~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_~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;havoc main_~cond~0#1; {44007#true} is VALID [2022-02-20 14:39:26,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {44007#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {44007#true} is VALID [2022-02-20 14:39:26,654 INFO L290 TraceCheckUtils]: 3: Hoare triple {44007#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; {44007#true} is VALID [2022-02-20 14:39:26,654 INFO L290 TraceCheckUtils]: 4: Hoare triple {44007#true} assume !(0 != main_~p1~0#1); {44007#true} is VALID [2022-02-20 14:39:26,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {44007#true} assume !(0 != main_~p2~0#1); {44007#true} is VALID [2022-02-20 14:39:26,654 INFO L290 TraceCheckUtils]: 6: Hoare triple {44007#true} assume !(0 != main_~p3~0#1); {44007#true} is VALID [2022-02-20 14:39:26,655 INFO L290 TraceCheckUtils]: 7: Hoare triple {44007#true} assume !(0 != main_~p4~0#1); {44007#true} is VALID [2022-02-20 14:39:26,655 INFO L290 TraceCheckUtils]: 8: Hoare triple {44007#true} assume !(0 != main_~p5~0#1); {44007#true} is VALID [2022-02-20 14:39:26,655 INFO L290 TraceCheckUtils]: 9: Hoare triple {44007#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {44009#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:26,660 INFO L290 TraceCheckUtils]: 10: Hoare triple {44009#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {44009#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:26,661 INFO L290 TraceCheckUtils]: 11: Hoare triple {44009#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {44009#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:26,661 INFO L290 TraceCheckUtils]: 12: Hoare triple {44009#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {44009#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:26,662 INFO L290 TraceCheckUtils]: 13: Hoare triple {44009#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {44009#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:26,662 INFO L290 TraceCheckUtils]: 14: Hoare triple {44009#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p11~0#1); {44009#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:26,662 INFO L290 TraceCheckUtils]: 15: Hoare triple {44009#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p1~0#1); {44009#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:26,663 INFO L290 TraceCheckUtils]: 16: Hoare triple {44009#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p2~0#1); {44009#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:26,663 INFO L290 TraceCheckUtils]: 17: Hoare triple {44009#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p3~0#1); {44009#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:26,664 INFO L290 TraceCheckUtils]: 18: Hoare triple {44009#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p4~0#1); {44009#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:26,664 INFO L290 TraceCheckUtils]: 19: Hoare triple {44009#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p5~0#1); {44009#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:39:26,664 INFO L290 TraceCheckUtils]: 20: Hoare triple {44009#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p6~0#1); {44008#false} is VALID [2022-02-20 14:39:26,664 INFO L290 TraceCheckUtils]: 21: Hoare triple {44008#false} assume 0 != main_~p7~0#1; {44008#false} is VALID [2022-02-20 14:39:26,665 INFO L290 TraceCheckUtils]: 22: Hoare triple {44008#false} assume 1 != main_~lk7~0#1; {44008#false} is VALID [2022-02-20 14:39:26,665 INFO L290 TraceCheckUtils]: 23: Hoare triple {44008#false} assume !false; {44008#false} is VALID [2022-02-20 14:39:26,665 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:26,665 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:26,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1325746930] [2022-02-20 14:39:26,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1325746930] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:26,665 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:26,666 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:26,666 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1834764494] [2022-02-20 14:39:26,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:26,667 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:26,667 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:26,667 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:26,683 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:26,683 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:26,684 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:26,684 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:26,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:26,684 INFO L87 Difference]: Start difference. First operand 2085 states and 3203 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:27,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:27,174 INFO L93 Difference]: Finished difference Result 3129 states and 4789 transitions. [2022-02-20 14:39:27,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:27,175 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:27,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:27,175 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:27,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2022-02-20 14:39:27,176 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:27,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 186 transitions. [2022-02-20 14:39:27,177 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 186 transitions. [2022-02-20 14:39:27,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 186 edges. 186 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:27,505 INFO L225 Difference]: With dead ends: 3129 [2022-02-20 14:39:27,505 INFO L226 Difference]: Without dead ends: 2119 [2022-02-20 14:39:27,507 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:27,508 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 50 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 156 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:27,508 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 156 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:27,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2022-02-20 14:39:27,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 2117. [2022-02-20 14:39:27,552 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:27,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2119 states. Second operand has 2117 states, 2116 states have (on average 1.5137051039697542) internal successors, (3203), 2116 states have internal predecessors, (3203), 0 states have call successors, (0), 0 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:27,557 INFO L74 IsIncluded]: Start isIncluded. First operand 2119 states. Second operand has 2117 states, 2116 states have (on average 1.5137051039697542) internal successors, (3203), 2116 states have internal predecessors, (3203), 0 states have call successors, (0), 0 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:27,560 INFO L87 Difference]: Start difference. First operand 2119 states. Second operand has 2117 states, 2116 states have (on average 1.5137051039697542) internal successors, (3203), 2116 states have internal predecessors, (3203), 0 states have call successors, (0), 0 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:27,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:27,706 INFO L93 Difference]: Finished difference Result 2119 states and 3204 transitions. [2022-02-20 14:39:27,706 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 3204 transitions. [2022-02-20 14:39:27,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:27,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:27,710 INFO L74 IsIncluded]: Start isIncluded. First operand has 2117 states, 2116 states have (on average 1.5137051039697542) internal successors, (3203), 2116 states have internal predecessors, (3203), 0 states have call successors, (0), 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 2119 states. [2022-02-20 14:39:27,712 INFO L87 Difference]: Start difference. First operand has 2117 states, 2116 states have (on average 1.5137051039697542) internal successors, (3203), 2116 states have internal predecessors, (3203), 0 states have call successors, (0), 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 2119 states. [2022-02-20 14:39:27,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:27,877 INFO L93 Difference]: Finished difference Result 2119 states and 3204 transitions. [2022-02-20 14:39:27,877 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 3204 transitions. [2022-02-20 14:39:27,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:27,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:27,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:27,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:27,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 2116 states have (on average 1.5137051039697542) internal successors, (3203), 2116 states have internal predecessors, (3203), 0 states have call successors, (0), 0 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:28,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3203 transitions. [2022-02-20 14:39:28,066 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3203 transitions. Word has length 24 [2022-02-20 14:39:28,066 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:28,066 INFO L470 AbstractCegarLoop]: Abstraction has 2117 states and 3203 transitions. [2022-02-20 14:39:28,066 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:28,067 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3203 transitions. [2022-02-20 14:39:28,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 14:39:28,069 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:28,069 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:28,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 14:39:28,069 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:28,069 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:28,070 INFO L85 PathProgramCache]: Analyzing trace with hash 683770498, now seen corresponding path program 1 times [2022-02-20 14:39:28,071 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:28,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1559874014] [2022-02-20 14:39:28,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:28,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:28,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:28,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {53662#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(16, 2);call #Ultimate.allocInit(12, 3); {53662#true} is VALID [2022-02-20 14:39:28,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {53662#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_~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_~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;havoc main_~cond~0#1; {53662#true} is VALID [2022-02-20 14:39:28,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {53662#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {53662#true} is VALID [2022-02-20 14:39:28,100 INFO L290 TraceCheckUtils]: 3: Hoare triple {53662#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; {53662#true} is VALID [2022-02-20 14:39:28,100 INFO L290 TraceCheckUtils]: 4: Hoare triple {53662#true} assume !(0 != main_~p1~0#1); {53662#true} is VALID [2022-02-20 14:39:28,100 INFO L290 TraceCheckUtils]: 5: Hoare triple {53662#true} assume !(0 != main_~p2~0#1); {53662#true} is VALID [2022-02-20 14:39:28,101 INFO L290 TraceCheckUtils]: 6: Hoare triple {53662#true} assume !(0 != main_~p3~0#1); {53662#true} is VALID [2022-02-20 14:39:28,101 INFO L290 TraceCheckUtils]: 7: Hoare triple {53662#true} assume !(0 != main_~p4~0#1); {53662#true} is VALID [2022-02-20 14:39:28,101 INFO L290 TraceCheckUtils]: 8: Hoare triple {53662#true} assume !(0 != main_~p5~0#1); {53662#true} is VALID [2022-02-20 14:39:28,101 INFO L290 TraceCheckUtils]: 9: Hoare triple {53662#true} assume !(0 != main_~p6~0#1); {53662#true} is VALID [2022-02-20 14:39:28,101 INFO L290 TraceCheckUtils]: 10: Hoare triple {53662#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {53664#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:28,102 INFO L290 TraceCheckUtils]: 11: Hoare triple {53664#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {53664#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:28,102 INFO L290 TraceCheckUtils]: 12: Hoare triple {53664#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {53664#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:28,103 INFO L290 TraceCheckUtils]: 13: Hoare triple {53664#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {53664#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:28,103 INFO L290 TraceCheckUtils]: 14: Hoare triple {53664#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p11~0#1); {53664#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:28,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {53664#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p1~0#1); {53664#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:28,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {53664#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p2~0#1); {53664#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:28,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {53664#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p3~0#1); {53664#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:28,107 INFO L290 TraceCheckUtils]: 18: Hoare triple {53664#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p4~0#1); {53664#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:28,108 INFO L290 TraceCheckUtils]: 19: Hoare triple {53664#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p5~0#1); {53664#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:28,108 INFO L290 TraceCheckUtils]: 20: Hoare triple {53664#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p6~0#1); {53664#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:28,109 INFO L290 TraceCheckUtils]: 21: Hoare triple {53664#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p7~0#1; {53664#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:39:28,109 INFO L290 TraceCheckUtils]: 22: Hoare triple {53664#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 1 != main_~lk7~0#1; {53663#false} is VALID [2022-02-20 14:39:28,110 INFO L290 TraceCheckUtils]: 23: Hoare triple {53663#false} assume !false; {53663#false} is VALID [2022-02-20 14:39:28,110 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:28,110 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:28,110 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1559874014] [2022-02-20 14:39:28,111 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1559874014] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:28,111 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:28,111 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:28,111 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1332263925] [2022-02-20 14:39:28,111 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:28,111 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:28,112 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:28,112 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:28,128 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:28,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:28,128 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:28,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:28,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:28,129 INFO L87 Difference]: Start difference. First operand 2117 states and 3203 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:28,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:28,768 INFO L93 Difference]: Finished difference Result 3721 states and 5733 transitions. [2022-02-20 14:39:28,768 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:28,768 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:28,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:28,769 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:28,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-02-20 14:39:28,770 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:28,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2022-02-20 14:39:28,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 115 transitions. [2022-02-20 14:39:28,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:29,356 INFO L225 Difference]: With dead ends: 3721 [2022-02-20 14:39:29,356 INFO L226 Difference]: Without dead ends: 3719 [2022-02-20 14:39:29,357 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:29,358 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 35 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 127 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:29,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 127 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:29,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2022-02-20 14:39:29,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3077. [2022-02-20 14:39:29,415 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:29,419 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3719 states. Second operand has 3077 states, 3076 states have (on average 1.467815344603381) internal successors, (4515), 3076 states have internal predecessors, (4515), 0 states have call successors, (0), 0 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:29,422 INFO L74 IsIncluded]: Start isIncluded. First operand 3719 states. Second operand has 3077 states, 3076 states have (on average 1.467815344603381) internal successors, (4515), 3076 states have internal predecessors, (4515), 0 states have call successors, (0), 0 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:29,425 INFO L87 Difference]: Start difference. First operand 3719 states. Second operand has 3077 states, 3076 states have (on average 1.467815344603381) internal successors, (4515), 3076 states have internal predecessors, (4515), 0 states have call successors, (0), 0 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:29,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:29,888 INFO L93 Difference]: Finished difference Result 3719 states and 5668 transitions. [2022-02-20 14:39:29,888 INFO L276 IsEmpty]: Start isEmpty. Operand 3719 states and 5668 transitions. [2022-02-20 14:39:29,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:29,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:29,895 INFO L74 IsIncluded]: Start isIncluded. First operand has 3077 states, 3076 states have (on average 1.467815344603381) internal successors, (4515), 3076 states have internal predecessors, (4515), 0 states have call successors, (0), 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 3719 states. [2022-02-20 14:39:29,898 INFO L87 Difference]: Start difference. First operand has 3077 states, 3076 states have (on average 1.467815344603381) internal successors, (4515), 3076 states have internal predecessors, (4515), 0 states have call successors, (0), 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 3719 states. [2022-02-20 14:39:30,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:30,397 INFO L93 Difference]: Finished difference Result 3719 states and 5668 transitions. [2022-02-20 14:39:30,397 INFO L276 IsEmpty]: Start isEmpty. Operand 3719 states and 5668 transitions. [2022-02-20 14:39:30,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:30,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:30,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:30,402 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:30,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3077 states, 3076 states have (on average 1.467815344603381) internal successors, (4515), 3076 states have internal predecessors, (4515), 0 states have call successors, (0), 0 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:30,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 4515 transitions. [2022-02-20 14:39:30,719 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 4515 transitions. Word has length 24 [2022-02-20 14:39:30,719 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:30,719 INFO L470 AbstractCegarLoop]: Abstraction has 3077 states and 4515 transitions. [2022-02-20 14:39:30,720 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:30,720 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 4515 transitions. [2022-02-20 14:39:30,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 14:39:30,722 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:30,722 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:30,722 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 14:39:30,722 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:30,722 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:30,723 INFO L85 PathProgramCache]: Analyzing trace with hash -327346752, now seen corresponding path program 1 times [2022-02-20 14:39:30,723 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:30,723 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1577342368] [2022-02-20 14:39:30,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:30,723 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:30,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:30,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {68101#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(16, 2);call #Ultimate.allocInit(12, 3); {68101#true} is VALID [2022-02-20 14:39:30,754 INFO L290 TraceCheckUtils]: 1: Hoare triple {68101#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_~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_~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;havoc main_~cond~0#1; {68101#true} is VALID [2022-02-20 14:39:30,755 INFO L290 TraceCheckUtils]: 2: Hoare triple {68101#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {68101#true} is VALID [2022-02-20 14:39:30,755 INFO L290 TraceCheckUtils]: 3: Hoare triple {68101#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; {68101#true} is VALID [2022-02-20 14:39:30,755 INFO L290 TraceCheckUtils]: 4: Hoare triple {68101#true} assume !(0 != main_~p1~0#1); {68101#true} is VALID [2022-02-20 14:39:30,755 INFO L290 TraceCheckUtils]: 5: Hoare triple {68101#true} assume !(0 != main_~p2~0#1); {68101#true} is VALID [2022-02-20 14:39:30,755 INFO L290 TraceCheckUtils]: 6: Hoare triple {68101#true} assume !(0 != main_~p3~0#1); {68101#true} is VALID [2022-02-20 14:39:30,755 INFO L290 TraceCheckUtils]: 7: Hoare triple {68101#true} assume !(0 != main_~p4~0#1); {68101#true} is VALID [2022-02-20 14:39:30,756 INFO L290 TraceCheckUtils]: 8: Hoare triple {68101#true} assume !(0 != main_~p5~0#1); {68101#true} is VALID [2022-02-20 14:39:30,756 INFO L290 TraceCheckUtils]: 9: Hoare triple {68101#true} assume !(0 != main_~p6~0#1); {68101#true} is VALID [2022-02-20 14:39:30,756 INFO L290 TraceCheckUtils]: 10: Hoare triple {68101#true} assume !(0 != main_~p7~0#1); {68103#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:30,756 INFO L290 TraceCheckUtils]: 11: Hoare triple {68103#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {68103#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:30,757 INFO L290 TraceCheckUtils]: 12: Hoare triple {68103#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {68103#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:30,757 INFO L290 TraceCheckUtils]: 13: Hoare triple {68103#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {68103#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:30,758 INFO L290 TraceCheckUtils]: 14: Hoare triple {68103#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p11~0#1); {68103#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:30,758 INFO L290 TraceCheckUtils]: 15: Hoare triple {68103#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p1~0#1); {68103#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:30,758 INFO L290 TraceCheckUtils]: 16: Hoare triple {68103#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p2~0#1); {68103#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:30,759 INFO L290 TraceCheckUtils]: 17: Hoare triple {68103#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p3~0#1); {68103#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:30,759 INFO L290 TraceCheckUtils]: 18: Hoare triple {68103#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p4~0#1); {68103#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:30,759 INFO L290 TraceCheckUtils]: 19: Hoare triple {68103#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p5~0#1); {68103#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:30,760 INFO L290 TraceCheckUtils]: 20: Hoare triple {68103#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p6~0#1); {68103#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:39:30,760 INFO L290 TraceCheckUtils]: 21: Hoare triple {68103#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p7~0#1; {68102#false} is VALID [2022-02-20 14:39:30,760 INFO L290 TraceCheckUtils]: 22: Hoare triple {68102#false} assume 1 != main_~lk7~0#1; {68102#false} is VALID [2022-02-20 14:39:30,760 INFO L290 TraceCheckUtils]: 23: Hoare triple {68102#false} assume !false; {68102#false} is VALID [2022-02-20 14:39:30,761 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:30,761 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:30,761 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1577342368] [2022-02-20 14:39:30,761 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1577342368] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:30,761 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:30,761 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:30,762 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2139427340] [2022-02-20 14:39:30,762 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:30,762 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:30,762 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:30,762 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:30,778 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:30,779 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:30,779 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:30,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:30,780 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:30,780 INFO L87 Difference]: Start difference. First operand 3077 states and 4515 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:32,335 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:32,335 INFO L93 Difference]: Finished difference Result 7113 states and 10469 transitions. [2022-02-20 14:39:32,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:32,335 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:32,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:32,335 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:32,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2022-02-20 14:39:32,337 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:32,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 188 transitions. [2022-02-20 14:39:32,338 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 188 transitions. [2022-02-20 14:39:32,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:32,931 INFO L225 Difference]: With dead ends: 7113 [2022-02-20 14:39:32,931 INFO L226 Difference]: Without dead ends: 4103 [2022-02-20 14:39:32,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:32,935 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 47 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 163 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:32,935 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 163 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:32,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2022-02-20 14:39:33,013 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 4101. [2022-02-20 14:39:33,013 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:33,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4103 states. Second operand has 4101 states, 4100 states have (on average 1.4524390243902439) internal successors, (5955), 4100 states have internal predecessors, (5955), 0 states have call successors, (0), 0 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:33,021 INFO L74 IsIncluded]: Start isIncluded. First operand 4103 states. Second operand has 4101 states, 4100 states have (on average 1.4524390243902439) internal successors, (5955), 4100 states have internal predecessors, (5955), 0 states have call successors, (0), 0 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:33,025 INFO L87 Difference]: Start difference. First operand 4103 states. Second operand has 4101 states, 4100 states have (on average 1.4524390243902439) internal successors, (5955), 4100 states have internal predecessors, (5955), 0 states have call successors, (0), 0 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:33,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:33,460 INFO L93 Difference]: Finished difference Result 4103 states and 5956 transitions. [2022-02-20 14:39:33,460 INFO L276 IsEmpty]: Start isEmpty. Operand 4103 states and 5956 transitions. [2022-02-20 14:39:33,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:33,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:33,467 INFO L74 IsIncluded]: Start isIncluded. First operand has 4101 states, 4100 states have (on average 1.4524390243902439) internal successors, (5955), 4100 states have internal predecessors, (5955), 0 states have call successors, (0), 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 4103 states. [2022-02-20 14:39:33,469 INFO L87 Difference]: Start difference. First operand has 4101 states, 4100 states have (on average 1.4524390243902439) internal successors, (5955), 4100 states have internal predecessors, (5955), 0 states have call successors, (0), 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 4103 states. [2022-02-20 14:39:33,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:33,917 INFO L93 Difference]: Finished difference Result 4103 states and 5956 transitions. [2022-02-20 14:39:33,917 INFO L276 IsEmpty]: Start isEmpty. Operand 4103 states and 5956 transitions. [2022-02-20 14:39:33,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:33,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:33,921 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:33,921 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:33,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4101 states, 4100 states have (on average 1.4524390243902439) internal successors, (5955), 4100 states have internal predecessors, (5955), 0 states have call successors, (0), 0 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:34,428 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 5955 transitions. [2022-02-20 14:39:34,429 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 5955 transitions. Word has length 24 [2022-02-20 14:39:34,429 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:34,429 INFO L470 AbstractCegarLoop]: Abstraction has 4101 states and 5955 transitions. [2022-02-20 14:39:34,429 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:34,429 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 5955 transitions. [2022-02-20 14:39:34,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 14:39:34,431 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:34,431 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:34,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-20 14:39:34,432 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:34,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:34,432 INFO L85 PathProgramCache]: Analyzing trace with hash -277735972, now seen corresponding path program 1 times [2022-02-20 14:39:34,432 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:34,432 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1484172998] [2022-02-20 14:39:34,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:34,432 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:34,452 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:34,463 INFO L290 TraceCheckUtils]: 0: Hoare triple {87852#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(16, 2);call #Ultimate.allocInit(12, 3); {87852#true} is VALID [2022-02-20 14:39:34,463 INFO L290 TraceCheckUtils]: 1: Hoare triple {87852#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_~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_~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;havoc main_~cond~0#1; {87852#true} is VALID [2022-02-20 14:39:34,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {87852#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {87852#true} is VALID [2022-02-20 14:39:34,463 INFO L290 TraceCheckUtils]: 3: Hoare triple {87852#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; {87852#true} is VALID [2022-02-20 14:39:34,464 INFO L290 TraceCheckUtils]: 4: Hoare triple {87852#true} assume !(0 != main_~p1~0#1); {87852#true} is VALID [2022-02-20 14:39:34,464 INFO L290 TraceCheckUtils]: 5: Hoare triple {87852#true} assume !(0 != main_~p2~0#1); {87852#true} is VALID [2022-02-20 14:39:34,464 INFO L290 TraceCheckUtils]: 6: Hoare triple {87852#true} assume !(0 != main_~p3~0#1); {87852#true} is VALID [2022-02-20 14:39:34,464 INFO L290 TraceCheckUtils]: 7: Hoare triple {87852#true} assume !(0 != main_~p4~0#1); {87852#true} is VALID [2022-02-20 14:39:34,464 INFO L290 TraceCheckUtils]: 8: Hoare triple {87852#true} assume !(0 != main_~p5~0#1); {87852#true} is VALID [2022-02-20 14:39:34,464 INFO L290 TraceCheckUtils]: 9: Hoare triple {87852#true} assume !(0 != main_~p6~0#1); {87852#true} is VALID [2022-02-20 14:39:34,465 INFO L290 TraceCheckUtils]: 10: Hoare triple {87852#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {87854#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:34,465 INFO L290 TraceCheckUtils]: 11: Hoare triple {87854#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {87854#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:34,465 INFO L290 TraceCheckUtils]: 12: Hoare triple {87854#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {87854#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:34,466 INFO L290 TraceCheckUtils]: 13: Hoare triple {87854#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {87854#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:34,466 INFO L290 TraceCheckUtils]: 14: Hoare triple {87854#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p11~0#1); {87854#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:34,466 INFO L290 TraceCheckUtils]: 15: Hoare triple {87854#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p1~0#1); {87854#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:34,467 INFO L290 TraceCheckUtils]: 16: Hoare triple {87854#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p2~0#1); {87854#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:34,467 INFO L290 TraceCheckUtils]: 17: Hoare triple {87854#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p3~0#1); {87854#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:34,467 INFO L290 TraceCheckUtils]: 18: Hoare triple {87854#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p4~0#1); {87854#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:34,468 INFO L290 TraceCheckUtils]: 19: Hoare triple {87854#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p5~0#1); {87854#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:34,468 INFO L290 TraceCheckUtils]: 20: Hoare triple {87854#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p6~0#1); {87854#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:39:34,468 INFO L290 TraceCheckUtils]: 21: Hoare triple {87854#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p7~0#1); {87853#false} is VALID [2022-02-20 14:39:34,469 INFO L290 TraceCheckUtils]: 22: Hoare triple {87853#false} assume 0 != main_~p8~0#1; {87853#false} is VALID [2022-02-20 14:39:34,469 INFO L290 TraceCheckUtils]: 23: Hoare triple {87853#false} assume 1 != main_~lk8~0#1; {87853#false} is VALID [2022-02-20 14:39:34,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {87853#false} assume !false; {87853#false} is VALID [2022-02-20 14:39:34,469 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:34,469 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:34,469 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1484172998] [2022-02-20 14:39:34,470 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1484172998] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:34,470 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:34,470 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:34,470 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1082791504] [2022-02-20 14:39:34,470 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:34,470 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:34,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:34,471 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:34,486 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:34,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:34,486 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:34,486 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:34,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:34,487 INFO L87 Difference]: Start difference. First operand 4101 states and 5955 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:35,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:35,721 INFO L93 Difference]: Finished difference Result 6153 states and 8901 transitions. [2022-02-20 14:39:35,721 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:35,721 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:35,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:35,721 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:35,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2022-02-20 14:39:35,722 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:35,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 183 transitions. [2022-02-20 14:39:35,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 183 transitions. [2022-02-20 14:39:35,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:36,346 INFO L225 Difference]: With dead ends: 6153 [2022-02-20 14:39:36,347 INFO L226 Difference]: Without dead ends: 4167 [2022-02-20 14:39:36,348 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:36,349 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 49 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 152 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:36,349 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 152 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:36,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4167 states. [2022-02-20 14:39:36,416 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4167 to 4165. [2022-02-20 14:39:36,417 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:36,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4167 states. Second operand has 4165 states, 4164 states have (on average 1.430115273775216) internal successors, (5955), 4164 states have internal predecessors, (5955), 0 states have call successors, (0), 0 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:36,425 INFO L74 IsIncluded]: Start isIncluded. First operand 4167 states. Second operand has 4165 states, 4164 states have (on average 1.430115273775216) internal successors, (5955), 4164 states have internal predecessors, (5955), 0 states have call successors, (0), 0 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:36,429 INFO L87 Difference]: Start difference. First operand 4167 states. Second operand has 4165 states, 4164 states have (on average 1.430115273775216) internal successors, (5955), 4164 states have internal predecessors, (5955), 0 states have call successors, (0), 0 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:36,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:36,882 INFO L93 Difference]: Finished difference Result 4167 states and 5956 transitions. [2022-02-20 14:39:36,883 INFO L276 IsEmpty]: Start isEmpty. Operand 4167 states and 5956 transitions. [2022-02-20 14:39:36,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:36,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:36,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 4165 states, 4164 states have (on average 1.430115273775216) internal successors, (5955), 4164 states have internal predecessors, (5955), 0 states have call successors, (0), 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 4167 states. [2022-02-20 14:39:36,891 INFO L87 Difference]: Start difference. First operand has 4165 states, 4164 states have (on average 1.430115273775216) internal successors, (5955), 4164 states have internal predecessors, (5955), 0 states have call successors, (0), 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 4167 states. [2022-02-20 14:39:37,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:37,320 INFO L93 Difference]: Finished difference Result 4167 states and 5956 transitions. [2022-02-20 14:39:37,320 INFO L276 IsEmpty]: Start isEmpty. Operand 4167 states and 5956 transitions. [2022-02-20 14:39:37,323 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:37,323 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:37,323 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:37,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:37,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4165 states, 4164 states have (on average 1.430115273775216) internal successors, (5955), 4164 states have internal predecessors, (5955), 0 states have call successors, (0), 0 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:37,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4165 states to 4165 states and 5955 transitions. [2022-02-20 14:39:37,795 INFO L78 Accepts]: Start accepts. Automaton has 4165 states and 5955 transitions. Word has length 25 [2022-02-20 14:39:37,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:37,796 INFO L470 AbstractCegarLoop]: Abstraction has 4165 states and 5955 transitions. [2022-02-20 14:39:37,796 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:37,796 INFO L276 IsEmpty]: Start isEmpty. Operand 4165 states and 5955 transitions. [2022-02-20 14:39:37,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 14:39:37,798 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:37,798 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:37,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-20 14:39:37,799 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:37,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:37,799 INFO L85 PathProgramCache]: Analyzing trace with hash -1557599650, now seen corresponding path program 1 times [2022-02-20 14:39:37,799 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:37,800 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [411955420] [2022-02-20 14:39:37,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:37,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:37,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:37,824 INFO L290 TraceCheckUtils]: 0: Hoare triple {106835#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(16, 2);call #Ultimate.allocInit(12, 3); {106835#true} is VALID [2022-02-20 14:39:37,824 INFO L290 TraceCheckUtils]: 1: Hoare triple {106835#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_~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_~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;havoc main_~cond~0#1; {106835#true} is VALID [2022-02-20 14:39:37,825 INFO L290 TraceCheckUtils]: 2: Hoare triple {106835#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {106835#true} is VALID [2022-02-20 14:39:37,825 INFO L290 TraceCheckUtils]: 3: Hoare triple {106835#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; {106835#true} is VALID [2022-02-20 14:39:37,825 INFO L290 TraceCheckUtils]: 4: Hoare triple {106835#true} assume !(0 != main_~p1~0#1); {106835#true} is VALID [2022-02-20 14:39:37,825 INFO L290 TraceCheckUtils]: 5: Hoare triple {106835#true} assume !(0 != main_~p2~0#1); {106835#true} is VALID [2022-02-20 14:39:37,825 INFO L290 TraceCheckUtils]: 6: Hoare triple {106835#true} assume !(0 != main_~p3~0#1); {106835#true} is VALID [2022-02-20 14:39:37,825 INFO L290 TraceCheckUtils]: 7: Hoare triple {106835#true} assume !(0 != main_~p4~0#1); {106835#true} is VALID [2022-02-20 14:39:37,825 INFO L290 TraceCheckUtils]: 8: Hoare triple {106835#true} assume !(0 != main_~p5~0#1); {106835#true} is VALID [2022-02-20 14:39:37,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {106835#true} assume !(0 != main_~p6~0#1); {106835#true} is VALID [2022-02-20 14:39:37,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {106835#true} assume !(0 != main_~p7~0#1); {106835#true} is VALID [2022-02-20 14:39:37,826 INFO L290 TraceCheckUtils]: 11: Hoare triple {106835#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {106837#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:39:37,826 INFO L290 TraceCheckUtils]: 12: Hoare triple {106837#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {106837#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:39:37,827 INFO L290 TraceCheckUtils]: 13: Hoare triple {106837#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {106837#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:39:37,827 INFO L290 TraceCheckUtils]: 14: Hoare triple {106837#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p11~0#1); {106837#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:39:37,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {106837#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p1~0#1); {106837#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:39:37,828 INFO L290 TraceCheckUtils]: 16: Hoare triple {106837#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p2~0#1); {106837#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:39:37,828 INFO L290 TraceCheckUtils]: 17: Hoare triple {106837#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p3~0#1); {106837#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:39:37,828 INFO L290 TraceCheckUtils]: 18: Hoare triple {106837#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p4~0#1); {106837#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:39:37,829 INFO L290 TraceCheckUtils]: 19: Hoare triple {106837#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p5~0#1); {106837#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:39:37,829 INFO L290 TraceCheckUtils]: 20: Hoare triple {106837#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p6~0#1); {106837#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:39:37,830 INFO L290 TraceCheckUtils]: 21: Hoare triple {106837#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p7~0#1); {106837#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:39:37,830 INFO L290 TraceCheckUtils]: 22: Hoare triple {106837#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p8~0#1; {106837#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:39:37,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {106837#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 1 != main_~lk8~0#1; {106836#false} is VALID [2022-02-20 14:39:37,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {106836#false} assume !false; {106836#false} is VALID [2022-02-20 14:39:37,831 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:37,831 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:37,831 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [411955420] [2022-02-20 14:39:37,831 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [411955420] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:37,831 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:37,831 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:37,831 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969126709] [2022-02-20 14:39:37,832 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:37,832 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:37,832 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:37,832 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:37,851 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:37,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:37,852 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:37,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:37,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:37,852 INFO L87 Difference]: Start difference. First operand 4165 states and 5955 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:39,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:39,335 INFO L93 Difference]: Finished difference Result 7177 states and 10437 transitions. [2022-02-20 14:39:39,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:39,335 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:39,335 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:39,335 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:39,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-02-20 14:39:39,336 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:39,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-02-20 14:39:39,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-02-20 14:39:39,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:40,716 INFO L225 Difference]: With dead ends: 7177 [2022-02-20 14:39:40,716 INFO L226 Difference]: Without dead ends: 7175 [2022-02-20 14:39:40,717 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,717 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 32 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 125 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,717 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 125 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,721 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7175 states. [2022-02-20 14:39:40,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7175 to 6149. [2022-02-20 14:39:40,805 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:40,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7175 states. Second operand has 6149 states, 6148 states have (on average 1.385003253090436) internal successors, (8515), 6148 states have internal predecessors, (8515), 0 states have call successors, (0), 0 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,836 INFO L74 IsIncluded]: Start isIncluded. First operand 7175 states. Second operand has 6149 states, 6148 states have (on average 1.385003253090436) internal successors, (8515), 6148 states have internal predecessors, (8515), 0 states have call successors, (0), 0 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,842 INFO L87 Difference]: Start difference. First operand 7175 states. Second operand has 6149 states, 6148 states have (on average 1.385003253090436) internal successors, (8515), 6148 states have internal predecessors, (8515), 0 states have call successors, (0), 0 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,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:42,192 INFO L93 Difference]: Finished difference Result 7175 states and 10308 transitions. [2022-02-20 14:39:42,193 INFO L276 IsEmpty]: Start isEmpty. Operand 7175 states and 10308 transitions. [2022-02-20 14:39:42,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:42,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:42,205 INFO L74 IsIncluded]: Start isIncluded. First operand has 6149 states, 6148 states have (on average 1.385003253090436) internal successors, (8515), 6148 states have internal predecessors, (8515), 0 states have call successors, (0), 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 7175 states. [2022-02-20 14:39:42,207 INFO L87 Difference]: Start difference. First operand has 6149 states, 6148 states have (on average 1.385003253090436) internal successors, (8515), 6148 states have internal predecessors, (8515), 0 states have call successors, (0), 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 7175 states. [2022-02-20 14:39:43,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:43,594 INFO L93 Difference]: Finished difference Result 7175 states and 10308 transitions. [2022-02-20 14:39:43,594 INFO L276 IsEmpty]: Start isEmpty. Operand 7175 states and 10308 transitions. [2022-02-20 14:39:43,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:43,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:43,599 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:43,600 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:43,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6149 states, 6148 states have (on average 1.385003253090436) internal successors, (8515), 6148 states have internal predecessors, (8515), 0 states have call successors, (0), 0 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,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6149 states to 6149 states and 8515 transitions. [2022-02-20 14:39:44,663 INFO L78 Accepts]: Start accepts. Automaton has 6149 states and 8515 transitions. Word has length 25 [2022-02-20 14:39:44,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:44,664 INFO L470 AbstractCegarLoop]: Abstraction has 6149 states and 8515 transitions. [2022-02-20 14:39:44,664 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:44,664 INFO L276 IsEmpty]: Start isEmpty. Operand 6149 states and 8515 transitions. [2022-02-20 14:39:44,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 14:39:44,668 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:44,668 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:44,668 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-20 14:39:44,668 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:44,669 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:44,669 INFO L85 PathProgramCache]: Analyzing trace with hash 1726250396, now seen corresponding path program 1 times [2022-02-20 14:39:44,669 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:44,669 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565381901] [2022-02-20 14:39:44,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:44,669 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:44,683 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:44,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {134906#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(16, 2);call #Ultimate.allocInit(12, 3); {134906#true} is VALID [2022-02-20 14:39:44,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {134906#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_~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_~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;havoc main_~cond~0#1; {134906#true} is VALID [2022-02-20 14:39:44,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {134906#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {134906#true} is VALID [2022-02-20 14:39:44,706 INFO L290 TraceCheckUtils]: 3: Hoare triple {134906#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; {134906#true} is VALID [2022-02-20 14:39:44,706 INFO L290 TraceCheckUtils]: 4: Hoare triple {134906#true} assume !(0 != main_~p1~0#1); {134906#true} is VALID [2022-02-20 14:39:44,706 INFO L290 TraceCheckUtils]: 5: Hoare triple {134906#true} assume !(0 != main_~p2~0#1); {134906#true} is VALID [2022-02-20 14:39:44,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {134906#true} assume !(0 != main_~p3~0#1); {134906#true} is VALID [2022-02-20 14:39:44,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {134906#true} assume !(0 != main_~p4~0#1); {134906#true} is VALID [2022-02-20 14:39:44,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {134906#true} assume !(0 != main_~p5~0#1); {134906#true} is VALID [2022-02-20 14:39:44,707 INFO L290 TraceCheckUtils]: 9: Hoare triple {134906#true} assume !(0 != main_~p6~0#1); {134906#true} is VALID [2022-02-20 14:39:44,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {134906#true} assume !(0 != main_~p7~0#1); {134906#true} is VALID [2022-02-20 14:39:44,707 INFO L290 TraceCheckUtils]: 11: Hoare triple {134906#true} assume !(0 != main_~p8~0#1); {134908#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:39:44,707 INFO L290 TraceCheckUtils]: 12: Hoare triple {134908#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {134908#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:39:44,708 INFO L290 TraceCheckUtils]: 13: Hoare triple {134908#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {134908#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:39:44,708 INFO L290 TraceCheckUtils]: 14: Hoare triple {134908#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p11~0#1); {134908#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:39:44,709 INFO L290 TraceCheckUtils]: 15: Hoare triple {134908#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p1~0#1); {134908#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:39:44,709 INFO L290 TraceCheckUtils]: 16: Hoare triple {134908#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p2~0#1); {134908#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:39:44,709 INFO L290 TraceCheckUtils]: 17: Hoare triple {134908#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p3~0#1); {134908#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:39:44,710 INFO L290 TraceCheckUtils]: 18: Hoare triple {134908#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p4~0#1); {134908#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:39:44,710 INFO L290 TraceCheckUtils]: 19: Hoare triple {134908#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p5~0#1); {134908#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:39:44,710 INFO L290 TraceCheckUtils]: 20: Hoare triple {134908#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p6~0#1); {134908#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:39:44,711 INFO L290 TraceCheckUtils]: 21: Hoare triple {134908#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p7~0#1); {134908#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:39:44,711 INFO L290 TraceCheckUtils]: 22: Hoare triple {134908#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p8~0#1; {134907#false} is VALID [2022-02-20 14:39:44,711 INFO L290 TraceCheckUtils]: 23: Hoare triple {134907#false} assume 1 != main_~lk8~0#1; {134907#false} is VALID [2022-02-20 14:39:44,711 INFO L290 TraceCheckUtils]: 24: Hoare triple {134907#false} assume !false; {134907#false} is VALID [2022-02-20 14:39:44,711 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,712 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:44,712 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565381901] [2022-02-20 14:39:44,712 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1565381901] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:44,712 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:44,712 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:44,712 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494547830] [2022-02-20 14:39:44,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:44,713 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:44,713 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:44,713 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:44,729 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:44,729 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:44,729 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:44,730 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:44,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:44,731 INFO L87 Difference]: Start difference. First operand 6149 states and 8515 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:49,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:49,955 INFO L93 Difference]: Finished difference Result 14089 states and 19525 transitions. [2022-02-20 14:39:49,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:49,955 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:49,956 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:49,956 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:49,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2022-02-20 14:39:49,957 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:49,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 185 transitions. [2022-02-20 14:39:49,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 185 transitions. [2022-02-20 14:39:50,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 185 edges. 185 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:51,845 INFO L225 Difference]: With dead ends: 14089 [2022-02-20 14:39:51,845 INFO L226 Difference]: Without dead ends: 8071 [2022-02-20 14:39:51,849 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:51,849 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 46 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 164 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:51,849 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 164 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:51,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8071 states. [2022-02-20 14:39:51,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8071 to 8069. [2022-02-20 14:39:51,969 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:51,977 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8071 states. Second operand has 8069 states, 8068 states have (on average 1.364774417451661) internal successors, (11011), 8068 states have internal predecessors, (11011), 0 states have call successors, (0), 0 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,983 INFO L74 IsIncluded]: Start isIncluded. First operand 8071 states. Second operand has 8069 states, 8068 states have (on average 1.364774417451661) internal successors, (11011), 8068 states have internal predecessors, (11011), 0 states have call successors, (0), 0 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,990 INFO L87 Difference]: Start difference. First operand 8071 states. Second operand has 8069 states, 8068 states have (on average 1.364774417451661) internal successors, (11011), 8068 states have internal predecessors, (11011), 0 states have call successors, (0), 0 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:53,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:53,732 INFO L93 Difference]: Finished difference Result 8071 states and 11012 transitions. [2022-02-20 14:39:53,732 INFO L276 IsEmpty]: Start isEmpty. Operand 8071 states and 11012 transitions. [2022-02-20 14:39:53,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:53,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:53,744 INFO L74 IsIncluded]: Start isIncluded. First operand has 8069 states, 8068 states have (on average 1.364774417451661) internal successors, (11011), 8068 states have internal predecessors, (11011), 0 states have call successors, (0), 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 8071 states. [2022-02-20 14:39:53,749 INFO L87 Difference]: Start difference. First operand has 8069 states, 8068 states have (on average 1.364774417451661) internal successors, (11011), 8068 states have internal predecessors, (11011), 0 states have call successors, (0), 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 8071 states. [2022-02-20 14:39:55,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:55,455 INFO L93 Difference]: Finished difference Result 8071 states and 11012 transitions. [2022-02-20 14:39:55,455 INFO L276 IsEmpty]: Start isEmpty. Operand 8071 states and 11012 transitions. [2022-02-20 14:39:55,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:55,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:55,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:55,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:55,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8069 states, 8068 states have (on average 1.364774417451661) internal successors, (11011), 8068 states have internal predecessors, (11011), 0 states have call successors, (0), 0 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,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8069 states to 8069 states and 11011 transitions. [2022-02-20 14:39:57,113 INFO L78 Accepts]: Start accepts. Automaton has 8069 states and 11011 transitions. Word has length 25 [2022-02-20 14:39:57,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:57,113 INFO L470 AbstractCegarLoop]: Abstraction has 8069 states and 11011 transitions. [2022-02-20 14:39:57,113 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:57,113 INFO L276 IsEmpty]: Start isEmpty. Operand 8069 states and 11011 transitions. [2022-02-20 14:39:57,116 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 14:39:57,116 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:57,116 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:57,116 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-20 14:39:57,116 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:57,117 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:57,117 INFO L85 PathProgramCache]: Analyzing trace with hash -1040733483, now seen corresponding path program 1 times [2022-02-20 14:39:57,117 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:57,117 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1913148140] [2022-02-20 14:39:57,117 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:57,117 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:57,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:57,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {173857#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(16, 2);call #Ultimate.allocInit(12, 3); {173857#true} is VALID [2022-02-20 14:39:57,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {173857#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_~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_~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;havoc main_~cond~0#1; {173857#true} is VALID [2022-02-20 14:39:57,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {173857#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {173857#true} is VALID [2022-02-20 14:39:57,142 INFO L290 TraceCheckUtils]: 3: Hoare triple {173857#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; {173857#true} is VALID [2022-02-20 14:39:57,142 INFO L290 TraceCheckUtils]: 4: Hoare triple {173857#true} assume !(0 != main_~p1~0#1); {173857#true} is VALID [2022-02-20 14:39:57,142 INFO L290 TraceCheckUtils]: 5: Hoare triple {173857#true} assume !(0 != main_~p2~0#1); {173857#true} is VALID [2022-02-20 14:39:57,142 INFO L290 TraceCheckUtils]: 6: Hoare triple {173857#true} assume !(0 != main_~p3~0#1); {173857#true} is VALID [2022-02-20 14:39:57,142 INFO L290 TraceCheckUtils]: 7: Hoare triple {173857#true} assume !(0 != main_~p4~0#1); {173857#true} is VALID [2022-02-20 14:39:57,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {173857#true} assume !(0 != main_~p5~0#1); {173857#true} is VALID [2022-02-20 14:39:57,143 INFO L290 TraceCheckUtils]: 9: Hoare triple {173857#true} assume !(0 != main_~p6~0#1); {173857#true} is VALID [2022-02-20 14:39:57,143 INFO L290 TraceCheckUtils]: 10: Hoare triple {173857#true} assume !(0 != main_~p7~0#1); {173857#true} is VALID [2022-02-20 14:39:57,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {173857#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {173859#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:39:57,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {173859#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {173859#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:39:57,144 INFO L290 TraceCheckUtils]: 13: Hoare triple {173859#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {173859#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:39:57,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {173859#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p11~0#1); {173859#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:39:57,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {173859#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p1~0#1); {173859#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:39:57,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {173859#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p2~0#1); {173859#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:39:57,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {173859#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p3~0#1); {173859#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:39:57,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {173859#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p4~0#1); {173859#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:39:57,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {173859#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p5~0#1); {173859#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:39:57,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {173859#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p6~0#1); {173859#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:39:57,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {173859#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p7~0#1); {173859#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:39:57,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {173859#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p8~0#1); {173858#false} is VALID [2022-02-20 14:39:57,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {173858#false} assume 0 != main_~p9~0#1; {173858#false} is VALID [2022-02-20 14:39:57,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {173858#false} assume 1 != main_~lk9~0#1; {173858#false} is VALID [2022-02-20 14:39:57,147 INFO L290 TraceCheckUtils]: 25: Hoare triple {173858#false} assume !false; {173858#false} is VALID [2022-02-20 14:39:57,147 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,148 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:57,148 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1913148140] [2022-02-20 14:39:57,148 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1913148140] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:57,148 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:57,148 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:57,148 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [860900060] [2022-02-20 14:39:57,148 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:57,149 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:57,149 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:57,149 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:57,165 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:57,165 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:57,165 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:57,166 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:57,166 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:57,166 INFO L87 Difference]: Start difference. First operand 8069 states and 11011 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:40:00,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:00,888 INFO L93 Difference]: Finished difference Result 12105 states and 16453 transitions. [2022-02-20 14:40:00,888 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:00,888 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:40:00,888 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:00,889 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:40:00,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2022-02-20 14:40:00,889 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:40:00,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 180 transitions. [2022-02-20 14:40:00,890 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 180 transitions. [2022-02-20 14:40:00,986 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:02,741 INFO L225 Difference]: With dead ends: 12105 [2022-02-20 14:40:02,741 INFO L226 Difference]: Without dead ends: 8199 [2022-02-20 14:40:02,743 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:02,744 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 48 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 148 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:02,744 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 148 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:02,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8199 states. [2022-02-20 14:40:02,864 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8199 to 8197. [2022-02-20 14:40:02,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:02,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8199 states. Second operand has 8197 states, 8196 states have (on average 1.343460224499756) internal successors, (11011), 8196 states have internal predecessors, (11011), 0 states have call successors, (0), 0 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,880 INFO L74 IsIncluded]: Start isIncluded. First operand 8199 states. Second operand has 8197 states, 8196 states have (on average 1.343460224499756) internal successors, (11011), 8196 states have internal predecessors, (11011), 0 states have call successors, (0), 0 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,889 INFO L87 Difference]: Start difference. First operand 8199 states. Second operand has 8197 states, 8196 states have (on average 1.343460224499756) internal successors, (11011), 8196 states have internal predecessors, (11011), 0 states have call successors, (0), 0 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:04,660 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:04,660 INFO L93 Difference]: Finished difference Result 8199 states and 11012 transitions. [2022-02-20 14:40:04,661 INFO L276 IsEmpty]: Start isEmpty. Operand 8199 states and 11012 transitions. [2022-02-20 14:40:04,667 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:04,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:04,677 INFO L74 IsIncluded]: Start isIncluded. First operand has 8197 states, 8196 states have (on average 1.343460224499756) internal successors, (11011), 8196 states have internal predecessors, (11011), 0 states have call successors, (0), 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 8199 states. [2022-02-20 14:40:04,684 INFO L87 Difference]: Start difference. First operand has 8197 states, 8196 states have (on average 1.343460224499756) internal successors, (11011), 8196 states have internal predecessors, (11011), 0 states have call successors, (0), 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 8199 states. [2022-02-20 14:40:06,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:06,437 INFO L93 Difference]: Finished difference Result 8199 states and 11012 transitions. [2022-02-20 14:40:06,437 INFO L276 IsEmpty]: Start isEmpty. Operand 8199 states and 11012 transitions. [2022-02-20 14:40:06,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:06,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:06,477 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:06,477 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:06,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8197 states, 8196 states have (on average 1.343460224499756) internal successors, (11011), 8196 states have internal predecessors, (11011), 0 states have call successors, (0), 0 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:08,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8197 states to 8197 states and 11011 transitions. [2022-02-20 14:40:08,371 INFO L78 Accepts]: Start accepts. Automaton has 8197 states and 11011 transitions. Word has length 26 [2022-02-20 14:40:08,372 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:08,372 INFO L470 AbstractCegarLoop]: Abstraction has 8197 states and 11011 transitions. [2022-02-20 14:40:08,372 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:40:08,372 INFO L276 IsEmpty]: Start isEmpty. Operand 8197 states and 11011 transitions. [2022-02-20 14:40:08,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 14:40:08,375 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:08,375 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:40:08,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-20 14:40:08,375 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:08,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:08,376 INFO L85 PathProgramCache]: Analyzing trace with hash 1974370135, now seen corresponding path program 1 times [2022-02-20 14:40:08,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:08,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11747981] [2022-02-20 14:40:08,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:08,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:08,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:08,404 INFO L290 TraceCheckUtils]: 0: Hoare triple {211208#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(16, 2);call #Ultimate.allocInit(12, 3); {211208#true} is VALID [2022-02-20 14:40:08,405 INFO L290 TraceCheckUtils]: 1: Hoare triple {211208#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_~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_~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;havoc main_~cond~0#1; {211208#true} is VALID [2022-02-20 14:40:08,405 INFO L290 TraceCheckUtils]: 2: Hoare triple {211208#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {211208#true} is VALID [2022-02-20 14:40:08,405 INFO L290 TraceCheckUtils]: 3: Hoare triple {211208#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; {211208#true} is VALID [2022-02-20 14:40:08,405 INFO L290 TraceCheckUtils]: 4: Hoare triple {211208#true} assume !(0 != main_~p1~0#1); {211208#true} is VALID [2022-02-20 14:40:08,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {211208#true} assume !(0 != main_~p2~0#1); {211208#true} is VALID [2022-02-20 14:40:08,405 INFO L290 TraceCheckUtils]: 6: Hoare triple {211208#true} assume !(0 != main_~p3~0#1); {211208#true} is VALID [2022-02-20 14:40:08,406 INFO L290 TraceCheckUtils]: 7: Hoare triple {211208#true} assume !(0 != main_~p4~0#1); {211208#true} is VALID [2022-02-20 14:40:08,406 INFO L290 TraceCheckUtils]: 8: Hoare triple {211208#true} assume !(0 != main_~p5~0#1); {211208#true} is VALID [2022-02-20 14:40:08,406 INFO L290 TraceCheckUtils]: 9: Hoare triple {211208#true} assume !(0 != main_~p6~0#1); {211208#true} is VALID [2022-02-20 14:40:08,406 INFO L290 TraceCheckUtils]: 10: Hoare triple {211208#true} assume !(0 != main_~p7~0#1); {211208#true} is VALID [2022-02-20 14:40:08,406 INFO L290 TraceCheckUtils]: 11: Hoare triple {211208#true} assume !(0 != main_~p8~0#1); {211208#true} is VALID [2022-02-20 14:40:08,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {211208#true} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {211210#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:08,407 INFO L290 TraceCheckUtils]: 13: Hoare triple {211210#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {211210#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:08,407 INFO L290 TraceCheckUtils]: 14: Hoare triple {211210#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p11~0#1); {211210#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:08,407 INFO L290 TraceCheckUtils]: 15: Hoare triple {211210#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p1~0#1); {211210#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:08,408 INFO L290 TraceCheckUtils]: 16: Hoare triple {211210#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p2~0#1); {211210#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:08,408 INFO L290 TraceCheckUtils]: 17: Hoare triple {211210#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p3~0#1); {211210#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:08,408 INFO L290 TraceCheckUtils]: 18: Hoare triple {211210#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p4~0#1); {211210#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:08,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {211210#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p5~0#1); {211210#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:08,409 INFO L290 TraceCheckUtils]: 20: Hoare triple {211210#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p6~0#1); {211210#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:08,410 INFO L290 TraceCheckUtils]: 21: Hoare triple {211210#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p7~0#1); {211210#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:08,411 INFO L290 TraceCheckUtils]: 22: Hoare triple {211210#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p8~0#1); {211210#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:08,411 INFO L290 TraceCheckUtils]: 23: Hoare triple {211210#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 0 != main_~p9~0#1; {211210#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:08,411 INFO L290 TraceCheckUtils]: 24: Hoare triple {211210#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 1 != main_~lk9~0#1; {211209#false} is VALID [2022-02-20 14:40:08,411 INFO L290 TraceCheckUtils]: 25: Hoare triple {211209#false} assume !false; {211209#false} is VALID [2022-02-20 14:40:08,412 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:08,412 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:08,412 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11747981] [2022-02-20 14:40:08,412 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11747981] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:08,412 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:08,412 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:08,413 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1590672990] [2022-02-20 14:40:08,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:08,414 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:40:08,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:08,414 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:40:08,430 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:40:08,430 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:08,430 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:08,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:08,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:08,431 INFO L87 Difference]: Start difference. First operand 8197 states and 11011 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:40:13,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:13,523 INFO L93 Difference]: Finished difference Result 13833 states and 18821 transitions. [2022-02-20 14:40:13,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:13,524 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:40:13,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:13,524 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:40:13,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2022-02-20 14:40:13,524 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:40:13,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2022-02-20 14:40:13,525 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 107 transitions. [2022-02-20 14:40:13,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:18,828 INFO L225 Difference]: With dead ends: 13833 [2022-02-20 14:40:18,828 INFO L226 Difference]: Without dead ends: 13831 [2022-02-20 14:40:18,830 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:18,830 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 29 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 123 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:18,830 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 123 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:18,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13831 states. [2022-02-20 14:40:19,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13831 to 12293. [2022-02-20 14:40:19,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:19,013 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13831 states. Second operand has 12293 states, 12292 states have (on average 1.3019036771884152) internal successors, (16003), 12292 states have internal predecessors, (16003), 0 states have call successors, (0), 0 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:19,027 INFO L74 IsIncluded]: Start isIncluded. First operand 13831 states. Second operand has 12293 states, 12292 states have (on average 1.3019036771884152) internal successors, (16003), 12292 states have internal predecessors, (16003), 0 states have call successors, (0), 0 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:19,040 INFO L87 Difference]: Start difference. First operand 13831 states. Second operand has 12293 states, 12292 states have (on average 1.3019036771884152) internal successors, (16003), 12292 states have internal predecessors, (16003), 0 states have call successors, (0), 0 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:24,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:24,209 INFO L93 Difference]: Finished difference Result 13831 states and 18564 transitions. [2022-02-20 14:40:24,209 INFO L276 IsEmpty]: Start isEmpty. Operand 13831 states and 18564 transitions. [2022-02-20 14:40:24,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:24,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:24,278 INFO L74 IsIncluded]: Start isIncluded. First operand has 12293 states, 12292 states have (on average 1.3019036771884152) internal successors, (16003), 12292 states have internal predecessors, (16003), 0 states have call successors, (0), 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 13831 states. [2022-02-20 14:40:24,290 INFO L87 Difference]: Start difference. First operand has 12293 states, 12292 states have (on average 1.3019036771884152) internal successors, (16003), 12292 states have internal predecessors, (16003), 0 states have call successors, (0), 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 13831 states.