./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_9.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_9.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 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:39:55,454 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:39:55,455 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:39:55,505 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:39:55,505 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:39:55,508 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:39:55,509 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:39:55,515 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:39:55,517 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:39:55,518 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:39:55,518 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:39:55,519 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:39:55,520 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:39:55,521 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:39:55,523 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:39:55,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:39:55,527 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:39:55,532 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:39:55,534 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:39:55,536 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:39:55,539 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:39:55,540 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:39:55,541 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:39:55,542 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:39:55,543 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:39:55,546 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:39:55,546 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:39:55,547 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:39:55,548 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:39:55,548 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:39:55,548 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:39:55,549 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:39:55,550 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:39:55,550 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:39:55,551 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:39:55,552 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:39:55,552 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:39:55,553 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:39:55,553 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:39:55,553 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:39:55,554 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:39:55,555 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:55,577 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:39:55,577 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:39:55,577 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:39:55,577 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:39:55,578 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:39:55,578 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:39:55,579 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:39:55,579 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:39:55,579 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:39:55,580 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:39:55,580 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:39:55,580 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:39:55,581 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:39:55,581 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:39:55,581 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:39:55,581 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:39:55,581 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:39:55,581 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:39:55,582 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:39:55,582 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:39:55,582 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:39:55,582 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:39:55,582 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:39:55,582 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:39:55,582 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:39:55,583 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:39:55,583 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:39:55,583 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:39:55,583 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:39:55,583 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:39:55,583 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:39:55,584 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:39:55,584 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:39:55,584 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 -> 04dc39fb366d4472036345a213cca0ee8b355c41bc9af7e685ecaa2d36ed9484 [2022-02-20 14:39:55,781 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:39:55,802 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:39:55,804 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:39:55,805 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:39:55,805 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:39:55,806 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_9.c [2022-02-20 14:39:55,865 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06965786a/d9e5bd6a11574ad1ade2c4fe867d47d3/FLAGe2e87724c [2022-02-20 14:39:56,212 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:39:56,213 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_9.c [2022-02-20 14:39:56,217 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06965786a/d9e5bd6a11574ad1ade2c4fe867d47d3/FLAGe2e87724c [2022-02-20 14:39:56,226 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/06965786a/d9e5bd6a11574ad1ade2c4fe867d47d3 [2022-02-20 14:39:56,228 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:39:56,228 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:39:56,232 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:39:56,232 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:39:56,234 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:39:56,235 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:39:56" (1/1) ... [2022-02-20 14:39:56,236 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1e5699ea and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:56, skipping insertion in model container [2022-02-20 14:39:56,236 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:39:56" (1/1) ... [2022-02-20 14:39:56,241 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:39:56,259 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:39:56,395 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_9.c[3555,3568] [2022-02-20 14:39:56,397 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:39:56,403 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:39:56,420 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_9.c[3555,3568] [2022-02-20 14:39:56,421 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:39:56,430 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:39:56,439 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:56 WrapperNode [2022-02-20 14:39:56,439 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:39:56,440 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:39:56,441 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:39:56,441 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:39:56,446 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:56" (1/1) ... [2022-02-20 14:39:56,458 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:56" (1/1) ... [2022-02-20 14:39:56,484 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 127 [2022-02-20 14:39:56,488 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:39:56,489 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:39:56,489 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:39:56,489 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:39:56,495 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:56" (1/1) ... [2022-02-20 14:39:56,495 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:56" (1/1) ... [2022-02-20 14:39:56,498 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:56" (1/1) ... [2022-02-20 14:39:56,499 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:56" (1/1) ... [2022-02-20 14:39:56,509 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:56" (1/1) ... [2022-02-20 14:39:56,513 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:56" (1/1) ... [2022-02-20 14:39:56,514 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:56" (1/1) ... [2022-02-20 14:39:56,515 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:39:56,518 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:39:56,518 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:39:56,518 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:39:56,519 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:56" (1/1) ... [2022-02-20 14:39:56,523 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:39:56,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:39:56,546 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:56,552 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:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:39:56,580 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:39:56,580 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:39:56,581 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:39:56,629 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:39:56,630 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:39:56,882 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:39:56,887 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:39:56,887 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 14:39:56,888 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:39:56 BoogieIcfgContainer [2022-02-20 14:39:56,888 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:39:56,890 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:39:56,890 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:39:56,896 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:39:56,896 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:39:56" (1/3) ... [2022-02-20 14:39:56,897 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3677ac18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:39:56, skipping insertion in model container [2022-02-20 14:39:56,897 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:56" (2/3) ... [2022-02-20 14:39:56,898 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3677ac18 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:39:56, skipping insertion in model container [2022-02-20 14:39:56,898 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:39:56" (3/3) ... [2022-02-20 14:39:56,899 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_9.c [2022-02-20 14:39:56,902 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:39:56,903 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:39:56,944 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:39:56,955 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:56,956 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:39:56,975 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:56,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:39:56,983 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:56,984 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:56,984 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:56,988 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:56,988 INFO L85 PathProgramCache]: Analyzing trace with hash -1657621241, now seen corresponding path program 1 times [2022-02-20 14:39:56,995 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:56,996 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817178663] [2022-02-20 14:39:56,996 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:56,997 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:57,203 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#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(15, 2);call #Ultimate.allocInit(12, 3); {40#true} is VALID [2022-02-20 14:39:57,204 INFO L290 TraceCheckUtils]: 1: Hoare triple {40#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_~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_~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;havoc main_~cond~0#1; {40#true} is VALID [2022-02-20 14:39:57,205 INFO L290 TraceCheckUtils]: 2: Hoare triple {40#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {40#true} is VALID [2022-02-20 14:39:57,206 INFO L290 TraceCheckUtils]: 3: Hoare triple {40#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; {40#true} is VALID [2022-02-20 14:39:57,207 INFO L290 TraceCheckUtils]: 4: Hoare triple {40#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {42#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:57,208 INFO L290 TraceCheckUtils]: 5: Hoare triple {42#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {42#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:57,209 INFO L290 TraceCheckUtils]: 6: Hoare triple {42#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume !(0 != main_~p3~0#1); {42#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:57,209 INFO L290 TraceCheckUtils]: 7: Hoare triple {42#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {42#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:57,210 INFO L290 TraceCheckUtils]: 8: Hoare triple {42#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {42#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:57,211 INFO L290 TraceCheckUtils]: 9: Hoare triple {42#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {42#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:57,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {42#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {42#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:57,212 INFO L290 TraceCheckUtils]: 11: Hoare triple {42#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {42#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:57,213 INFO L290 TraceCheckUtils]: 12: Hoare triple {42#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {42#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:57,213 INFO L290 TraceCheckUtils]: 13: Hoare triple {42#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p1~0#1; {42#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:57,214 INFO L290 TraceCheckUtils]: 14: Hoare triple {42#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 1 != main_~lk1~0#1; {41#false} is VALID [2022-02-20 14:39:57,215 INFO L290 TraceCheckUtils]: 15: Hoare triple {41#false} assume !false; {41#false} is VALID [2022-02-20 14:39:57,215 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,216 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:57,216 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817178663] [2022-02-20 14:39:57,217 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817178663] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:57,217 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:57,218 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:57,220 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096319825] [2022-02-20 14:39:57,221 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:57,224 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:39:57,225 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:57,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:57,267 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:57,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:57,268 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:57,284 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:57,285 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:57,289 INFO L87 Difference]: Start difference. First operand has 37 states, 35 states have (on average 1.8857142857142857) internal successors, (66), 36 states have internal predecessors, (66), 0 states have call successors, (0), 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 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:57,419 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,420 INFO L93 Difference]: Finished difference Result 77 states and 133 transitions. [2022-02-20 14:39:57,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:57,420 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:39:57,420 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:57,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:57,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2022-02-20 14:39:57,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:57,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2022-02-20 14:39:57,450 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 133 transitions. [2022-02-20 14:39:57,552 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:57,560 INFO L225 Difference]: With dead ends: 77 [2022-02-20 14:39:57,560 INFO L226 Difference]: Without dead ends: 63 [2022-02-20 14:39:57,563 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:57,565 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 47 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 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:57,566 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 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:57,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-02-20 14:39:57,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 43. [2022-02-20 14:39:57,601 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:57,602 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 43 states, 42 states have (on average 1.8571428571428572) 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:57,602 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 43 states, 42 states have (on average 1.8571428571428572) 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:57,603 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 43 states, 42 states have (on average 1.8571428571428572) 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:57,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,609 INFO L93 Difference]: Finished difference Result 63 states and 113 transitions. [2022-02-20 14:39:57,610 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 113 transitions. [2022-02-20 14:39:57,610 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:57,610 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:57,611 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 42 states have (on average 1.8571428571428572) 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 63 states. [2022-02-20 14:39:57,612 INFO L87 Difference]: Start difference. First operand has 43 states, 42 states have (on average 1.8571428571428572) 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 63 states. [2022-02-20 14:39:57,616 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,616 INFO L93 Difference]: Finished difference Result 63 states and 113 transitions. [2022-02-20 14:39:57,617 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 113 transitions. [2022-02-20 14:39:57,617 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:57,617 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:57,618 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:57,618 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:57,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.8571428571428572) 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:57,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 78 transitions. [2022-02-20 14:39:57,622 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 78 transitions. Word has length 16 [2022-02-20 14:39:57,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:57,622 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 78 transitions. [2022-02-20 14:39:57,622 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:57,623 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 78 transitions. [2022-02-20 14:39:57,623 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:39:57,623 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:57,623 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:57,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:39:57,624 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:57,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:57,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1399455803, now seen corresponding path program 1 times [2022-02-20 14:39:57,625 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:57,639 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [96061592] [2022-02-20 14:39:57,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:57,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:57,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:57,687 INFO L290 TraceCheckUtils]: 0: Hoare triple {304#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(15, 2);call #Ultimate.allocInit(12, 3); {304#true} is VALID [2022-02-20 14:39:57,689 INFO L290 TraceCheckUtils]: 1: Hoare triple {304#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_~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_~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;havoc main_~cond~0#1; {304#true} is VALID [2022-02-20 14:39:57,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {304#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {304#true} is VALID [2022-02-20 14:39:57,690 INFO L290 TraceCheckUtils]: 3: Hoare triple {304#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; {304#true} is VALID [2022-02-20 14:39:57,690 INFO L290 TraceCheckUtils]: 4: Hoare triple {304#true} assume !(0 != main_~p1~0#1); {306#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:57,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {306#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {306#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:57,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {306#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume !(0 != main_~p3~0#1); {306#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:57,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {306#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {306#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:57,692 INFO L290 TraceCheckUtils]: 8: Hoare triple {306#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {306#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:57,692 INFO L290 TraceCheckUtils]: 9: Hoare triple {306#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {306#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:57,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {306#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {306#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:57,693 INFO L290 TraceCheckUtils]: 11: Hoare triple {306#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {306#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:57,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {306#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {306#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:57,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {306#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p1~0#1; {305#false} is VALID [2022-02-20 14:39:57,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {305#false} assume 1 != main_~lk1~0#1; {305#false} is VALID [2022-02-20 14:39:57,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {305#false} assume !false; {305#false} is VALID [2022-02-20 14:39:57,694 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,694 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:57,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [96061592] [2022-02-20 14:39:57,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [96061592] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:57,694 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:57,694 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:57,694 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150363134] [2022-02-20 14:39:57,695 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:57,696 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:39:57,696 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:57,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:57,706 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:57,706 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:57,706 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:57,706 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:57,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:57,707 INFO L87 Difference]: Start difference. First operand 43 states and 78 transitions. Second operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:57,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,764 INFO L93 Difference]: Finished difference Result 104 states and 189 transitions. [2022-02-20 14:39:57,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:57,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:39:57,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:57,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:57,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2022-02-20 14:39:57,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:57,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 170 transitions. [2022-02-20 14:39:57,770 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 170 transitions. [2022-02-20 14:39:57,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:57,896 INFO L225 Difference]: With dead ends: 104 [2022-02-20 14:39:57,896 INFO L226 Difference]: Without dead ends: 63 [2022-02-20 14:39:57,899 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:57,902 INFO L933 BasicCegarLoop]: 76 mSDtfsCounter, 43 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 129 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:57,902 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 129 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:57,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-02-20 14:39:57,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 61. [2022-02-20 14:39:57,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:57,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 61 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 60 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (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,914 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 61 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 60 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (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,916 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 61 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 60 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (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,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,920 INFO L93 Difference]: Finished difference Result 63 states and 111 transitions. [2022-02-20 14:39:57,921 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 111 transitions. [2022-02-20 14:39:57,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:57,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:57,923 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 60 states have internal predecessors, (110), 0 states have call successors, (0), 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 63 states. [2022-02-20 14:39:57,924 INFO L87 Difference]: Start difference. First operand has 61 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 60 states have internal predecessors, (110), 0 states have call successors, (0), 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 63 states. [2022-02-20 14:39:57,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:57,943 INFO L93 Difference]: Finished difference Result 63 states and 111 transitions. [2022-02-20 14:39:57,943 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 111 transitions. [2022-02-20 14:39:57,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:57,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:57,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:57,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:57,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.8333333333333333) internal successors, (110), 60 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (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,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 110 transitions. [2022-02-20 14:39:57,946 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 110 transitions. Word has length 16 [2022-02-20 14:39:57,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:57,946 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 110 transitions. [2022-02-20 14:39:57,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.333333333333333) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:57,946 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 110 transitions. [2022-02-20 14:39:57,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 14:39:57,947 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:57,947 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:57,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:39:57,947 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:57,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:57,948 INFO L85 PathProgramCache]: Analyzing trace with hash 153562753, now seen corresponding path program 1 times [2022-02-20 14:39:57,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:57,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [718742012] [2022-02-20 14:39:57,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:57,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:57,976 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:58,003 INFO L290 TraceCheckUtils]: 0: Hoare triple {609#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(15, 2);call #Ultimate.allocInit(12, 3); {609#true} is VALID [2022-02-20 14:39:58,003 INFO L290 TraceCheckUtils]: 1: Hoare triple {609#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_~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_~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;havoc main_~cond~0#1; {609#true} is VALID [2022-02-20 14:39:58,004 INFO L290 TraceCheckUtils]: 2: Hoare triple {609#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {609#true} is VALID [2022-02-20 14:39:58,004 INFO L290 TraceCheckUtils]: 3: Hoare triple {609#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; {609#true} is VALID [2022-02-20 14:39:58,005 INFO L290 TraceCheckUtils]: 4: Hoare triple {609#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {611#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:58,005 INFO L290 TraceCheckUtils]: 5: Hoare triple {611#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {611#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:58,006 INFO L290 TraceCheckUtils]: 6: Hoare triple {611#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p3~0#1); {611#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:58,006 INFO L290 TraceCheckUtils]: 7: Hoare triple {611#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {611#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:58,007 INFO L290 TraceCheckUtils]: 8: Hoare triple {611#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {611#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:58,007 INFO L290 TraceCheckUtils]: 9: Hoare triple {611#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {611#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:58,008 INFO L290 TraceCheckUtils]: 10: Hoare triple {611#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {611#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:58,008 INFO L290 TraceCheckUtils]: 11: Hoare triple {611#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {611#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:58,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {611#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {611#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:58,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {611#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p1~0#1); {610#false} is VALID [2022-02-20 14:39:58,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {610#false} assume 0 != main_~p2~0#1; {610#false} is VALID [2022-02-20 14:39:58,009 INFO L290 TraceCheckUtils]: 15: Hoare triple {610#false} assume 1 != main_~lk2~0#1; {610#false} is VALID [2022-02-20 14:39:58,009 INFO L290 TraceCheckUtils]: 16: Hoare triple {610#false} assume !false; {610#false} is VALID [2022-02-20 14:39:58,009 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:58,009 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:58,010 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [718742012] [2022-02-20 14:39:58,010 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [718742012] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:58,010 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:58,010 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:58,011 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756339562] [2022-02-20 14:39:58,011 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:58,011 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 14:39:58,011 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:58,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,023 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:58,023 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:58,024 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:58,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:58,028 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:58,028 INFO L87 Difference]: Start difference. First operand 61 states and 110 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:58,114 INFO L93 Difference]: Finished difference Result 96 states and 168 transitions. [2022-02-20 14:39:58,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:58,114 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 14:39:58,114 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:58,114 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2022-02-20 14:39:58,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2022-02-20 14:39:58,117 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 165 transitions. [2022-02-20 14:39:58,213 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:58,216 INFO L225 Difference]: With dead ends: 96 [2022-02-20 14:39:58,216 INFO L226 Difference]: Without dead ends: 66 [2022-02-20 14:39:58,217 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:58,222 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 45 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 45 SdHoareTripleChecker+Valid, 144 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:58,223 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [45 Valid, 144 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:58,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-20 14:39:58,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 64. [2022-02-20 14:39:58,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:58,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 64 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 63 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,234 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 64 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 63 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,234 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 64 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 63 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:58,236 INFO L93 Difference]: Finished difference Result 66 states and 113 transitions. [2022-02-20 14:39:58,236 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 113 transitions. [2022-02-20 14:39:58,239 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:58,239 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:58,239 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 63 states have internal predecessors, (112), 0 states have call successors, (0), 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 66 states. [2022-02-20 14:39:58,239 INFO L87 Difference]: Start difference. First operand has 64 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 63 states have internal predecessors, (112), 0 states have call successors, (0), 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 66 states. [2022-02-20 14:39:58,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:58,242 INFO L93 Difference]: Finished difference Result 66 states and 113 transitions. [2022-02-20 14:39:58,242 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 113 transitions. [2022-02-20 14:39:58,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:58,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:58,243 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:58,244 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:58,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.7777777777777777) internal successors, (112), 63 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 112 transitions. [2022-02-20 14:39:58,246 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 112 transitions. Word has length 17 [2022-02-20 14:39:58,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:58,246 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 112 transitions. [2022-02-20 14:39:58,247 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,247 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 112 transitions. [2022-02-20 14:39:58,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 14:39:58,248 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:58,248 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:58,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 14:39:58,249 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:58,250 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:58,250 INFO L85 PathProgramCache]: Analyzing trace with hash -433243261, now seen corresponding path program 1 times [2022-02-20 14:39:58,250 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:58,250 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [885840765] [2022-02-20 14:39:58,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:58,251 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:58,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:58,329 INFO L290 TraceCheckUtils]: 0: Hoare triple {917#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(15, 2);call #Ultimate.allocInit(12, 3); {917#true} is VALID [2022-02-20 14:39:58,329 INFO L290 TraceCheckUtils]: 1: Hoare triple {917#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_~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_~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;havoc main_~cond~0#1; {917#true} is VALID [2022-02-20 14:39:58,329 INFO L290 TraceCheckUtils]: 2: Hoare triple {917#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {917#true} is VALID [2022-02-20 14:39:58,330 INFO L290 TraceCheckUtils]: 3: Hoare triple {917#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; {917#true} is VALID [2022-02-20 14:39:58,330 INFO L290 TraceCheckUtils]: 4: Hoare triple {917#true} assume !(0 != main_~p1~0#1); {917#true} is VALID [2022-02-20 14:39:58,330 INFO L290 TraceCheckUtils]: 5: Hoare triple {917#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {919#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:58,330 INFO L290 TraceCheckUtils]: 6: Hoare triple {919#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p3~0#1); {919#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:58,331 INFO L290 TraceCheckUtils]: 7: Hoare triple {919#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {919#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:58,331 INFO L290 TraceCheckUtils]: 8: Hoare triple {919#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {919#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:58,331 INFO L290 TraceCheckUtils]: 9: Hoare triple {919#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {919#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:58,332 INFO L290 TraceCheckUtils]: 10: Hoare triple {919#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {919#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:58,332 INFO L290 TraceCheckUtils]: 11: Hoare triple {919#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {919#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:58,332 INFO L290 TraceCheckUtils]: 12: Hoare triple {919#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {919#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:58,332 INFO L290 TraceCheckUtils]: 13: Hoare triple {919#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p1~0#1); {919#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:58,333 INFO L290 TraceCheckUtils]: 14: Hoare triple {919#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p2~0#1; {919#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:58,333 INFO L290 TraceCheckUtils]: 15: Hoare triple {919#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 1 != main_~lk2~0#1; {918#false} is VALID [2022-02-20 14:39:58,333 INFO L290 TraceCheckUtils]: 16: Hoare triple {918#false} assume !false; {918#false} is VALID [2022-02-20 14:39:58,333 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:58,334 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:58,334 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [885840765] [2022-02-20 14:39:58,334 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [885840765] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:58,334 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:58,334 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:58,334 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1798384878] [2022-02-20 14:39:58,334 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:58,334 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 14:39:58,334 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:58,334 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,344 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:58,344 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:58,344 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:58,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:58,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:58,345 INFO L87 Difference]: Start difference. First operand 64 states and 112 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:58,412 INFO L93 Difference]: Finished difference Result 121 states and 213 transitions. [2022-02-20 14:39:58,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:58,412 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 14:39:58,412 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:58,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-02-20 14:39:58,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,414 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-02-20 14:39:58,414 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-02-20 14:39:58,483 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:58,485 INFO L225 Difference]: With dead ends: 121 [2022-02-20 14:39:58,485 INFO L226 Difference]: Without dead ends: 119 [2022-02-20 14:39:58,486 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:58,486 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 40 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 113 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:58,487 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 113 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:58,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-02-20 14:39:58,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 85. [2022-02-20 14:39:58,491 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:58,492 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 85 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 84 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,492 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 85 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 84 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,492 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 85 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 84 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:58,495 INFO L93 Difference]: Finished difference Result 119 states and 210 transitions. [2022-02-20 14:39:58,495 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 210 transitions. [2022-02-20 14:39:58,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:58,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:58,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 84 states have internal predecessors, (149), 0 states have call successors, (0), 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 119 states. [2022-02-20 14:39:58,496 INFO L87 Difference]: Start difference. First operand has 85 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 84 states have internal predecessors, (149), 0 states have call successors, (0), 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 119 states. [2022-02-20 14:39:58,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:58,500 INFO L93 Difference]: Finished difference Result 119 states and 210 transitions. [2022-02-20 14:39:58,500 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 210 transitions. [2022-02-20 14:39:58,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:58,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:58,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:58,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:58,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.7738095238095237) internal successors, (149), 84 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 149 transitions. [2022-02-20 14:39:58,503 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 149 transitions. Word has length 17 [2022-02-20 14:39:58,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:58,503 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 149 transitions. [2022-02-20 14:39:58,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,503 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 149 transitions. [2022-02-20 14:39:58,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 14:39:58,504 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:58,504 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:58,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 14:39:58,504 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:58,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:58,505 INFO L85 PathProgramCache]: Analyzing trace with hash -175077823, now seen corresponding path program 1 times [2022-02-20 14:39:58,505 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:58,505 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1914564072] [2022-02-20 14:39:58,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:58,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:58,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:58,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {1378#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(15, 2);call #Ultimate.allocInit(12, 3); {1378#true} is VALID [2022-02-20 14:39:58,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {1378#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_~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_~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;havoc main_~cond~0#1; {1378#true} is VALID [2022-02-20 14:39:58,538 INFO L290 TraceCheckUtils]: 2: Hoare triple {1378#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {1378#true} is VALID [2022-02-20 14:39:58,538 INFO L290 TraceCheckUtils]: 3: Hoare triple {1378#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; {1378#true} is VALID [2022-02-20 14:39:58,538 INFO L290 TraceCheckUtils]: 4: Hoare triple {1378#true} assume !(0 != main_~p1~0#1); {1378#true} is VALID [2022-02-20 14:39:58,539 INFO L290 TraceCheckUtils]: 5: Hoare triple {1378#true} assume !(0 != main_~p2~0#1); {1380#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:58,539 INFO L290 TraceCheckUtils]: 6: Hoare triple {1380#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p3~0#1); {1380#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:58,540 INFO L290 TraceCheckUtils]: 7: Hoare triple {1380#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1380#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:58,540 INFO L290 TraceCheckUtils]: 8: Hoare triple {1380#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1380#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:58,540 INFO L290 TraceCheckUtils]: 9: Hoare triple {1380#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1380#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:58,541 INFO L290 TraceCheckUtils]: 10: Hoare triple {1380#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1380#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:58,541 INFO L290 TraceCheckUtils]: 11: Hoare triple {1380#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1380#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:58,541 INFO L290 TraceCheckUtils]: 12: Hoare triple {1380#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {1380#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:58,542 INFO L290 TraceCheckUtils]: 13: Hoare triple {1380#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p1~0#1); {1380#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:58,542 INFO L290 TraceCheckUtils]: 14: Hoare triple {1380#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p2~0#1; {1379#false} is VALID [2022-02-20 14:39:58,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {1379#false} assume 1 != main_~lk2~0#1; {1379#false} is VALID [2022-02-20 14:39:58,542 INFO L290 TraceCheckUtils]: 16: Hoare triple {1379#false} assume !false; {1379#false} is VALID [2022-02-20 14:39:58,542 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:58,543 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:58,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1914564072] [2022-02-20 14:39:58,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1914564072] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:58,543 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:58,543 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:58,543 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [751585800] [2022-02-20 14:39:58,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:58,543 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 14:39:58,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:58,544 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:58,555 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:58,555 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:58,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:58,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:58,555 INFO L87 Difference]: Start difference. First operand 85 states and 149 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,619 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:58,620 INFO L93 Difference]: Finished difference Result 201 states and 355 transitions. [2022-02-20 14:39:58,620 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:58,620 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 14:39:58,620 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:58,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2022-02-20 14:39:58,622 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 167 transitions. [2022-02-20 14:39:58,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 167 transitions. [2022-02-20 14:39:58,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:58,725 INFO L225 Difference]: With dead ends: 201 [2022-02-20 14:39:58,725 INFO L226 Difference]: Without dead ends: 121 [2022-02-20 14:39:58,725 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:58,726 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 130 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:58,726 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 130 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:58,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-02-20 14:39:58,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 119. [2022-02-20 14:39:58,730 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:58,731 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 119 states, 118 states have (on average 1.7542372881355932) internal successors, (207), 118 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,731 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 119 states, 118 states have (on average 1.7542372881355932) internal successors, (207), 118 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,731 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 119 states, 118 states have (on average 1.7542372881355932) internal successors, (207), 118 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:58,736 INFO L93 Difference]: Finished difference Result 121 states and 208 transitions. [2022-02-20 14:39:58,736 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 208 transitions. [2022-02-20 14:39:58,736 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:58,736 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:58,736 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 118 states have (on average 1.7542372881355932) internal successors, (207), 118 states have internal predecessors, (207), 0 states have call successors, (0), 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 121 states. [2022-02-20 14:39:58,737 INFO L87 Difference]: Start difference. First operand has 119 states, 118 states have (on average 1.7542372881355932) internal successors, (207), 118 states have internal predecessors, (207), 0 states have call successors, (0), 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 121 states. [2022-02-20 14:39:58,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:58,741 INFO L93 Difference]: Finished difference Result 121 states and 208 transitions. [2022-02-20 14:39:58,741 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 208 transitions. [2022-02-20 14:39:58,741 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:58,741 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:58,741 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:58,742 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:58,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 118 states have (on average 1.7542372881355932) internal successors, (207), 118 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 207 transitions. [2022-02-20 14:39:58,746 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 207 transitions. Word has length 17 [2022-02-20 14:39:58,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:58,746 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 207 transitions. [2022-02-20 14:39:58,746 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,746 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 207 transitions. [2022-02-20 14:39:58,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:39:58,747 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:58,747 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:58,747 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 14:39:58,747 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:58,748 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:58,748 INFO L85 PathProgramCache]: Analyzing trace with hash -545425190, now seen corresponding path program 1 times [2022-02-20 14:39:58,748 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:58,748 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126755360] [2022-02-20 14:39:58,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:58,748 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:58,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:58,778 INFO L290 TraceCheckUtils]: 0: Hoare triple {1961#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(15, 2);call #Ultimate.allocInit(12, 3); {1961#true} is VALID [2022-02-20 14:39:58,778 INFO L290 TraceCheckUtils]: 1: Hoare triple {1961#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_~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_~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;havoc main_~cond~0#1; {1961#true} is VALID [2022-02-20 14:39:58,778 INFO L290 TraceCheckUtils]: 2: Hoare triple {1961#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {1961#true} is VALID [2022-02-20 14:39:58,779 INFO L290 TraceCheckUtils]: 3: Hoare triple {1961#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; {1961#true} is VALID [2022-02-20 14:39:58,779 INFO L290 TraceCheckUtils]: 4: Hoare triple {1961#true} assume !(0 != main_~p1~0#1); {1961#true} is VALID [2022-02-20 14:39:58,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {1961#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {1963#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:58,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {1963#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p3~0#1); {1963#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:58,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {1963#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1963#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:58,788 INFO L290 TraceCheckUtils]: 8: Hoare triple {1963#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1963#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:58,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {1963#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1963#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:58,789 INFO L290 TraceCheckUtils]: 10: Hoare triple {1963#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1963#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:58,789 INFO L290 TraceCheckUtils]: 11: Hoare triple {1963#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1963#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:58,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {1963#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {1963#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:58,790 INFO L290 TraceCheckUtils]: 13: Hoare triple {1963#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p1~0#1); {1963#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:58,790 INFO L290 TraceCheckUtils]: 14: Hoare triple {1963#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p2~0#1); {1962#false} is VALID [2022-02-20 14:39:58,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {1962#false} assume 0 != main_~p3~0#1; {1962#false} is VALID [2022-02-20 14:39:58,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {1962#false} assume 1 != main_~lk3~0#1; {1962#false} is VALID [2022-02-20 14:39:58,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {1962#false} assume !false; {1962#false} is VALID [2022-02-20 14:39:58,791 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:58,791 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:58,791 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126755360] [2022-02-20 14:39:58,791 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1126755360] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:58,791 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:58,791 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:58,792 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1674451623] [2022-02-20 14:39:58,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:58,792 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:58,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:58,792 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:58,803 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:58,804 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:58,804 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:58,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:58,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:58,805 INFO L87 Difference]: Start difference. First operand 119 states and 207 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:58,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:58,868 INFO L93 Difference]: Finished difference Result 180 states and 310 transitions. [2022-02-20 14:39:58,868 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:58,869 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:58,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:58,870 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:58,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2022-02-20 14:39:58,871 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:58,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 162 transitions. [2022-02-20 14:39:58,872 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 162 transitions. [2022-02-20 14:39:58,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:58,969 INFO L225 Difference]: With dead ends: 180 [2022-02-20 14:39:58,969 INFO L226 Difference]: Without dead ends: 123 [2022-02-20 14:39:58,969 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:58,970 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 44 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 140 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:58,973 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 140 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:58,974 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2022-02-20 14:39:58,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 121. [2022-02-20 14:39:58,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:58,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand has 121 states, 120 states have (on average 1.725) internal successors, (207), 120 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,986 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand has 121 states, 120 states have (on average 1.725) internal successors, (207), 120 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,986 INFO L87 Difference]: Start difference. First operand 123 states. Second operand has 121 states, 120 states have (on average 1.725) internal successors, (207), 120 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,988 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:58,988 INFO L93 Difference]: Finished difference Result 123 states and 208 transitions. [2022-02-20 14:39:58,989 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 208 transitions. [2022-02-20 14:39:58,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:58,989 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:58,989 INFO L74 IsIncluded]: Start isIncluded. First operand has 121 states, 120 states have (on average 1.725) internal successors, (207), 120 states have internal predecessors, (207), 0 states have call successors, (0), 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 123 states. [2022-02-20 14:39:58,989 INFO L87 Difference]: Start difference. First operand has 121 states, 120 states have (on average 1.725) internal successors, (207), 120 states have internal predecessors, (207), 0 states have call successors, (0), 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 123 states. [2022-02-20 14:39:58,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:58,992 INFO L93 Difference]: Finished difference Result 123 states and 208 transitions. [2022-02-20 14:39:58,992 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 208 transitions. [2022-02-20 14:39:58,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:58,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:58,993 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:58,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:58,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 120 states have (on average 1.725) internal successors, (207), 120 states have internal predecessors, (207), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:58,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 207 transitions. [2022-02-20 14:39:58,996 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 207 transitions. Word has length 18 [2022-02-20 14:39:58,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:58,996 INFO L470 AbstractCegarLoop]: Abstraction has 121 states and 207 transitions. [2022-02-20 14:39:58,997 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:58,997 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 207 transitions. [2022-02-20 14:39:58,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:39:58,997 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:58,997 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:58,997 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 14:39:58,998 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:58,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:58,998 INFO L85 PathProgramCache]: Analyzing trace with hash -1132231204, now seen corresponding path program 1 times [2022-02-20 14:39:58,998 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:58,998 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1746973810] [2022-02-20 14:39:58,999 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:58,999 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:59,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:59,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {2529#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(15, 2);call #Ultimate.allocInit(12, 3); {2529#true} is VALID [2022-02-20 14:39:59,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {2529#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_~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_~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;havoc main_~cond~0#1; {2529#true} is VALID [2022-02-20 14:39:59,030 INFO L290 TraceCheckUtils]: 2: Hoare triple {2529#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {2529#true} is VALID [2022-02-20 14:39:59,032 INFO L290 TraceCheckUtils]: 3: Hoare triple {2529#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; {2529#true} is VALID [2022-02-20 14:39:59,033 INFO L290 TraceCheckUtils]: 4: Hoare triple {2529#true} assume !(0 != main_~p1~0#1); {2529#true} is VALID [2022-02-20 14:39:59,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {2529#true} assume !(0 != main_~p2~0#1); {2529#true} is VALID [2022-02-20 14:39:59,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {2529#true} assume !(0 != main_~p3~0#1); {2531#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:59,034 INFO L290 TraceCheckUtils]: 7: Hoare triple {2531#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {2531#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:59,034 INFO L290 TraceCheckUtils]: 8: Hoare triple {2531#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2531#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:59,035 INFO L290 TraceCheckUtils]: 9: Hoare triple {2531#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2531#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:59,035 INFO L290 TraceCheckUtils]: 10: Hoare triple {2531#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {2531#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:59,036 INFO L290 TraceCheckUtils]: 11: Hoare triple {2531#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {2531#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:59,036 INFO L290 TraceCheckUtils]: 12: Hoare triple {2531#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {2531#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:59,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {2531#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p1~0#1); {2531#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:59,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {2531#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p2~0#1); {2531#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:59,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {2531#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p3~0#1; {2530#false} is VALID [2022-02-20 14:39:59,038 INFO L290 TraceCheckUtils]: 16: Hoare triple {2530#false} assume 1 != main_~lk3~0#1; {2530#false} is VALID [2022-02-20 14:39:59,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {2530#false} assume !false; {2530#false} is VALID [2022-02-20 14:39:59,040 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:59,040 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:59,040 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1746973810] [2022-02-20 14:39:59,040 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1746973810] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:59,040 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:59,041 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:59,041 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751306418] [2022-02-20 14:39:59,041 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:59,041 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:59,041 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:59,042 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:59,052 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:59,052 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:59,053 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:59,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:59,053 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:59,053 INFO L87 Difference]: Start difference. First operand 121 states and 207 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:59,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:59,116 INFO L93 Difference]: Finished difference Result 345 states and 593 transitions. [2022-02-20 14:39:59,116 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:59,116 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:59,117 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:59,117 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:59,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2022-02-20 14:39:59,118 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:59,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2022-02-20 14:39:59,120 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 165 transitions. [2022-02-20 14:39:59,234 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:59,238 INFO L225 Difference]: With dead ends: 345 [2022-02-20 14:39:59,238 INFO L226 Difference]: Without dead ends: 231 [2022-02-20 14:39:59,239 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:59,239 INFO L933 BasicCegarLoop]: 63 mSDtfsCounter, 42 mSDsluCounter, 52 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 115 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:59,240 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 115 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:59,240 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2022-02-20 14:39:59,245 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 229. [2022-02-20 14:39:59,245 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:59,245 INFO L82 GeneralOperation]: Start isEquivalent. First operand 231 states. Second operand has 229 states, 228 states have (on average 1.6973684210526316) internal successors, (387), 228 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:59,246 INFO L74 IsIncluded]: Start isIncluded. First operand 231 states. Second operand has 229 states, 228 states have (on average 1.6973684210526316) internal successors, (387), 228 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:59,246 INFO L87 Difference]: Start difference. First operand 231 states. Second operand has 229 states, 228 states have (on average 1.6973684210526316) internal successors, (387), 228 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:59,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:59,267 INFO L93 Difference]: Finished difference Result 231 states and 388 transitions. [2022-02-20 14:39:59,267 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 388 transitions. [2022-02-20 14:39:59,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:59,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:59,268 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 228 states have (on average 1.6973684210526316) internal successors, (387), 228 states have internal predecessors, (387), 0 states have call successors, (0), 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 231 states. [2022-02-20 14:39:59,268 INFO L87 Difference]: Start difference. First operand has 229 states, 228 states have (on average 1.6973684210526316) internal successors, (387), 228 states have internal predecessors, (387), 0 states have call successors, (0), 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 231 states. [2022-02-20 14:39:59,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:59,273 INFO L93 Difference]: Finished difference Result 231 states and 388 transitions. [2022-02-20 14:39:59,273 INFO L276 IsEmpty]: Start isEmpty. Operand 231 states and 388 transitions. [2022-02-20 14:39:59,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:59,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:59,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:59,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:59,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.6973684210526316) internal successors, (387), 228 states have internal predecessors, (387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:59,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 387 transitions. [2022-02-20 14:39:59,278 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 387 transitions. Word has length 18 [2022-02-20 14:39:59,279 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:59,279 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 387 transitions. [2022-02-20 14:39:59,279 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:59,279 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 387 transitions. [2022-02-20 14:39:59,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:39:59,279 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:59,280 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:59,280 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 14:39:59,280 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:59,280 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:59,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1390396642, now seen corresponding path program 1 times [2022-02-20 14:39:59,280 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:59,281 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74360292] [2022-02-20 14:39:59,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:59,281 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:59,293 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:59,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {3596#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(15, 2);call #Ultimate.allocInit(12, 3); {3596#true} is VALID [2022-02-20 14:39:59,308 INFO L290 TraceCheckUtils]: 1: Hoare triple {3596#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_~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_~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;havoc main_~cond~0#1; {3596#true} is VALID [2022-02-20 14:39:59,309 INFO L290 TraceCheckUtils]: 2: Hoare triple {3596#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {3596#true} is VALID [2022-02-20 14:39:59,310 INFO L290 TraceCheckUtils]: 3: Hoare triple {3596#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; {3596#true} is VALID [2022-02-20 14:39:59,310 INFO L290 TraceCheckUtils]: 4: Hoare triple {3596#true} assume !(0 != main_~p1~0#1); {3596#true} is VALID [2022-02-20 14:39:59,310 INFO L290 TraceCheckUtils]: 5: Hoare triple {3596#true} assume !(0 != main_~p2~0#1); {3596#true} is VALID [2022-02-20 14:39:59,310 INFO L290 TraceCheckUtils]: 6: Hoare triple {3596#true} assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; {3598#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:59,317 INFO L290 TraceCheckUtils]: 7: Hoare triple {3598#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {3598#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:59,317 INFO L290 TraceCheckUtils]: 8: Hoare triple {3598#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {3598#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:59,318 INFO L290 TraceCheckUtils]: 9: Hoare triple {3598#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {3598#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:59,318 INFO L290 TraceCheckUtils]: 10: Hoare triple {3598#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {3598#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:59,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {3598#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {3598#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:59,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {3598#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {3598#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:59,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {3598#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p1~0#1); {3598#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:59,319 INFO L290 TraceCheckUtils]: 14: Hoare triple {3598#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p2~0#1); {3598#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:59,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {3598#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p3~0#1; {3598#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:59,320 INFO L290 TraceCheckUtils]: 16: Hoare triple {3598#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 1 != main_~lk3~0#1; {3597#false} is VALID [2022-02-20 14:39:59,320 INFO L290 TraceCheckUtils]: 17: Hoare triple {3597#false} assume !false; {3597#false} is VALID [2022-02-20 14:39:59,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:59,320 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:59,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74360292] [2022-02-20 14:39:59,321 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74360292] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:59,321 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:59,321 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:59,321 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [825779978] [2022-02-20 14:39:59,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:59,321 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:59,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:59,322 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:59,332 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:59,332 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:59,332 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:59,333 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:59,333 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:59,333 INFO L87 Difference]: Start difference. First operand 229 states and 387 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:59,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:59,397 INFO L93 Difference]: Finished difference Result 289 states and 493 transitions. [2022-02-20 14:39:59,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:59,397 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:59,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:59,397 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:59,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2022-02-20 14:39:59,398 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:59,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2022-02-20 14:39:59,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 104 transitions. [2022-02-20 14:39:59,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:59,456 INFO L225 Difference]: With dead ends: 289 [2022-02-20 14:39:59,456 INFO L226 Difference]: Without dead ends: 287 [2022-02-20 14:39:59,456 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:59,457 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 37 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 152 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:59,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 152 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:59,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 287 states. [2022-02-20 14:39:59,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 287 to 229. [2022-02-20 14:39:59,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:59,462 INFO L82 GeneralOperation]: Start isEquivalent. First operand 287 states. Second operand has 229 states, 228 states have (on average 1.6798245614035088) internal successors, (383), 228 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:59,463 INFO L74 IsIncluded]: Start isIncluded. First operand 287 states. Second operand has 229 states, 228 states have (on average 1.6798245614035088) internal successors, (383), 228 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:59,463 INFO L87 Difference]: Start difference. First operand 287 states. Second operand has 229 states, 228 states have (on average 1.6798245614035088) internal successors, (383), 228 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:59,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:59,468 INFO L93 Difference]: Finished difference Result 287 states and 488 transitions. [2022-02-20 14:39:59,468 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 488 transitions. [2022-02-20 14:39:59,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:59,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:59,470 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 228 states have (on average 1.6798245614035088) internal successors, (383), 228 states have internal predecessors, (383), 0 states have call successors, (0), 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 287 states. [2022-02-20 14:39:59,470 INFO L87 Difference]: Start difference. First operand has 229 states, 228 states have (on average 1.6798245614035088) internal successors, (383), 228 states have internal predecessors, (383), 0 states have call successors, (0), 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 287 states. [2022-02-20 14:39:59,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:59,475 INFO L93 Difference]: Finished difference Result 287 states and 488 transitions. [2022-02-20 14:39:59,476 INFO L276 IsEmpty]: Start isEmpty. Operand 287 states and 488 transitions. [2022-02-20 14:39:59,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:59,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:59,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:59,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:59,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 228 states have (on average 1.6798245614035088) internal successors, (383), 228 states have internal predecessors, (383), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:59,480 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 383 transitions. [2022-02-20 14:39:59,480 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 383 transitions. Word has length 18 [2022-02-20 14:39:59,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:59,481 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 383 transitions. [2022-02-20 14:39:59,481 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:59,481 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 383 transitions. [2022-02-20 14:39:59,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 14:39:59,481 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:59,481 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:59,482 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 14:39:59,482 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:59,482 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:59,482 INFO L85 PathProgramCache]: Analyzing trace with hash -739214602, now seen corresponding path program 1 times [2022-02-20 14:39:59,482 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:59,483 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [901467372] [2022-02-20 14:39:59,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:59,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:59,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:59,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {4719#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(15, 2);call #Ultimate.allocInit(12, 3); {4719#true} is VALID [2022-02-20 14:39:59,507 INFO L290 TraceCheckUtils]: 1: Hoare triple {4719#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_~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_~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;havoc main_~cond~0#1; {4719#true} is VALID [2022-02-20 14:39:59,507 INFO L290 TraceCheckUtils]: 2: Hoare triple {4719#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {4719#true} is VALID [2022-02-20 14:39:59,508 INFO L290 TraceCheckUtils]: 3: Hoare triple {4719#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; {4719#true} is VALID [2022-02-20 14:39:59,508 INFO L290 TraceCheckUtils]: 4: Hoare triple {4719#true} assume !(0 != main_~p1~0#1); {4719#true} is VALID [2022-02-20 14:39:59,508 INFO L290 TraceCheckUtils]: 5: Hoare triple {4719#true} assume !(0 != main_~p2~0#1); {4719#true} is VALID [2022-02-20 14:39:59,508 INFO L290 TraceCheckUtils]: 6: Hoare triple {4719#true} assume !(0 != main_~p3~0#1); {4719#true} is VALID [2022-02-20 14:39:59,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {4719#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {4721#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:59,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {4721#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {4721#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:59,509 INFO L290 TraceCheckUtils]: 9: Hoare triple {4721#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {4721#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:59,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {4721#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {4721#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:59,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {4721#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {4721#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:59,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {4721#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {4721#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:59,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {4721#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p1~0#1); {4721#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:59,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {4721#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p2~0#1); {4721#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:59,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {4721#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p3~0#1); {4721#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:59,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {4721#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p4~0#1; {4721#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:59,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {4721#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 1 != main_~lk4~0#1; {4720#false} is VALID [2022-02-20 14:39:59,512 INFO L290 TraceCheckUtils]: 18: Hoare triple {4720#false} assume !false; {4720#false} is VALID [2022-02-20 14:39:59,512 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:59,513 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:59,513 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [901467372] [2022-02-20 14:39:59,513 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [901467372] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:59,513 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:59,513 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:59,513 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360085853] [2022-02-20 14:39:59,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:59,514 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:59,514 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:59,514 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:59,524 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:59,525 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:59,525 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:59,525 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:59,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:59,525 INFO L87 Difference]: Start difference. First operand 229 states and 383 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:59,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:59,582 INFO L93 Difference]: Finished difference Result 421 states and 713 transitions. [2022-02-20 14:39:59,582 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:59,583 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:59,583 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:59,583 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:59,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-02-20 14:39:59,584 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:59,584 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 103 transitions. [2022-02-20 14:39:59,584 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 103 transitions. [2022-02-20 14:39:59,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:59,646 INFO L225 Difference]: With dead ends: 421 [2022-02-20 14:39:59,646 INFO L226 Difference]: Without dead ends: 419 [2022-02-20 14:39:59,646 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:59,647 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 34 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 109 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:59,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 109 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:59,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 419 states. [2022-02-20 14:39:59,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 419 to 321. [2022-02-20 14:39:59,653 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:59,653 INFO L82 GeneralOperation]: Start isEquivalent. First operand 419 states. Second operand has 321 states, 320 states have (on average 1.646875) internal successors, (527), 320 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:59,653 INFO L74 IsIncluded]: Start isIncluded. First operand 419 states. Second operand has 321 states, 320 states have (on average 1.646875) internal successors, (527), 320 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:59,654 INFO L87 Difference]: Start difference. First operand 419 states. Second operand has 321 states, 320 states have (on average 1.646875) internal successors, (527), 320 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:59,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:59,661 INFO L93 Difference]: Finished difference Result 419 states and 704 transitions. [2022-02-20 14:39:59,661 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 704 transitions. [2022-02-20 14:39:59,661 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:59,661 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:59,662 INFO L74 IsIncluded]: Start isIncluded. First operand has 321 states, 320 states have (on average 1.646875) internal successors, (527), 320 states have internal predecessors, (527), 0 states have call successors, (0), 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 419 states. [2022-02-20 14:39:59,662 INFO L87 Difference]: Start difference. First operand has 321 states, 320 states have (on average 1.646875) internal successors, (527), 320 states have internal predecessors, (527), 0 states have call successors, (0), 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 419 states. [2022-02-20 14:39:59,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:59,670 INFO L93 Difference]: Finished difference Result 419 states and 704 transitions. [2022-02-20 14:39:59,670 INFO L276 IsEmpty]: Start isEmpty. Operand 419 states and 704 transitions. [2022-02-20 14:39:59,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:59,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:59,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:59,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:59,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 321 states, 320 states have (on average 1.646875) internal successors, (527), 320 states have internal predecessors, (527), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:59,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 321 states to 321 states and 527 transitions. [2022-02-20 14:39:59,675 INFO L78 Accepts]: Start accepts. Automaton has 321 states and 527 transitions. Word has length 19 [2022-02-20 14:39:59,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:59,675 INFO L470 AbstractCegarLoop]: Abstraction has 321 states and 527 transitions. [2022-02-20 14:39:59,676 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:59,676 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 527 transitions. [2022-02-20 14:39:59,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 14:39:59,676 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:59,676 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:59,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 14:39:59,676 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:59,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:59,677 INFO L85 PathProgramCache]: Analyzing trace with hash -481049164, now seen corresponding path program 1 times [2022-02-20 14:39:59,677 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:59,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [56591892] [2022-02-20 14:39:59,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:59,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:59,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:59,711 INFO L290 TraceCheckUtils]: 0: Hoare triple {6334#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(15, 2);call #Ultimate.allocInit(12, 3); {6334#true} is VALID [2022-02-20 14:39:59,711 INFO L290 TraceCheckUtils]: 1: Hoare triple {6334#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_~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_~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;havoc main_~cond~0#1; {6334#true} is VALID [2022-02-20 14:39:59,711 INFO L290 TraceCheckUtils]: 2: Hoare triple {6334#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {6334#true} is VALID [2022-02-20 14:39:59,711 INFO L290 TraceCheckUtils]: 3: Hoare triple {6334#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; {6334#true} is VALID [2022-02-20 14:39:59,711 INFO L290 TraceCheckUtils]: 4: Hoare triple {6334#true} assume !(0 != main_~p1~0#1); {6334#true} is VALID [2022-02-20 14:39:59,712 INFO L290 TraceCheckUtils]: 5: Hoare triple {6334#true} assume !(0 != main_~p2~0#1); {6334#true} is VALID [2022-02-20 14:39:59,712 INFO L290 TraceCheckUtils]: 6: Hoare triple {6334#true} assume !(0 != main_~p3~0#1); {6334#true} is VALID [2022-02-20 14:39:59,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {6334#true} assume !(0 != main_~p4~0#1); {6336#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:59,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {6336#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {6336#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:59,713 INFO L290 TraceCheckUtils]: 9: Hoare triple {6336#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {6336#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:59,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {6336#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {6336#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:59,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {6336#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {6336#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:59,714 INFO L290 TraceCheckUtils]: 12: Hoare triple {6336#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {6336#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:59,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {6336#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p1~0#1); {6336#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:59,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {6336#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p2~0#1); {6336#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:59,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {6336#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p3~0#1); {6336#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:59,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {6336#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p4~0#1; {6335#false} is VALID [2022-02-20 14:39:59,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {6335#false} assume 1 != main_~lk4~0#1; {6335#false} is VALID [2022-02-20 14:39:59,715 INFO L290 TraceCheckUtils]: 18: Hoare triple {6335#false} assume !false; {6335#false} is VALID [2022-02-20 14:39:59,715 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:59,715 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:59,716 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [56591892] [2022-02-20 14:39:59,716 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [56591892] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:59,716 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:59,716 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:59,716 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [458957219] [2022-02-20 14:39:59,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:59,716 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:59,717 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:59,717 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:59,726 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:59,726 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:59,726 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:59,726 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:59,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:59,727 INFO L87 Difference]: Start difference. First operand 321 states and 527 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:59,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:59,793 INFO L93 Difference]: Finished difference Result 757 states and 1249 transitions. [2022-02-20 14:39:59,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:59,793 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:59,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:59,794 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:59,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2022-02-20 14:39:59,795 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:59,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 161 transitions. [2022-02-20 14:39:59,795 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 161 transitions. [2022-02-20 14:39:59,892 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:59,899 INFO L225 Difference]: With dead ends: 757 [2022-02-20 14:39:59,900 INFO L226 Difference]: Without dead ends: 443 [2022-02-20 14:39:59,900 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:59,901 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 40 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 132 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:59,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 132 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:59,901 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 443 states. [2022-02-20 14:39:59,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 443 to 441. [2022-02-20 14:39:59,907 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:59,908 INFO L82 GeneralOperation]: Start isEquivalent. First operand 443 states. Second operand has 441 states, 440 states have (on average 1.625) internal successors, (715), 440 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:59,908 INFO L74 IsIncluded]: Start isIncluded. First operand 443 states. Second operand has 441 states, 440 states have (on average 1.625) internal successors, (715), 440 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:59,909 INFO L87 Difference]: Start difference. First operand 443 states. Second operand has 441 states, 440 states have (on average 1.625) internal successors, (715), 440 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:59,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:59,917 INFO L93 Difference]: Finished difference Result 443 states and 716 transitions. [2022-02-20 14:39:59,917 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 716 transitions. [2022-02-20 14:39:59,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:59,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:59,918 INFO L74 IsIncluded]: Start isIncluded. First operand has 441 states, 440 states have (on average 1.625) internal successors, (715), 440 states have internal predecessors, (715), 0 states have call successors, (0), 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 443 states. [2022-02-20 14:39:59,919 INFO L87 Difference]: Start difference. First operand has 441 states, 440 states have (on average 1.625) internal successors, (715), 440 states have internal predecessors, (715), 0 states have call successors, (0), 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 443 states. [2022-02-20 14:39:59,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:59,927 INFO L93 Difference]: Finished difference Result 443 states and 716 transitions. [2022-02-20 14:39:59,927 INFO L276 IsEmpty]: Start isEmpty. Operand 443 states and 716 transitions. [2022-02-20 14:39:59,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:59,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:59,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:59,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:59,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 441 states, 440 states have (on average 1.625) internal successors, (715), 440 states have internal predecessors, (715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:59,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 441 states to 441 states and 715 transitions. [2022-02-20 14:39:59,937 INFO L78 Accepts]: Start accepts. Automaton has 441 states and 715 transitions. Word has length 19 [2022-02-20 14:39:59,937 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:59,937 INFO L470 AbstractCegarLoop]: Abstraction has 441 states and 715 transitions. [2022-02-20 14:39:59,937 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:59,938 INFO L276 IsEmpty]: Start isEmpty. Operand 441 states and 715 transitions. [2022-02-20 14:39:59,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 14:39:59,938 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:59,938 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:59,938 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 14:39:59,939 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:59,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:59,939 INFO L85 PathProgramCache]: Analyzing trace with hash -1440601487, now seen corresponding path program 1 times [2022-02-20 14:39:59,939 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:59,939 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824151319] [2022-02-20 14:39:59,939 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:59,939 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:59,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:59,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {8469#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(15, 2);call #Ultimate.allocInit(12, 3); {8469#true} is VALID [2022-02-20 14:39:59,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {8469#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_~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_~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;havoc main_~cond~0#1; {8469#true} is VALID [2022-02-20 14:39:59,960 INFO L290 TraceCheckUtils]: 2: Hoare triple {8469#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {8469#true} is VALID [2022-02-20 14:39:59,961 INFO L290 TraceCheckUtils]: 3: Hoare triple {8469#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; {8469#true} is VALID [2022-02-20 14:39:59,961 INFO L290 TraceCheckUtils]: 4: Hoare triple {8469#true} assume !(0 != main_~p1~0#1); {8469#true} is VALID [2022-02-20 14:39:59,961 INFO L290 TraceCheckUtils]: 5: Hoare triple {8469#true} assume !(0 != main_~p2~0#1); {8469#true} is VALID [2022-02-20 14:39:59,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {8469#true} assume !(0 != main_~p3~0#1); {8469#true} is VALID [2022-02-20 14:39:59,961 INFO L290 TraceCheckUtils]: 7: Hoare triple {8469#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {8471#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:59,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {8471#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {8471#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:59,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {8471#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {8471#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:59,962 INFO L290 TraceCheckUtils]: 10: Hoare triple {8471#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {8471#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:59,962 INFO L290 TraceCheckUtils]: 11: Hoare triple {8471#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {8471#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:59,963 INFO L290 TraceCheckUtils]: 12: Hoare triple {8471#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {8471#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:59,963 INFO L290 TraceCheckUtils]: 13: Hoare triple {8471#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p1~0#1); {8471#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:59,963 INFO L290 TraceCheckUtils]: 14: Hoare triple {8471#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p2~0#1); {8471#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:59,964 INFO L290 TraceCheckUtils]: 15: Hoare triple {8471#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p3~0#1); {8471#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:59,964 INFO L290 TraceCheckUtils]: 16: Hoare triple {8471#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p4~0#1); {8470#false} is VALID [2022-02-20 14:39:59,964 INFO L290 TraceCheckUtils]: 17: Hoare triple {8470#false} assume 0 != main_~p5~0#1; {8470#false} is VALID [2022-02-20 14:39:59,964 INFO L290 TraceCheckUtils]: 18: Hoare triple {8470#false} assume 1 != main_~lk5~0#1; {8470#false} is VALID [2022-02-20 14:39:59,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {8470#false} assume !false; {8470#false} is VALID [2022-02-20 14:39:59,965 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:59,965 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:59,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824151319] [2022-02-20 14:39:59,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [824151319] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:59,965 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:59,965 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:59,965 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [532709163] [2022-02-20 14:39:59,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:59,966 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:59,966 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:59,966 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:59,975 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:59,976 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:59,976 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:59,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:59,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:59,977 INFO L87 Difference]: Start difference. First operand 441 states and 715 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:40:00,037 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:00,037 INFO L93 Difference]: Finished difference Result 669 states and 1081 transitions. [2022-02-20 14:40:00,037 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:00,037 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:40:00,038 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:00,038 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:40:00,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2022-02-20 14:40:00,039 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:40:00,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 156 transitions. [2022-02-20 14:40:00,039 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 156 transitions. [2022-02-20 14:40:00,117 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 156 edges. 156 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:00,125 INFO L225 Difference]: With dead ends: 669 [2022-02-20 14:40:00,125 INFO L226 Difference]: Without dead ends: 455 [2022-02-20 14:40:00,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:00,126 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 42 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:40:00,127 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 132 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:40:00,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 455 states. [2022-02-20 14:40:00,133 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 455 to 453. [2022-02-20 14:40:00,133 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:00,134 INFO L82 GeneralOperation]: Start isEquivalent. First operand 455 states. Second operand has 453 states, 452 states have (on average 1.5995575221238938) internal successors, (723), 452 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call 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,135 INFO L74 IsIncluded]: Start isIncluded. First operand 455 states. Second operand has 453 states, 452 states have (on average 1.5995575221238938) internal successors, (723), 452 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call 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,135 INFO L87 Difference]: Start difference. First operand 455 states. Second operand has 453 states, 452 states have (on average 1.5995575221238938) internal successors, (723), 452 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call 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,143 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:00,143 INFO L93 Difference]: Finished difference Result 455 states and 724 transitions. [2022-02-20 14:40:00,144 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 724 transitions. [2022-02-20 14:40:00,144 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:00,144 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:00,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 453 states, 452 states have (on average 1.5995575221238938) internal successors, (723), 452 states have internal predecessors, (723), 0 states have call successors, (0), 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 455 states. [2022-02-20 14:40:00,145 INFO L87 Difference]: Start difference. First operand has 453 states, 452 states have (on average 1.5995575221238938) internal successors, (723), 452 states have internal predecessors, (723), 0 states have call successors, (0), 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 455 states. [2022-02-20 14:40:00,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:00,154 INFO L93 Difference]: Finished difference Result 455 states and 724 transitions. [2022-02-20 14:40:00,154 INFO L276 IsEmpty]: Start isEmpty. Operand 455 states and 724 transitions. [2022-02-20 14:40:00,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:00,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:00,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:00,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:00,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.5995575221238938) internal successors, (723), 452 states have internal predecessors, (723), 0 states have call successors, (0), 0 states have call 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,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 723 transitions. [2022-02-20 14:40:00,165 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 723 transitions. Word has length 20 [2022-02-20 14:40:00,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:00,165 INFO L470 AbstractCegarLoop]: Abstraction has 453 states and 723 transitions. [2022-02-20 14:40:00,165 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:40:00,165 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 723 transitions. [2022-02-20 14:40:00,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 14:40:00,166 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:00,166 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:40:00,166 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 14:40:00,166 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:00,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:00,167 INFO L85 PathProgramCache]: Analyzing trace with hash -2027407501, now seen corresponding path program 1 times [2022-02-20 14:40:00,167 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:00,167 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1581902771] [2022-02-20 14:40:00,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:00,167 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:00,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:00,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {10552#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(15, 2);call #Ultimate.allocInit(12, 3); {10552#true} is VALID [2022-02-20 14:40:00,186 INFO L290 TraceCheckUtils]: 1: Hoare triple {10552#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_~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_~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;havoc main_~cond~0#1; {10552#true} is VALID [2022-02-20 14:40:00,186 INFO L290 TraceCheckUtils]: 2: Hoare triple {10552#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {10552#true} is VALID [2022-02-20 14:40:00,186 INFO L290 TraceCheckUtils]: 3: Hoare triple {10552#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; {10552#true} is VALID [2022-02-20 14:40:00,186 INFO L290 TraceCheckUtils]: 4: Hoare triple {10552#true} assume !(0 != main_~p1~0#1); {10552#true} is VALID [2022-02-20 14:40:00,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {10552#true} assume !(0 != main_~p2~0#1); {10552#true} is VALID [2022-02-20 14:40:00,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {10552#true} assume !(0 != main_~p3~0#1); {10552#true} is VALID [2022-02-20 14:40:00,187 INFO L290 TraceCheckUtils]: 7: Hoare triple {10552#true} assume !(0 != main_~p4~0#1); {10552#true} is VALID [2022-02-20 14:40:00,187 INFO L290 TraceCheckUtils]: 8: Hoare triple {10552#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {10554#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:40:00,187 INFO L290 TraceCheckUtils]: 9: Hoare triple {10554#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {10554#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:40:00,188 INFO L290 TraceCheckUtils]: 10: Hoare triple {10554#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {10554#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:40:00,188 INFO L290 TraceCheckUtils]: 11: Hoare triple {10554#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {10554#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:40:00,188 INFO L290 TraceCheckUtils]: 12: Hoare triple {10554#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {10554#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:40:00,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {10554#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p1~0#1); {10554#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:40:00,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {10554#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p2~0#1); {10554#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:40:00,189 INFO L290 TraceCheckUtils]: 15: Hoare triple {10554#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p3~0#1); {10554#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:40:00,189 INFO L290 TraceCheckUtils]: 16: Hoare triple {10554#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p4~0#1); {10554#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:40:00,190 INFO L290 TraceCheckUtils]: 17: Hoare triple {10554#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p5~0#1; {10554#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:40:00,190 INFO L290 TraceCheckUtils]: 18: Hoare triple {10554#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 1 != main_~lk5~0#1; {10553#false} is VALID [2022-02-20 14:40:00,190 INFO L290 TraceCheckUtils]: 19: Hoare triple {10553#false} assume !false; {10553#false} is VALID [2022-02-20 14:40:00,190 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:00,191 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:00,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1581902771] [2022-02-20 14:40:00,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1581902771] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:00,191 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:00,191 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:00,191 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907437787] [2022-02-20 14:40:00,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:00,192 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:40:00,192 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:00,192 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:40:00,201 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:40:00,202 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:00,202 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:00,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:00,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:00,202 INFO L87 Difference]: Start difference. First operand 453 states and 723 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:40:00,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:00,269 INFO L93 Difference]: Finished difference Result 809 states and 1309 transitions. [2022-02-20 14:40:00,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:00,269 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:40:00,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:00,269 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:40:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2022-02-20 14:40:00,270 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:40:00,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2022-02-20 14:40:00,270 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 99 transitions. [2022-02-20 14:40:00,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 99 edges. 99 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:00,349 INFO L225 Difference]: With dead ends: 809 [2022-02-20 14:40:00,350 INFO L226 Difference]: Without dead ends: 807 [2022-02-20 14:40:00,350 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:00,351 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 31 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 107 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:00,351 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [31 Valid, 107 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:00,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 807 states. [2022-02-20 14:40:00,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 807 to 645. [2022-02-20 14:40:00,360 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:00,361 INFO L82 GeneralOperation]: Start isEquivalent. First operand 807 states. Second operand has 645 states, 644 states have (on average 1.5574534161490683) internal successors, (1003), 644 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call 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,362 INFO L74 IsIncluded]: Start isIncluded. First operand 807 states. Second operand has 645 states, 644 states have (on average 1.5574534161490683) internal successors, (1003), 644 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call 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,362 INFO L87 Difference]: Start difference. First operand 807 states. Second operand has 645 states, 644 states have (on average 1.5574534161490683) internal successors, (1003), 644 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call 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,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:00,386 INFO L93 Difference]: Finished difference Result 807 states and 1292 transitions. [2022-02-20 14:40:00,386 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1292 transitions. [2022-02-20 14:40:00,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:00,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:00,388 INFO L74 IsIncluded]: Start isIncluded. First operand has 645 states, 644 states have (on average 1.5574534161490683) internal successors, (1003), 644 states have internal predecessors, (1003), 0 states have call successors, (0), 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 807 states. [2022-02-20 14:40:00,389 INFO L87 Difference]: Start difference. First operand has 645 states, 644 states have (on average 1.5574534161490683) internal successors, (1003), 644 states have internal predecessors, (1003), 0 states have call successors, (0), 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 807 states. [2022-02-20 14:40:00,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:00,413 INFO L93 Difference]: Finished difference Result 807 states and 1292 transitions. [2022-02-20 14:40:00,413 INFO L276 IsEmpty]: Start isEmpty. Operand 807 states and 1292 transitions. [2022-02-20 14:40:00,414 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:00,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:00,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:00,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:00,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 645 states, 644 states have (on average 1.5574534161490683) internal successors, (1003), 644 states have internal predecessors, (1003), 0 states have call successors, (0), 0 states have call 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,429 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 645 states to 645 states and 1003 transitions. [2022-02-20 14:40:00,430 INFO L78 Accepts]: Start accepts. Automaton has 645 states and 1003 transitions. Word has length 20 [2022-02-20 14:40:00,430 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:00,430 INFO L470 AbstractCegarLoop]: Abstraction has 645 states and 1003 transitions. [2022-02-20 14:40:00,430 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:40:00,430 INFO L276 IsEmpty]: Start isEmpty. Operand 645 states and 1003 transitions. [2022-02-20 14:40:00,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 14:40:00,431 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:00,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] [2022-02-20 14:40:00,431 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 14:40:00,432 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:00,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:00,432 INFO L85 PathProgramCache]: Analyzing trace with hash -1769242063, now seen corresponding path program 1 times [2022-02-20 14:40:00,432 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:00,432 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [536022209] [2022-02-20 14:40:00,432 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:00,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:00,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:00,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {13679#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(15, 2);call #Ultimate.allocInit(12, 3); {13679#true} is VALID [2022-02-20 14:40:00,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {13679#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_~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_~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;havoc main_~cond~0#1; {13679#true} is VALID [2022-02-20 14:40:00,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {13679#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {13679#true} is VALID [2022-02-20 14:40:00,471 INFO L290 TraceCheckUtils]: 3: Hoare triple {13679#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; {13679#true} is VALID [2022-02-20 14:40:00,471 INFO L290 TraceCheckUtils]: 4: Hoare triple {13679#true} assume !(0 != main_~p1~0#1); {13679#true} is VALID [2022-02-20 14:40:00,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {13679#true} assume !(0 != main_~p2~0#1); {13679#true} is VALID [2022-02-20 14:40:00,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {13679#true} assume !(0 != main_~p3~0#1); {13679#true} is VALID [2022-02-20 14:40:00,472 INFO L290 TraceCheckUtils]: 7: Hoare triple {13679#true} assume !(0 != main_~p4~0#1); {13679#true} is VALID [2022-02-20 14:40:00,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {13679#true} assume !(0 != main_~p5~0#1); {13681#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:40:00,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {13681#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {13681#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:40:00,473 INFO L290 TraceCheckUtils]: 10: Hoare triple {13681#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {13681#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:40:00,473 INFO L290 TraceCheckUtils]: 11: Hoare triple {13681#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {13681#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:40:00,473 INFO L290 TraceCheckUtils]: 12: Hoare triple {13681#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {13681#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:40:00,473 INFO L290 TraceCheckUtils]: 13: Hoare triple {13681#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p1~0#1); {13681#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:40:00,474 INFO L290 TraceCheckUtils]: 14: Hoare triple {13681#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p2~0#1); {13681#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:40:00,474 INFO L290 TraceCheckUtils]: 15: Hoare triple {13681#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p3~0#1); {13681#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:40:00,474 INFO L290 TraceCheckUtils]: 16: Hoare triple {13681#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p4~0#1); {13681#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:40:00,475 INFO L290 TraceCheckUtils]: 17: Hoare triple {13681#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p5~0#1; {13680#false} is VALID [2022-02-20 14:40:00,475 INFO L290 TraceCheckUtils]: 18: Hoare triple {13680#false} assume 1 != main_~lk5~0#1; {13680#false} is VALID [2022-02-20 14:40:00,475 INFO L290 TraceCheckUtils]: 19: Hoare triple {13680#false} assume !false; {13680#false} is VALID [2022-02-20 14:40:00,476 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:00,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:00,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [536022209] [2022-02-20 14:40:00,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [536022209] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:00,476 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:00,476 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:00,476 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1014459259] [2022-02-20 14:40:00,476 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:00,477 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:40:00,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:00,477 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:40:00,486 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:40:00,486 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:00,487 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:00,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:00,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:00,487 INFO L87 Difference]: Start difference. First operand 645 states and 1003 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:40:00,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:00,633 INFO L93 Difference]: Finished difference Result 1497 states and 2333 transitions. [2022-02-20 14:40:00,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:00,634 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:40:00,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:00,634 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:40:00,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2022-02-20 14:40:00,635 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:40:00,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2022-02-20 14:40:00,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 158 transitions. [2022-02-20 14:40:00,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:00,740 INFO L225 Difference]: With dead ends: 1497 [2022-02-20 14:40:00,741 INFO L226 Difference]: Without dead ends: 871 [2022-02-20 14:40:00,742 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:00,744 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 39 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:40:00,745 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 133 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:40:00,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 871 states. [2022-02-20 14:40:00,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 871 to 869. [2022-02-20 14:40:00,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:00,764 INFO L82 GeneralOperation]: Start isEquivalent. First operand 871 states. Second operand has 869 states, 868 states have (on average 1.5334101382488479) internal successors, (1331), 868 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call 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,765 INFO L74 IsIncluded]: Start isIncluded. First operand 871 states. Second operand has 869 states, 868 states have (on average 1.5334101382488479) internal successors, (1331), 868 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call 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,766 INFO L87 Difference]: Start difference. First operand 871 states. Second operand has 869 states, 868 states have (on average 1.5334101382488479) internal successors, (1331), 868 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call 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,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:00,804 INFO L93 Difference]: Finished difference Result 871 states and 1332 transitions. [2022-02-20 14:40:00,804 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1332 transitions. [2022-02-20 14:40:00,805 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:00,805 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:00,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 869 states, 868 states have (on average 1.5334101382488479) internal successors, (1331), 868 states have internal predecessors, (1331), 0 states have call successors, (0), 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 871 states. [2022-02-20 14:40:00,808 INFO L87 Difference]: Start difference. First operand has 869 states, 868 states have (on average 1.5334101382488479) internal successors, (1331), 868 states have internal predecessors, (1331), 0 states have call successors, (0), 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 871 states. [2022-02-20 14:40:00,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:00,834 INFO L93 Difference]: Finished difference Result 871 states and 1332 transitions. [2022-02-20 14:40:00,834 INFO L276 IsEmpty]: Start isEmpty. Operand 871 states and 1332 transitions. [2022-02-20 14:40:00,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:00,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:00,835 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:00,835 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:00,836 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 869 states, 868 states have (on average 1.5334101382488479) internal successors, (1331), 868 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call 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,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 869 states to 869 states and 1331 transitions. [2022-02-20 14:40:00,873 INFO L78 Accepts]: Start accepts. Automaton has 869 states and 1331 transitions. Word has length 20 [2022-02-20 14:40:00,873 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:00,873 INFO L470 AbstractCegarLoop]: Abstraction has 869 states and 1331 transitions. [2022-02-20 14:40:00,874 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:40:00,874 INFO L276 IsEmpty]: Start isEmpty. Operand 869 states and 1331 transitions. [2022-02-20 14:40:00,877 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:40:00,878 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:00,878 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:40:00,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 14:40:00,878 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:00,878 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:00,878 INFO L85 PathProgramCache]: Analyzing trace with hash 1575091945, now seen corresponding path program 1 times [2022-02-20 14:40:00,879 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:00,879 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1797143211] [2022-02-20 14:40:00,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:00,879 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:00,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:00,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {17878#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(15, 2);call #Ultimate.allocInit(12, 3); {17878#true} is VALID [2022-02-20 14:40:00,916 INFO L290 TraceCheckUtils]: 1: Hoare triple {17878#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_~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_~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;havoc main_~cond~0#1; {17878#true} is VALID [2022-02-20 14:40:00,916 INFO L290 TraceCheckUtils]: 2: Hoare triple {17878#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {17878#true} is VALID [2022-02-20 14:40:00,917 INFO L290 TraceCheckUtils]: 3: Hoare triple {17878#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; {17878#true} is VALID [2022-02-20 14:40:00,917 INFO L290 TraceCheckUtils]: 4: Hoare triple {17878#true} assume !(0 != main_~p1~0#1); {17878#true} is VALID [2022-02-20 14:40:00,917 INFO L290 TraceCheckUtils]: 5: Hoare triple {17878#true} assume !(0 != main_~p2~0#1); {17878#true} is VALID [2022-02-20 14:40:00,917 INFO L290 TraceCheckUtils]: 6: Hoare triple {17878#true} assume !(0 != main_~p3~0#1); {17878#true} is VALID [2022-02-20 14:40:00,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {17878#true} assume !(0 != main_~p4~0#1); {17878#true} is VALID [2022-02-20 14:40:00,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {17878#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {17880#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:40:00,929 INFO L290 TraceCheckUtils]: 9: Hoare triple {17880#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {17880#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:40:00,930 INFO L290 TraceCheckUtils]: 10: Hoare triple {17880#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {17880#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:40:00,931 INFO L290 TraceCheckUtils]: 11: Hoare triple {17880#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {17880#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:40:00,933 INFO L290 TraceCheckUtils]: 12: Hoare triple {17880#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {17880#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:40:00,934 INFO L290 TraceCheckUtils]: 13: Hoare triple {17880#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p1~0#1); {17880#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:40:00,935 INFO L290 TraceCheckUtils]: 14: Hoare triple {17880#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p2~0#1); {17880#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:40:00,935 INFO L290 TraceCheckUtils]: 15: Hoare triple {17880#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p3~0#1); {17880#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:40:00,935 INFO L290 TraceCheckUtils]: 16: Hoare triple {17880#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p4~0#1); {17880#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:40:00,936 INFO L290 TraceCheckUtils]: 17: Hoare triple {17880#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p5~0#1); {17879#false} is VALID [2022-02-20 14:40:00,937 INFO L290 TraceCheckUtils]: 18: Hoare triple {17879#false} assume 0 != main_~p6~0#1; {17879#false} is VALID [2022-02-20 14:40:00,937 INFO L290 TraceCheckUtils]: 19: Hoare triple {17879#false} assume 1 != main_~lk6~0#1; {17879#false} is VALID [2022-02-20 14:40:00,938 INFO L290 TraceCheckUtils]: 20: Hoare triple {17879#false} assume !false; {17879#false} is VALID [2022-02-20 14:40:00,940 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:00,940 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:00,941 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1797143211] [2022-02-20 14:40:00,941 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1797143211] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:00,941 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:00,942 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:00,942 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [320670551] [2022-02-20 14:40:00,942 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:00,942 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:40:00,943 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:00,943 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:40:00,955 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:40:00,956 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:00,956 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:00,956 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:00,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:00,957 INFO L87 Difference]: Start difference. First operand 869 states and 1331 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:40:01,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:01,061 INFO L93 Difference]: Finished difference Result 1305 states and 1989 transitions. [2022-02-20 14:40:01,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:01,061 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:40:01,062 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:01,062 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:40:01,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2022-02-20 14:40:01,063 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:40:01,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 153 transitions. [2022-02-20 14:40:01,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 153 transitions. [2022-02-20 14:40:01,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 153 edges. 153 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:01,176 INFO L225 Difference]: With dead ends: 1305 [2022-02-20 14:40:01,176 INFO L226 Difference]: Without dead ends: 887 [2022-02-20 14:40:01,177 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:01,177 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 41 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 128 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:01,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 128 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:01,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 887 states. [2022-02-20 14:40:01,192 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 887 to 885. [2022-02-20 14:40:01,192 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:01,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 887 states. Second operand has 885 states, 884 states have (on average 1.505656108597285) internal successors, (1331), 884 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:01,194 INFO L74 IsIncluded]: Start isIncluded. First operand 887 states. Second operand has 885 states, 884 states have (on average 1.505656108597285) internal successors, (1331), 884 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:01,195 INFO L87 Difference]: Start difference. First operand 887 states. Second operand has 885 states, 884 states have (on average 1.505656108597285) internal successors, (1331), 884 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:01,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:01,220 INFO L93 Difference]: Finished difference Result 887 states and 1332 transitions. [2022-02-20 14:40:01,220 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1332 transitions. [2022-02-20 14:40:01,222 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:01,222 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:01,224 INFO L74 IsIncluded]: Start isIncluded. First operand has 885 states, 884 states have (on average 1.505656108597285) internal successors, (1331), 884 states have internal predecessors, (1331), 0 states have call successors, (0), 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 887 states. [2022-02-20 14:40:01,225 INFO L87 Difference]: Start difference. First operand has 885 states, 884 states have (on average 1.505656108597285) internal successors, (1331), 884 states have internal predecessors, (1331), 0 states have call successors, (0), 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 887 states. [2022-02-20 14:40:01,253 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:01,253 INFO L93 Difference]: Finished difference Result 887 states and 1332 transitions. [2022-02-20 14:40:01,253 INFO L276 IsEmpty]: Start isEmpty. Operand 887 states and 1332 transitions. [2022-02-20 14:40:01,254 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:01,254 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:01,254 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:01,254 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:01,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 885 states, 884 states have (on average 1.505656108597285) internal successors, (1331), 884 states have internal predecessors, (1331), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:01,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 885 states to 885 states and 1331 transitions. [2022-02-20 14:40:01,281 INFO L78 Accepts]: Start accepts. Automaton has 885 states and 1331 transitions. Word has length 21 [2022-02-20 14:40:01,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:01,282 INFO L470 AbstractCegarLoop]: Abstraction has 885 states and 1331 transitions. [2022-02-20 14:40:01,282 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:40:01,282 INFO L276 IsEmpty]: Start isEmpty. Operand 885 states and 1331 transitions. [2022-02-20 14:40:01,283 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:40:01,283 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:01,283 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:40:01,283 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 14:40:01,284 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:01,284 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:01,284 INFO L85 PathProgramCache]: Analyzing trace with hash 988285931, now seen corresponding path program 1 times [2022-02-20 14:40:01,284 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:01,284 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821988760] [2022-02-20 14:40:01,284 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:01,284 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:01,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:01,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {21933#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(15, 2);call #Ultimate.allocInit(12, 3); {21933#true} is VALID [2022-02-20 14:40:01,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {21933#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_~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_~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;havoc main_~cond~0#1; {21933#true} is VALID [2022-02-20 14:40:01,314 INFO L290 TraceCheckUtils]: 2: Hoare triple {21933#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {21933#true} is VALID [2022-02-20 14:40:01,315 INFO L290 TraceCheckUtils]: 3: Hoare triple {21933#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; {21933#true} is VALID [2022-02-20 14:40:01,315 INFO L290 TraceCheckUtils]: 4: Hoare triple {21933#true} assume !(0 != main_~p1~0#1); {21933#true} is VALID [2022-02-20 14:40:01,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {21933#true} assume !(0 != main_~p2~0#1); {21933#true} is VALID [2022-02-20 14:40:01,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {21933#true} assume !(0 != main_~p3~0#1); {21933#true} is VALID [2022-02-20 14:40:01,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {21933#true} assume !(0 != main_~p4~0#1); {21933#true} is VALID [2022-02-20 14:40:01,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {21933#true} assume !(0 != main_~p5~0#1); {21933#true} is VALID [2022-02-20 14:40:01,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {21933#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {21935#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:40:01,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {21935#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {21935#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:40:01,316 INFO L290 TraceCheckUtils]: 11: Hoare triple {21935#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {21935#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:40:01,316 INFO L290 TraceCheckUtils]: 12: Hoare triple {21935#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {21935#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:40:01,317 INFO L290 TraceCheckUtils]: 13: Hoare triple {21935#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p1~0#1); {21935#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:40:01,317 INFO L290 TraceCheckUtils]: 14: Hoare triple {21935#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p2~0#1); {21935#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:40:01,317 INFO L290 TraceCheckUtils]: 15: Hoare triple {21935#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p3~0#1); {21935#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:40:01,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {21935#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p4~0#1); {21935#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:40:01,318 INFO L290 TraceCheckUtils]: 17: Hoare triple {21935#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p5~0#1); {21935#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:40:01,318 INFO L290 TraceCheckUtils]: 18: Hoare triple {21935#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p6~0#1; {21935#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:40:01,318 INFO L290 TraceCheckUtils]: 19: Hoare triple {21935#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 1 != main_~lk6~0#1; {21934#false} is VALID [2022-02-20 14:40:01,319 INFO L290 TraceCheckUtils]: 20: Hoare triple {21934#false} assume !false; {21934#false} is VALID [2022-02-20 14:40:01,320 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:40:01,320 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:01,320 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821988760] [2022-02-20 14:40:01,320 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821988760] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:01,320 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:01,321 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:01,321 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759792871] [2022-02-20 14:40:01,321 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:01,321 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:40:01,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:01,322 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:40:01,333 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:40:01,333 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:01,334 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:01,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:01,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:01,334 INFO L87 Difference]: Start difference. First operand 885 states and 1331 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:40:01,464 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:01,464 INFO L93 Difference]: Finished difference Result 1545 states and 2357 transitions. [2022-02-20 14:40:01,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:01,464 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:40:01,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:01,465 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:40:01,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-02-20 14:40:01,466 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:40:01,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 95 transitions. [2022-02-20 14:40:01,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 95 transitions. [2022-02-20 14:40:01,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 95 edges. 95 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:01,640 INFO L225 Difference]: With dead ends: 1545 [2022-02-20 14:40:01,640 INFO L226 Difference]: Without dead ends: 1543 [2022-02-20 14:40:01,640 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:01,641 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 28 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 105 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:01,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 105 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:01,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1543 states. [2022-02-20 14:40:01,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1543 to 1285. [2022-02-20 14:40:01,662 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:01,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1543 states. Second operand has 1285 states, 1284 states have (on average 1.4602803738317758) internal successors, (1875), 1284 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:01,666 INFO L74 IsIncluded]: Start isIncluded. First operand 1543 states. Second operand has 1285 states, 1284 states have (on average 1.4602803738317758) internal successors, (1875), 1284 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:01,667 INFO L87 Difference]: Start difference. First operand 1543 states. Second operand has 1285 states, 1284 states have (on average 1.4602803738317758) internal successors, (1875), 1284 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:01,761 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:01,761 INFO L93 Difference]: Finished difference Result 1543 states and 2324 transitions. [2022-02-20 14:40:01,761 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2324 transitions. [2022-02-20 14:40:01,763 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:01,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:01,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 1285 states, 1284 states have (on average 1.4602803738317758) internal successors, (1875), 1284 states have internal predecessors, (1875), 0 states have call successors, (0), 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 1543 states. [2022-02-20 14:40:01,766 INFO L87 Difference]: Start difference. First operand has 1285 states, 1284 states have (on average 1.4602803738317758) internal successors, (1875), 1284 states have internal predecessors, (1875), 0 states have call successors, (0), 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 1543 states. [2022-02-20 14:40:01,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:01,849 INFO L93 Difference]: Finished difference Result 1543 states and 2324 transitions. [2022-02-20 14:40:01,849 INFO L276 IsEmpty]: Start isEmpty. Operand 1543 states and 2324 transitions. [2022-02-20 14:40:01,851 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:01,851 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:01,852 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:01,852 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:01,854 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1285 states, 1284 states have (on average 1.4602803738317758) internal successors, (1875), 1284 states have internal predecessors, (1875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:01,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1285 states to 1285 states and 1875 transitions. [2022-02-20 14:40:01,923 INFO L78 Accepts]: Start accepts. Automaton has 1285 states and 1875 transitions. Word has length 21 [2022-02-20 14:40:01,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:01,923 INFO L470 AbstractCegarLoop]: Abstraction has 1285 states and 1875 transitions. [2022-02-20 14:40:01,923 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:40:01,923 INFO L276 IsEmpty]: Start isEmpty. Operand 1285 states and 1875 transitions. [2022-02-20 14:40:01,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:40:01,925 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:01,925 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:40:01,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 14:40:01,926 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:01,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:01,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1246451369, now seen corresponding path program 1 times [2022-02-20 14:40:01,926 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:01,927 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1821453767] [2022-02-20 14:40:01,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:01,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:01,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:01,946 INFO L290 TraceCheckUtils]: 0: Hoare triple {27956#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(15, 2);call #Ultimate.allocInit(12, 3); {27956#true} is VALID [2022-02-20 14:40:01,946 INFO L290 TraceCheckUtils]: 1: Hoare triple {27956#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_~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_~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;havoc main_~cond~0#1; {27956#true} is VALID [2022-02-20 14:40:01,946 INFO L290 TraceCheckUtils]: 2: Hoare triple {27956#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {27956#true} is VALID [2022-02-20 14:40:01,946 INFO L290 TraceCheckUtils]: 3: Hoare triple {27956#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; {27956#true} is VALID [2022-02-20 14:40:01,946 INFO L290 TraceCheckUtils]: 4: Hoare triple {27956#true} assume !(0 != main_~p1~0#1); {27956#true} is VALID [2022-02-20 14:40:01,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {27956#true} assume !(0 != main_~p2~0#1); {27956#true} is VALID [2022-02-20 14:40:01,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {27956#true} assume !(0 != main_~p3~0#1); {27956#true} is VALID [2022-02-20 14:40:01,947 INFO L290 TraceCheckUtils]: 7: Hoare triple {27956#true} assume !(0 != main_~p4~0#1); {27956#true} is VALID [2022-02-20 14:40:01,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {27956#true} assume !(0 != main_~p5~0#1); {27956#true} is VALID [2022-02-20 14:40:01,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {27956#true} assume !(0 != main_~p6~0#1); {27958#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:40:01,948 INFO L290 TraceCheckUtils]: 10: Hoare triple {27958#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {27958#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:40:01,948 INFO L290 TraceCheckUtils]: 11: Hoare triple {27958#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {27958#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:40:01,949 INFO L290 TraceCheckUtils]: 12: Hoare triple {27958#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {27958#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:40:01,949 INFO L290 TraceCheckUtils]: 13: Hoare triple {27958#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p1~0#1); {27958#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:40:01,949 INFO L290 TraceCheckUtils]: 14: Hoare triple {27958#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p2~0#1); {27958#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:40:01,949 INFO L290 TraceCheckUtils]: 15: Hoare triple {27958#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p3~0#1); {27958#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:40:01,950 INFO L290 TraceCheckUtils]: 16: Hoare triple {27958#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p4~0#1); {27958#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:40:01,950 INFO L290 TraceCheckUtils]: 17: Hoare triple {27958#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p5~0#1); {27958#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:40:01,950 INFO L290 TraceCheckUtils]: 18: Hoare triple {27958#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p6~0#1; {27957#false} is VALID [2022-02-20 14:40:01,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {27957#false} assume 1 != main_~lk6~0#1; {27957#false} is VALID [2022-02-20 14:40:01,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {27957#false} assume !false; {27957#false} is VALID [2022-02-20 14:40:01,951 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:40:01,951 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:01,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1821453767] [2022-02-20 14:40:01,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1821453767] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:01,951 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:01,951 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:01,952 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1825261028] [2022-02-20 14:40:01,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:01,952 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:40:01,952 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:01,952 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:40:01,963 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:40:01,963 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:01,964 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:01,964 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:01,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:01,964 INFO L87 Difference]: Start difference. First operand 1285 states and 1875 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:40:02,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:02,302 INFO L93 Difference]: Finished difference Result 2953 states and 4309 transitions. [2022-02-20 14:40:02,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:02,303 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:40:02,303 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:02,303 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:40:02,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2022-02-20 14:40:02,304 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:40:02,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 155 transitions. [2022-02-20 14:40:02,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 155 transitions. [2022-02-20 14:40:02,391 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:02,485 INFO L225 Difference]: With dead ends: 2953 [2022-02-20 14:40:02,485 INFO L226 Difference]: Without dead ends: 1703 [2022-02-20 14:40:02,487 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,487 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 38 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:40:02,488 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 134 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:40:02,489 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1703 states. [2022-02-20 14:40:02,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1703 to 1701. [2022-02-20 14:40:02,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:02,520 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1703 states. Second operand has 1701 states, 1700 states have (on average 1.4323529411764706) internal successors, (2435), 1700 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call 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,521 INFO L74 IsIncluded]: Start isIncluded. First operand 1703 states. Second operand has 1701 states, 1700 states have (on average 1.4323529411764706) internal successors, (2435), 1700 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call 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,522 INFO L87 Difference]: Start difference. First operand 1703 states. Second operand has 1701 states, 1700 states have (on average 1.4323529411764706) internal successors, (2435), 1700 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call 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,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:02,612 INFO L93 Difference]: Finished difference Result 1703 states and 2436 transitions. [2022-02-20 14:40:02,612 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2436 transitions. [2022-02-20 14:40:02,615 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:02,615 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:02,617 INFO L74 IsIncluded]: Start isIncluded. First operand has 1701 states, 1700 states have (on average 1.4323529411764706) internal successors, (2435), 1700 states have internal predecessors, (2435), 0 states have call successors, (0), 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 1703 states. [2022-02-20 14:40:02,619 INFO L87 Difference]: Start difference. First operand has 1701 states, 1700 states have (on average 1.4323529411764706) internal successors, (2435), 1700 states have internal predecessors, (2435), 0 states have call successors, (0), 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 1703 states. [2022-02-20 14:40:02,732 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:02,732 INFO L93 Difference]: Finished difference Result 1703 states and 2436 transitions. [2022-02-20 14:40:02,732 INFO L276 IsEmpty]: Start isEmpty. Operand 1703 states and 2436 transitions. [2022-02-20 14:40:02,734 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:02,735 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:02,735 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:02,735 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:02,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1701 states, 1700 states have (on average 1.4323529411764706) internal successors, (2435), 1700 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call 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,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1701 states to 1701 states and 2435 transitions. [2022-02-20 14:40:02,827 INFO L78 Accepts]: Start accepts. Automaton has 1701 states and 2435 transitions. Word has length 21 [2022-02-20 14:40:02,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:02,827 INFO L470 AbstractCegarLoop]: Abstraction has 1701 states and 2435 transitions. [2022-02-20 14:40:02,827 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:40:02,827 INFO L276 IsEmpty]: Start isEmpty. Operand 1701 states and 2435 transitions. [2022-02-20 14:40:02,829 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 14:40:02,829 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:02,829 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:40:02,829 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 14:40:02,829 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:02,830 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:02,830 INFO L85 PathProgramCache]: Analyzing trace with hash 572308166, now seen corresponding path program 1 times [2022-02-20 14:40:02,830 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:02,830 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429246889] [2022-02-20 14:40:02,830 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:02,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:02,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:02,859 INFO L290 TraceCheckUtils]: 0: Hoare triple {36187#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(15, 2);call #Ultimate.allocInit(12, 3); {36187#true} is VALID [2022-02-20 14:40:02,859 INFO L290 TraceCheckUtils]: 1: Hoare triple {36187#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_~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_~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;havoc main_~cond~0#1; {36187#true} is VALID [2022-02-20 14:40:02,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {36187#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {36187#true} is VALID [2022-02-20 14:40:02,859 INFO L290 TraceCheckUtils]: 3: Hoare triple {36187#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; {36187#true} is VALID [2022-02-20 14:40:02,860 INFO L290 TraceCheckUtils]: 4: Hoare triple {36187#true} assume !(0 != main_~p1~0#1); {36187#true} is VALID [2022-02-20 14:40:02,860 INFO L290 TraceCheckUtils]: 5: Hoare triple {36187#true} assume !(0 != main_~p2~0#1); {36187#true} is VALID [2022-02-20 14:40:02,860 INFO L290 TraceCheckUtils]: 6: Hoare triple {36187#true} assume !(0 != main_~p3~0#1); {36187#true} is VALID [2022-02-20 14:40:02,860 INFO L290 TraceCheckUtils]: 7: Hoare triple {36187#true} assume !(0 != main_~p4~0#1); {36187#true} is VALID [2022-02-20 14:40:02,861 INFO L290 TraceCheckUtils]: 8: Hoare triple {36187#true} assume !(0 != main_~p5~0#1); {36187#true} is VALID [2022-02-20 14:40:02,861 INFO L290 TraceCheckUtils]: 9: Hoare triple {36187#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {36189#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:40:02,861 INFO L290 TraceCheckUtils]: 10: Hoare triple {36189#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {36189#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:40:02,862 INFO L290 TraceCheckUtils]: 11: Hoare triple {36189#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {36189#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:40:02,862 INFO L290 TraceCheckUtils]: 12: Hoare triple {36189#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {36189#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:40:02,863 INFO L290 TraceCheckUtils]: 13: Hoare triple {36189#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p1~0#1); {36189#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:40:02,863 INFO L290 TraceCheckUtils]: 14: Hoare triple {36189#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p2~0#1); {36189#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:40:02,864 INFO L290 TraceCheckUtils]: 15: Hoare triple {36189#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p3~0#1); {36189#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:40:02,864 INFO L290 TraceCheckUtils]: 16: Hoare triple {36189#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p4~0#1); {36189#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:40:02,864 INFO L290 TraceCheckUtils]: 17: Hoare triple {36189#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p5~0#1); {36189#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-20 14:40:02,865 INFO L290 TraceCheckUtils]: 18: Hoare triple {36189#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p6~0#1); {36188#false} is VALID [2022-02-20 14:40:02,865 INFO L290 TraceCheckUtils]: 19: Hoare triple {36188#false} assume 0 != main_~p7~0#1; {36188#false} is VALID [2022-02-20 14:40:02,865 INFO L290 TraceCheckUtils]: 20: Hoare triple {36188#false} assume 1 != main_~lk7~0#1; {36188#false} is VALID [2022-02-20 14:40:02,865 INFO L290 TraceCheckUtils]: 21: Hoare triple {36188#false} assume !false; {36188#false} is VALID [2022-02-20 14:40:02,865 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:40:02,866 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:02,866 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429246889] [2022-02-20 14:40:02,866 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1429246889] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:02,866 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:02,866 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:02,866 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1077549661] [2022-02-20 14:40:02,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:02,867 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:40:02,867 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:02,867 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:40:02,878 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:40:02,879 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:02,879 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:02,880 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:02,880 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:02,880 INFO L87 Difference]: Start difference. First operand 1701 states and 2435 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:40:03,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:03,164 INFO L93 Difference]: Finished difference Result 2553 states and 3637 transitions. [2022-02-20 14:40:03,165 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:03,165 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:40:03,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:03,165 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:40:03,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2022-02-20 14:40:03,166 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:40:03,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2022-02-20 14:40:03,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2022-02-20 14:40:03,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:03,369 INFO L225 Difference]: With dead ends: 2553 [2022-02-20 14:40:03,370 INFO L226 Difference]: Without dead ends: 1735 [2022-02-20 14:40:03,371 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:03,372 INFO L933 BasicCegarLoop]: 77 mSDtfsCounter, 40 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 124 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:03,373 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 124 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:03,375 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1735 states. [2022-02-20 14:40:03,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1735 to 1733. [2022-02-20 14:40:03,413 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:03,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1735 states. Second operand has 1733 states, 1732 states have (on average 1.4058891454965359) internal successors, (2435), 1732 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call 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:03,416 INFO L74 IsIncluded]: Start isIncluded. First operand 1735 states. Second operand has 1733 states, 1732 states have (on average 1.4058891454965359) internal successors, (2435), 1732 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call 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:03,417 INFO L87 Difference]: Start difference. First operand 1735 states. Second operand has 1733 states, 1732 states have (on average 1.4058891454965359) internal successors, (2435), 1732 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call 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:03,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:03,512 INFO L93 Difference]: Finished difference Result 1735 states and 2436 transitions. [2022-02-20 14:40:03,513 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2436 transitions. [2022-02-20 14:40:03,514 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:03,515 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:03,517 INFO L74 IsIncluded]: Start isIncluded. First operand has 1733 states, 1732 states have (on average 1.4058891454965359) internal successors, (2435), 1732 states have internal predecessors, (2435), 0 states have call successors, (0), 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 1735 states. [2022-02-20 14:40:03,518 INFO L87 Difference]: Start difference. First operand has 1733 states, 1732 states have (on average 1.4058891454965359) internal successors, (2435), 1732 states have internal predecessors, (2435), 0 states have call successors, (0), 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 1735 states. [2022-02-20 14:40:03,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:03,611 INFO L93 Difference]: Finished difference Result 1735 states and 2436 transitions. [2022-02-20 14:40:03,611 INFO L276 IsEmpty]: Start isEmpty. Operand 1735 states and 2436 transitions. [2022-02-20 14:40:03,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:03,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:03,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:03,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:03,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1733 states, 1732 states have (on average 1.4058891454965359) internal successors, (2435), 1732 states have internal predecessors, (2435), 0 states have call successors, (0), 0 states have call 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:03,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1733 states to 1733 states and 2435 transitions. [2022-02-20 14:40:03,709 INFO L78 Accepts]: Start accepts. Automaton has 1733 states and 2435 transitions. Word has length 22 [2022-02-20 14:40:03,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:03,709 INFO L470 AbstractCegarLoop]: Abstraction has 1733 states and 2435 transitions. [2022-02-20 14:40:03,709 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:40:03,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1733 states and 2435 transitions. [2022-02-20 14:40:03,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 14:40:03,711 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:03,711 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:40:03,711 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 14:40:03,711 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:03,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:03,712 INFO L85 PathProgramCache]: Analyzing trace with hash -14497848, now seen corresponding path program 1 times [2022-02-20 14:40:03,712 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:03,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1789180278] [2022-02-20 14:40:03,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:03,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:03,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:03,732 INFO L290 TraceCheckUtils]: 0: Hoare triple {44114#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(15, 2);call #Ultimate.allocInit(12, 3); {44114#true} is VALID [2022-02-20 14:40:03,732 INFO L290 TraceCheckUtils]: 1: Hoare triple {44114#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_~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_~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;havoc main_~cond~0#1; {44114#true} is VALID [2022-02-20 14:40:03,732 INFO L290 TraceCheckUtils]: 2: Hoare triple {44114#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {44114#true} is VALID [2022-02-20 14:40:03,733 INFO L290 TraceCheckUtils]: 3: Hoare triple {44114#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; {44114#true} is VALID [2022-02-20 14:40:03,733 INFO L290 TraceCheckUtils]: 4: Hoare triple {44114#true} assume !(0 != main_~p1~0#1); {44114#true} is VALID [2022-02-20 14:40:03,733 INFO L290 TraceCheckUtils]: 5: Hoare triple {44114#true} assume !(0 != main_~p2~0#1); {44114#true} is VALID [2022-02-20 14:40:03,733 INFO L290 TraceCheckUtils]: 6: Hoare triple {44114#true} assume !(0 != main_~p3~0#1); {44114#true} is VALID [2022-02-20 14:40:03,733 INFO L290 TraceCheckUtils]: 7: Hoare triple {44114#true} assume !(0 != main_~p4~0#1); {44114#true} is VALID [2022-02-20 14:40:03,733 INFO L290 TraceCheckUtils]: 8: Hoare triple {44114#true} assume !(0 != main_~p5~0#1); {44114#true} is VALID [2022-02-20 14:40:03,733 INFO L290 TraceCheckUtils]: 9: Hoare triple {44114#true} assume !(0 != main_~p6~0#1); {44114#true} is VALID [2022-02-20 14:40:03,734 INFO L290 TraceCheckUtils]: 10: Hoare triple {44114#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {44116#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:40:03,734 INFO L290 TraceCheckUtils]: 11: Hoare triple {44116#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {44116#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:40:03,734 INFO L290 TraceCheckUtils]: 12: Hoare triple {44116#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {44116#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:40:03,735 INFO L290 TraceCheckUtils]: 13: Hoare triple {44116#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p1~0#1); {44116#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:40:03,735 INFO L290 TraceCheckUtils]: 14: Hoare triple {44116#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p2~0#1); {44116#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:40:03,735 INFO L290 TraceCheckUtils]: 15: Hoare triple {44116#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p3~0#1); {44116#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:40:03,735 INFO L290 TraceCheckUtils]: 16: Hoare triple {44116#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p4~0#1); {44116#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:40:03,736 INFO L290 TraceCheckUtils]: 17: Hoare triple {44116#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p5~0#1); {44116#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:40:03,736 INFO L290 TraceCheckUtils]: 18: Hoare triple {44116#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p6~0#1); {44116#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:40:03,736 INFO L290 TraceCheckUtils]: 19: Hoare triple {44116#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p7~0#1; {44116#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-20 14:40:03,737 INFO L290 TraceCheckUtils]: 20: Hoare triple {44116#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 1 != main_~lk7~0#1; {44115#false} is VALID [2022-02-20 14:40:03,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {44115#false} assume !false; {44115#false} is VALID [2022-02-20 14:40:03,737 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:03,737 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:03,737 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1789180278] [2022-02-20 14:40:03,737 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1789180278] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:03,737 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:03,737 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:03,738 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126934434] [2022-02-20 14:40:03,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:03,738 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:40:03,738 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:03,738 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:40:03,749 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:40:03,749 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:03,750 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:03,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:03,750 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:03,750 INFO L87 Difference]: Start difference. First operand 1733 states and 2435 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:40:04,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:04,031 INFO L93 Difference]: Finished difference Result 2953 states and 4197 transitions. [2022-02-20 14:40:04,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:04,032 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:40:04,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:04,032 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:40:04,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-02-20 14:40:04,033 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:40:04,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 91 transitions. [2022-02-20 14:40:04,034 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 91 transitions. [2022-02-20 14:40:04,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:04,331 INFO L225 Difference]: With dead ends: 2953 [2022-02-20 14:40:04,332 INFO L226 Difference]: Without dead ends: 2951 [2022-02-20 14:40:04,333 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:04,333 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 25 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 103 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:04,335 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 103 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:04,336 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2951 states. [2022-02-20 14:40:04,376 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2951 to 2565. [2022-02-20 14:40:04,376 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:04,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2951 states. Second operand has 2565 states, 2564 states have (on average 1.361544461778471) internal successors, (3491), 2564 states have internal predecessors, (3491), 0 states have call successors, (0), 0 states have call 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,380 INFO L74 IsIncluded]: Start isIncluded. First operand 2951 states. Second operand has 2565 states, 2564 states have (on average 1.361544461778471) internal successors, (3491), 2564 states have internal predecessors, (3491), 0 states have call successors, (0), 0 states have call 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,382 INFO L87 Difference]: Start difference. First operand 2951 states. Second operand has 2565 states, 2564 states have (on average 1.361544461778471) internal successors, (3491), 2564 states have internal predecessors, (3491), 0 states have call successors, (0), 0 states have call 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,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:04,592 INFO L93 Difference]: Finished difference Result 2951 states and 4132 transitions. [2022-02-20 14:40:04,592 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 4132 transitions. [2022-02-20 14:40:04,594 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:04,595 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:04,597 INFO L74 IsIncluded]: Start isIncluded. First operand has 2565 states, 2564 states have (on average 1.361544461778471) internal successors, (3491), 2564 states have internal predecessors, (3491), 0 states have call successors, (0), 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 2951 states. [2022-02-20 14:40:04,599 INFO L87 Difference]: Start difference. First operand has 2565 states, 2564 states have (on average 1.361544461778471) internal successors, (3491), 2564 states have internal predecessors, (3491), 0 states have call successors, (0), 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 2951 states. [2022-02-20 14:40:04,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:04,819 INFO L93 Difference]: Finished difference Result 2951 states and 4132 transitions. [2022-02-20 14:40:04,819 INFO L276 IsEmpty]: Start isEmpty. Operand 2951 states and 4132 transitions. [2022-02-20 14:40:04,822 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:04,822 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:04,822 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:04,822 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:04,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2565 states, 2564 states have (on average 1.361544461778471) internal successors, (3491), 2564 states have internal predecessors, (3491), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:05,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2565 states to 2565 states and 3491 transitions. [2022-02-20 14:40:05,014 INFO L78 Accepts]: Start accepts. Automaton has 2565 states and 3491 transitions. Word has length 22 [2022-02-20 14:40:05,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:05,014 INFO L470 AbstractCegarLoop]: Abstraction has 2565 states and 3491 transitions. [2022-02-20 14:40:05,014 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:40:05,014 INFO L276 IsEmpty]: Start isEmpty. Operand 2565 states and 3491 transitions. [2022-02-20 14:40:05,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 14:40:05,017 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:05,017 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:40:05,017 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 14:40:05,017 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:05,017 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:05,017 INFO L85 PathProgramCache]: Analyzing trace with hash 243667590, now seen corresponding path program 1 times [2022-02-20 14:40:05,018 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:05,018 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [618200237] [2022-02-20 14:40:05,018 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:05,018 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:05,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:05,044 INFO L290 TraceCheckUtils]: 0: Hoare triple {55737#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2);call #Ultimate.allocInit(12, 3); {55737#true} is VALID [2022-02-20 14:40:05,045 INFO L290 TraceCheckUtils]: 1: Hoare triple {55737#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_~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_~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;havoc main_~cond~0#1; {55737#true} is VALID [2022-02-20 14:40:05,045 INFO L290 TraceCheckUtils]: 2: Hoare triple {55737#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {55737#true} is VALID [2022-02-20 14:40:05,045 INFO L290 TraceCheckUtils]: 3: Hoare triple {55737#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0; {55737#true} is VALID [2022-02-20 14:40:05,045 INFO L290 TraceCheckUtils]: 4: Hoare triple {55737#true} assume !(0 != main_~p1~0#1); {55737#true} is VALID [2022-02-20 14:40:05,045 INFO L290 TraceCheckUtils]: 5: Hoare triple {55737#true} assume !(0 != main_~p2~0#1); {55737#true} is VALID [2022-02-20 14:40:05,045 INFO L290 TraceCheckUtils]: 6: Hoare triple {55737#true} assume !(0 != main_~p3~0#1); {55737#true} is VALID [2022-02-20 14:40:05,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {55737#true} assume !(0 != main_~p4~0#1); {55737#true} is VALID [2022-02-20 14:40:05,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {55737#true} assume !(0 != main_~p5~0#1); {55737#true} is VALID [2022-02-20 14:40:05,050 INFO L290 TraceCheckUtils]: 9: Hoare triple {55737#true} assume !(0 != main_~p6~0#1); {55737#true} is VALID [2022-02-20 14:40:05,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {55737#true} assume !(0 != main_~p7~0#1); {55739#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:40:05,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {55739#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {55739#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:40:05,051 INFO L290 TraceCheckUtils]: 12: Hoare triple {55739#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {55739#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:40:05,051 INFO L290 TraceCheckUtils]: 13: Hoare triple {55739#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p1~0#1); {55739#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:40:05,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {55739#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p2~0#1); {55739#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:40:05,051 INFO L290 TraceCheckUtils]: 15: Hoare triple {55739#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p3~0#1); {55739#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:40:05,052 INFO L290 TraceCheckUtils]: 16: Hoare triple {55739#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p4~0#1); {55739#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:40:05,052 INFO L290 TraceCheckUtils]: 17: Hoare triple {55739#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p5~0#1); {55739#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:40:05,052 INFO L290 TraceCheckUtils]: 18: Hoare triple {55739#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p6~0#1); {55739#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-20 14:40:05,053 INFO L290 TraceCheckUtils]: 19: Hoare triple {55739#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p7~0#1; {55738#false} is VALID [2022-02-20 14:40:05,053 INFO L290 TraceCheckUtils]: 20: Hoare triple {55738#false} assume 1 != main_~lk7~0#1; {55738#false} is VALID [2022-02-20 14:40:05,053 INFO L290 TraceCheckUtils]: 21: Hoare triple {55738#false} assume !false; {55738#false} is VALID [2022-02-20 14:40:05,053 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:05,053 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:05,053 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [618200237] [2022-02-20 14:40:05,053 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [618200237] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:05,053 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:05,054 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:05,054 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1946994862] [2022-02-20 14:40:05,054 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:05,055 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:40:05,055 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:05,055 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:40:05,066 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:40:05,066 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:05,066 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:05,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:05,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:05,067 INFO L87 Difference]: Start difference. First operand 2565 states and 3491 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:40:06,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:06,036 INFO L93 Difference]: Finished difference Result 5833 states and 7909 transitions. [2022-02-20 14:40:06,036 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:06,036 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:40:06,037 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:06,037 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:40:06,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2022-02-20 14:40:06,037 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:40:06,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2022-02-20 14:40:06,038 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 152 transitions. [2022-02-20 14:40:06,115 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 152 edges. 152 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:06,546 INFO L225 Difference]: With dead ends: 5833 [2022-02-20 14:40:06,546 INFO L226 Difference]: Without dead ends: 3335 [2022-02-20 14:40:06,557 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:06,558 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 37 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:40:06,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:40:06,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3335 states. [2022-02-20 14:40:06,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3335 to 3333. [2022-02-20 14:40:06,619 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:06,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3335 states. Second operand has 3333 states, 3332 states have (on average 1.3262304921968788) internal successors, (4419), 3332 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call 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:06,624 INFO L74 IsIncluded]: Start isIncluded. First operand 3335 states. Second operand has 3333 states, 3332 states have (on average 1.3262304921968788) internal successors, (4419), 3332 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call 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:06,627 INFO L87 Difference]: Start difference. First operand 3335 states. Second operand has 3333 states, 3332 states have (on average 1.3262304921968788) internal successors, (4419), 3332 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call 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:06,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:06,958 INFO L93 Difference]: Finished difference Result 3335 states and 4420 transitions. [2022-02-20 14:40:06,958 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 4420 transitions. [2022-02-20 14:40:06,961 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:06,961 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:06,965 INFO L74 IsIncluded]: Start isIncluded. First operand has 3333 states, 3332 states have (on average 1.3262304921968788) internal successors, (4419), 3332 states have internal predecessors, (4419), 0 states have call successors, (0), 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 3335 states. [2022-02-20 14:40:06,968 INFO L87 Difference]: Start difference. First operand has 3333 states, 3332 states have (on average 1.3262304921968788) internal successors, (4419), 3332 states have internal predecessors, (4419), 0 states have call successors, (0), 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 3335 states. [2022-02-20 14:40:07,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:07,319 INFO L93 Difference]: Finished difference Result 3335 states and 4420 transitions. [2022-02-20 14:40:07,319 INFO L276 IsEmpty]: Start isEmpty. Operand 3335 states and 4420 transitions. [2022-02-20 14:40:07,322 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:07,322 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:07,322 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:07,323 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:07,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3333 states, 3332 states have (on average 1.3262304921968788) internal successors, (4419), 3332 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:07,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3333 states to 3333 states and 4419 transitions. [2022-02-20 14:40:07,684 INFO L78 Accepts]: Start accepts. Automaton has 3333 states and 4419 transitions. Word has length 22 [2022-02-20 14:40:07,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:07,685 INFO L470 AbstractCegarLoop]: Abstraction has 3333 states and 4419 transitions. [2022-02-20 14:40:07,685 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:40:07,685 INFO L276 IsEmpty]: Start isEmpty. Operand 3333 states and 4419 transitions. [2022-02-20 14:40:07,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 14:40:07,688 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:07,688 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:40:07,688 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-20 14:40:07,688 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:07,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:07,688 INFO L85 PathProgramCache]: Analyzing trace with hash -449217570, now seen corresponding path program 1 times [2022-02-20 14:40:07,688 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:07,689 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [830303214] [2022-02-20 14:40:07,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:07,689 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:07,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:07,720 INFO L290 TraceCheckUtils]: 0: Hoare triple {71904#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(15, 2);call #Ultimate.allocInit(12, 3); {71904#true} is VALID [2022-02-20 14:40:07,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {71904#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_~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_~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;havoc main_~cond~0#1; {71904#true} is VALID [2022-02-20 14:40:07,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {71904#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {71904#true} is VALID [2022-02-20 14:40:07,721 INFO L290 TraceCheckUtils]: 3: Hoare triple {71904#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; {71904#true} is VALID [2022-02-20 14:40:07,721 INFO L290 TraceCheckUtils]: 4: Hoare triple {71904#true} assume !(0 != main_~p1~0#1); {71904#true} is VALID [2022-02-20 14:40:07,721 INFO L290 TraceCheckUtils]: 5: Hoare triple {71904#true} assume !(0 != main_~p2~0#1); {71904#true} is VALID [2022-02-20 14:40:07,721 INFO L290 TraceCheckUtils]: 6: Hoare triple {71904#true} assume !(0 != main_~p3~0#1); {71904#true} is VALID [2022-02-20 14:40:07,722 INFO L290 TraceCheckUtils]: 7: Hoare triple {71904#true} assume !(0 != main_~p4~0#1); {71904#true} is VALID [2022-02-20 14:40:07,722 INFO L290 TraceCheckUtils]: 8: Hoare triple {71904#true} assume !(0 != main_~p5~0#1); {71904#true} is VALID [2022-02-20 14:40:07,723 INFO L290 TraceCheckUtils]: 9: Hoare triple {71904#true} assume !(0 != main_~p6~0#1); {71904#true} is VALID [2022-02-20 14:40:07,724 INFO L290 TraceCheckUtils]: 10: Hoare triple {71904#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {71906#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:40:07,725 INFO L290 TraceCheckUtils]: 11: Hoare triple {71906#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {71906#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:40:07,725 INFO L290 TraceCheckUtils]: 12: Hoare triple {71906#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {71906#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:40:07,725 INFO L290 TraceCheckUtils]: 13: Hoare triple {71906#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p1~0#1); {71906#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:40:07,725 INFO L290 TraceCheckUtils]: 14: Hoare triple {71906#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p2~0#1); {71906#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:40:07,726 INFO L290 TraceCheckUtils]: 15: Hoare triple {71906#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p3~0#1); {71906#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:40:07,726 INFO L290 TraceCheckUtils]: 16: Hoare triple {71906#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p4~0#1); {71906#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:40:07,726 INFO L290 TraceCheckUtils]: 17: Hoare triple {71906#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p5~0#1); {71906#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:40:07,727 INFO L290 TraceCheckUtils]: 18: Hoare triple {71906#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p6~0#1); {71906#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-20 14:40:07,727 INFO L290 TraceCheckUtils]: 19: Hoare triple {71906#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p7~0#1); {71905#false} is VALID [2022-02-20 14:40:07,727 INFO L290 TraceCheckUtils]: 20: Hoare triple {71905#false} assume 0 != main_~p8~0#1; {71905#false} is VALID [2022-02-20 14:40:07,727 INFO L290 TraceCheckUtils]: 21: Hoare triple {71905#false} assume 1 != main_~lk8~0#1; {71905#false} is VALID [2022-02-20 14:40:07,727 INFO L290 TraceCheckUtils]: 22: Hoare triple {71905#false} assume !false; {71905#false} is VALID [2022-02-20 14:40:07,728 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:07,728 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:07,728 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [830303214] [2022-02-20 14:40:07,728 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [830303214] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:07,728 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:07,728 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:07,728 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [215714091] [2022-02-20 14:40:07,729 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:07,729 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:40:07,729 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:07,729 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:40:07,740 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:40:07,741 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:07,741 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:07,741 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:07,741 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:07,741 INFO L87 Difference]: Start difference. First operand 3333 states and 4419 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:40:08,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:08,522 INFO L93 Difference]: Finished difference Result 5001 states and 6597 transitions. [2022-02-20 14:40:08,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:08,523 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:40:08,523 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:08,523 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:40:08,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2022-02-20 14:40:08,523 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:40:08,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2022-02-20 14:40:08,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 147 transitions. [2022-02-20 14:40:08,605 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:08,994 INFO L225 Difference]: With dead ends: 5001 [2022-02-20 14:40:08,995 INFO L226 Difference]: Without dead ends: 3399 [2022-02-20 14:40:08,996 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:08,996 INFO L933 BasicCegarLoop]: 74 mSDtfsCounter, 39 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 120 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:08,997 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 120 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:08,999 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3399 states. [2022-02-20 14:40:09,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3399 to 3397. [2022-02-20 14:40:09,044 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:09,047 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3399 states. Second operand has 3397 states, 3396 states have (on average 1.3012367491166077) internal successors, (4419), 3396 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call 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:09,050 INFO L74 IsIncluded]: Start isIncluded. First operand 3399 states. Second operand has 3397 states, 3396 states have (on average 1.3012367491166077) internal successors, (4419), 3396 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call 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:09,051 INFO L87 Difference]: Start difference. First operand 3399 states. Second operand has 3397 states, 3396 states have (on average 1.3012367491166077) internal successors, (4419), 3396 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call 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:09,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:09,407 INFO L93 Difference]: Finished difference Result 3399 states and 4420 transitions. [2022-02-20 14:40:09,407 INFO L276 IsEmpty]: Start isEmpty. Operand 3399 states and 4420 transitions. [2022-02-20 14:40:09,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:09,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:09,414 INFO L74 IsIncluded]: Start isIncluded. First operand has 3397 states, 3396 states have (on average 1.3012367491166077) internal successors, (4419), 3396 states have internal predecessors, (4419), 0 states have call successors, (0), 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 3399 states. [2022-02-20 14:40:09,416 INFO L87 Difference]: Start difference. First operand has 3397 states, 3396 states have (on average 1.3012367491166077) internal successors, (4419), 3396 states have internal predecessors, (4419), 0 states have call successors, (0), 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 3399 states. [2022-02-20 14:40:09,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:09,757 INFO L93 Difference]: Finished difference Result 3399 states and 4420 transitions. [2022-02-20 14:40:09,757 INFO L276 IsEmpty]: Start isEmpty. Operand 3399 states and 4420 transitions. [2022-02-20 14:40:09,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:09,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:09,760 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:09,760 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:09,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3397 states, 3396 states have (on average 1.3012367491166077) internal successors, (4419), 3396 states have internal predecessors, (4419), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:10,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3397 states to 3397 states and 4419 transitions. [2022-02-20 14:40:10,152 INFO L78 Accepts]: Start accepts. Automaton has 3397 states and 4419 transitions. Word has length 23 [2022-02-20 14:40:10,152 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:10,152 INFO L470 AbstractCegarLoop]: Abstraction has 3397 states and 4419 transitions. [2022-02-20 14:40:10,152 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:40:10,152 INFO L276 IsEmpty]: Start isEmpty. Operand 3397 states and 4419 transitions. [2022-02-20 14:40:10,154 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 14:40:10,154 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:10,154 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:40:10,155 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-20 14:40:10,155 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:10,155 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:10,155 INFO L85 PathProgramCache]: Analyzing trace with hash -1036023584, now seen corresponding path program 1 times [2022-02-20 14:40:10,155 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:10,155 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [436670828] [2022-02-20 14:40:10,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:10,156 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:10,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:10,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {87431#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(15, 2);call #Ultimate.allocInit(12, 3); {87431#true} is VALID [2022-02-20 14:40:10,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {87431#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_~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_~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;havoc main_~cond~0#1; {87431#true} is VALID [2022-02-20 14:40:10,174 INFO L290 TraceCheckUtils]: 2: Hoare triple {87431#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {87431#true} is VALID [2022-02-20 14:40:10,174 INFO L290 TraceCheckUtils]: 3: Hoare triple {87431#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; {87431#true} is VALID [2022-02-20 14:40:10,174 INFO L290 TraceCheckUtils]: 4: Hoare triple {87431#true} assume !(0 != main_~p1~0#1); {87431#true} is VALID [2022-02-20 14:40:10,174 INFO L290 TraceCheckUtils]: 5: Hoare triple {87431#true} assume !(0 != main_~p2~0#1); {87431#true} is VALID [2022-02-20 14:40:10,174 INFO L290 TraceCheckUtils]: 6: Hoare triple {87431#true} assume !(0 != main_~p3~0#1); {87431#true} is VALID [2022-02-20 14:40:10,175 INFO L290 TraceCheckUtils]: 7: Hoare triple {87431#true} assume !(0 != main_~p4~0#1); {87431#true} is VALID [2022-02-20 14:40:10,175 INFO L290 TraceCheckUtils]: 8: Hoare triple {87431#true} assume !(0 != main_~p5~0#1); {87431#true} is VALID [2022-02-20 14:40:10,175 INFO L290 TraceCheckUtils]: 9: Hoare triple {87431#true} assume !(0 != main_~p6~0#1); {87431#true} is VALID [2022-02-20 14:40:10,175 INFO L290 TraceCheckUtils]: 10: Hoare triple {87431#true} assume !(0 != main_~p7~0#1); {87431#true} is VALID [2022-02-20 14:40:10,175 INFO L290 TraceCheckUtils]: 11: Hoare triple {87431#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {87433#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:10,176 INFO L290 TraceCheckUtils]: 12: Hoare triple {87433#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {87433#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:10,176 INFO L290 TraceCheckUtils]: 13: Hoare triple {87433#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p1~0#1); {87433#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:10,176 INFO L290 TraceCheckUtils]: 14: Hoare triple {87433#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p2~0#1); {87433#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:10,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {87433#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p3~0#1); {87433#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:10,177 INFO L290 TraceCheckUtils]: 16: Hoare triple {87433#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p4~0#1); {87433#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:10,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {87433#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p5~0#1); {87433#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:10,177 INFO L290 TraceCheckUtils]: 18: Hoare triple {87433#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p6~0#1); {87433#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:10,177 INFO L290 TraceCheckUtils]: 19: Hoare triple {87433#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p7~0#1); {87433#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:10,178 INFO L290 TraceCheckUtils]: 20: Hoare triple {87433#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p8~0#1; {87433#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-20 14:40:10,178 INFO L290 TraceCheckUtils]: 21: Hoare triple {87433#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 1 != main_~lk8~0#1; {87432#false} is VALID [2022-02-20 14:40:10,178 INFO L290 TraceCheckUtils]: 22: Hoare triple {87432#false} assume !false; {87432#false} is VALID [2022-02-20 14:40:10,178 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:10,178 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:10,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [436670828] [2022-02-20 14:40:10,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [436670828] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:10,179 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:10,179 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:10,179 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [91938513] [2022-02-20 14:40:10,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:10,180 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:40:10,180 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:10,180 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:40:10,192 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:40:10,193 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:10,193 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:10,193 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:10,193 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:10,193 INFO L87 Difference]: Start difference. First operand 3397 states and 4419 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:40:11,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:11,212 INFO L93 Difference]: Finished difference Result 5641 states and 7365 transitions. [2022-02-20 14:40:11,219 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:11,219 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:40:11,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:11,219 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:40:11,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-02-20 14:40:11,220 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:40:11,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 87 transitions. [2022-02-20 14:40:11,221 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 87 transitions. [2022-02-20 14:40:11,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:12,302 INFO L225 Difference]: With dead ends: 5641 [2022-02-20 14:40:12,302 INFO L226 Difference]: Without dead ends: 5639 [2022-02-20 14:40:12,303 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:12,305 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 22 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 101 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:12,305 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 101 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:12,310 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5639 states. [2022-02-20 14:40:12,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5639 to 5125. [2022-02-20 14:40:12,371 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:12,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5639 states. Second operand has 5125 states, 5124 states have (on average 1.2620999219359874) internal successors, (6467), 5124 states have internal predecessors, (6467), 0 states have call successors, (0), 0 states have call 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:12,379 INFO L74 IsIncluded]: Start isIncluded. First operand 5639 states. Second operand has 5125 states, 5124 states have (on average 1.2620999219359874) internal successors, (6467), 5124 states have internal predecessors, (6467), 0 states have call successors, (0), 0 states have call 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:12,383 INFO L87 Difference]: Start difference. First operand 5639 states. Second operand has 5125 states, 5124 states have (on average 1.2620999219359874) internal successors, (6467), 5124 states have internal predecessors, (6467), 0 states have call successors, (0), 0 states have call 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,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:13,203 INFO L93 Difference]: Finished difference Result 5639 states and 7236 transitions. [2022-02-20 14:40:13,203 INFO L276 IsEmpty]: Start isEmpty. Operand 5639 states and 7236 transitions. [2022-02-20 14:40:13,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:13,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:13,211 INFO L74 IsIncluded]: Start isIncluded. First operand has 5125 states, 5124 states have (on average 1.2620999219359874) internal successors, (6467), 5124 states have internal predecessors, (6467), 0 states have call successors, (0), 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 5639 states. [2022-02-20 14:40:13,213 INFO L87 Difference]: Start difference. First operand has 5125 states, 5124 states have (on average 1.2620999219359874) internal successors, (6467), 5124 states have internal predecessors, (6467), 0 states have call successors, (0), 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 5639 states. [2022-02-20 14:40:14,104 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:14,105 INFO L93 Difference]: Finished difference Result 5639 states and 7236 transitions. [2022-02-20 14:40:14,105 INFO L276 IsEmpty]: Start isEmpty. Operand 5639 states and 7236 transitions. [2022-02-20 14:40:14,110 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:14,110 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:14,110 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:14,110 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:14,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5125 states, 5124 states have (on average 1.2620999219359874) internal successors, (6467), 5124 states have internal predecessors, (6467), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:14,888 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5125 states to 5125 states and 6467 transitions. [2022-02-20 14:40:14,888 INFO L78 Accepts]: Start accepts. Automaton has 5125 states and 6467 transitions. Word has length 23 [2022-02-20 14:40:14,888 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:14,888 INFO L470 AbstractCegarLoop]: Abstraction has 5125 states and 6467 transitions. [2022-02-20 14:40:14,888 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:40:14,888 INFO L276 IsEmpty]: Start isEmpty. Operand 5125 states and 6467 transitions. [2022-02-20 14:40:14,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 14:40:14,891 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:14,891 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:40:14,892 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-20 14:40:14,892 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:14,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:14,892 INFO L85 PathProgramCache]: Analyzing trace with hash -777858146, now seen corresponding path program 1 times [2022-02-20 14:40:14,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:14,893 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031927092] [2022-02-20 14:40:14,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:14,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:14,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:14,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {109870#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(15, 2);call #Ultimate.allocInit(12, 3); {109870#true} is VALID [2022-02-20 14:40:14,919 INFO L290 TraceCheckUtils]: 1: Hoare triple {109870#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_~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_~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;havoc main_~cond~0#1; {109870#true} is VALID [2022-02-20 14:40:14,919 INFO L290 TraceCheckUtils]: 2: Hoare triple {109870#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {109870#true} is VALID [2022-02-20 14:40:14,919 INFO L290 TraceCheckUtils]: 3: Hoare triple {109870#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; {109870#true} is VALID [2022-02-20 14:40:14,919 INFO L290 TraceCheckUtils]: 4: Hoare triple {109870#true} assume !(0 != main_~p1~0#1); {109870#true} is VALID [2022-02-20 14:40:14,919 INFO L290 TraceCheckUtils]: 5: Hoare triple {109870#true} assume !(0 != main_~p2~0#1); {109870#true} is VALID [2022-02-20 14:40:14,919 INFO L290 TraceCheckUtils]: 6: Hoare triple {109870#true} assume !(0 != main_~p3~0#1); {109870#true} is VALID [2022-02-20 14:40:14,920 INFO L290 TraceCheckUtils]: 7: Hoare triple {109870#true} assume !(0 != main_~p4~0#1); {109870#true} is VALID [2022-02-20 14:40:14,920 INFO L290 TraceCheckUtils]: 8: Hoare triple {109870#true} assume !(0 != main_~p5~0#1); {109870#true} is VALID [2022-02-20 14:40:14,920 INFO L290 TraceCheckUtils]: 9: Hoare triple {109870#true} assume !(0 != main_~p6~0#1); {109870#true} is VALID [2022-02-20 14:40:14,920 INFO L290 TraceCheckUtils]: 10: Hoare triple {109870#true} assume !(0 != main_~p7~0#1); {109870#true} is VALID [2022-02-20 14:40:14,921 INFO L290 TraceCheckUtils]: 11: Hoare triple {109870#true} assume !(0 != main_~p8~0#1); {109872#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:14,921 INFO L290 TraceCheckUtils]: 12: Hoare triple {109872#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {109872#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:14,921 INFO L290 TraceCheckUtils]: 13: Hoare triple {109872#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p1~0#1); {109872#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:14,921 INFO L290 TraceCheckUtils]: 14: Hoare triple {109872#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p2~0#1); {109872#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:14,922 INFO L290 TraceCheckUtils]: 15: Hoare triple {109872#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p3~0#1); {109872#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:14,922 INFO L290 TraceCheckUtils]: 16: Hoare triple {109872#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p4~0#1); {109872#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:14,922 INFO L290 TraceCheckUtils]: 17: Hoare triple {109872#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p5~0#1); {109872#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:14,922 INFO L290 TraceCheckUtils]: 18: Hoare triple {109872#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p6~0#1); {109872#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:14,923 INFO L290 TraceCheckUtils]: 19: Hoare triple {109872#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p7~0#1); {109872#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-20 14:40:14,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {109872#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p8~0#1; {109871#false} is VALID [2022-02-20 14:40:14,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {109871#false} assume 1 != main_~lk8~0#1; {109871#false} is VALID [2022-02-20 14:40:14,923 INFO L290 TraceCheckUtils]: 22: Hoare triple {109871#false} assume !false; {109871#false} is VALID [2022-02-20 14:40:14,923 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:40:14,924 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:14,924 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031927092] [2022-02-20 14:40:14,924 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031927092] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:14,924 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:14,924 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:14,924 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140103807] [2022-02-20 14:40:14,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:14,925 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:40:14,925 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:14,925 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:40:14,936 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:40:14,937 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:14,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:14,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:14,938 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:14,938 INFO L87 Difference]: Start difference. First operand 5125 states and 6467 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:40:18,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:18,719 INFO L93 Difference]: Finished difference Result 11529 states and 14405 transitions. [2022-02-20 14:40:18,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:18,719 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:40:18,719 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:18,719 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:40:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2022-02-20 14:40:18,720 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:40:18,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2022-02-20 14:40:18,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 149 transitions. [2022-02-20 14:40:18,824 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 149 edges. 149 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:20,371 INFO L225 Difference]: With dead ends: 11529 [2022-02-20 14:40:20,371 INFO L226 Difference]: Without dead ends: 6535 [2022-02-20 14:40:20,375 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:20,376 INFO L933 BasicCegarLoop]: 90 mSDtfsCounter, 36 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 136 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:40:20,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 136 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:40:20,379 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6535 states. [2022-02-20 14:40:20,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6535 to 6533. [2022-02-20 14:40:20,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:20,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6535 states. Second operand has 6533 states, 6532 states have (on average 1.2154011022657685) internal successors, (7939), 6532 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call 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:20,465 INFO L74 IsIncluded]: Start isIncluded. First operand 6535 states. Second operand has 6533 states, 6532 states have (on average 1.2154011022657685) internal successors, (7939), 6532 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call 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:20,470 INFO L87 Difference]: Start difference. First operand 6535 states. Second operand has 6533 states, 6532 states have (on average 1.2154011022657685) internal successors, (7939), 6532 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call 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:21,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:21,819 INFO L93 Difference]: Finished difference Result 6535 states and 7940 transitions. [2022-02-20 14:40:21,819 INFO L276 IsEmpty]: Start isEmpty. Operand 6535 states and 7940 transitions. [2022-02-20 14:40:21,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:21,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:21,832 INFO L74 IsIncluded]: Start isIncluded. First operand has 6533 states, 6532 states have (on average 1.2154011022657685) internal successors, (7939), 6532 states have internal predecessors, (7939), 0 states have call successors, (0), 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 6535 states. [2022-02-20 14:40:21,837 INFO L87 Difference]: Start difference. First operand has 6533 states, 6532 states have (on average 1.2154011022657685) internal successors, (7939), 6532 states have internal predecessors, (7939), 0 states have call successors, (0), 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 6535 states. [2022-02-20 14:40:23,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:23,135 INFO L93 Difference]: Finished difference Result 6535 states and 7940 transitions. [2022-02-20 14:40:23,135 INFO L276 IsEmpty]: Start isEmpty. Operand 6535 states and 7940 transitions. [2022-02-20 14:40:23,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:23,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:23,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:23,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:23,146 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6533 states, 6532 states have (on average 1.2154011022657685) internal successors, (7939), 6532 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call 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,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6533 states to 6533 states and 7939 transitions. [2022-02-20 14:40:24,526 INFO L78 Accepts]: Start accepts. Automaton has 6533 states and 7939 transitions. Word has length 23 [2022-02-20 14:40:24,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:24,526 INFO L470 AbstractCegarLoop]: Abstraction has 6533 states and 7939 transitions. [2022-02-20 14:40:24,527 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:40:24,527 INFO L276 IsEmpty]: Start isEmpty. Operand 6533 states and 7939 transitions. [2022-02-20 14:40:24,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 14:40:24,530 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:24,530 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:40:24,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-20 14:40:24,530 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:24,530 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:24,530 INFO L85 PathProgramCache]: Analyzing trace with hash -2051743973, now seen corresponding path program 1 times [2022-02-20 14:40:24,530 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:24,531 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1724880132] [2022-02-20 14:40:24,531 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:24,531 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:24,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:24,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {141653#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(15, 2);call #Ultimate.allocInit(12, 3); {141653#true} is VALID [2022-02-20 14:40:24,577 INFO L290 TraceCheckUtils]: 1: Hoare triple {141653#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_~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_~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;havoc main_~cond~0#1; {141653#true} is VALID [2022-02-20 14:40:24,577 INFO L290 TraceCheckUtils]: 2: Hoare triple {141653#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {141653#true} is VALID [2022-02-20 14:40:24,577 INFO L290 TraceCheckUtils]: 3: Hoare triple {141653#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; {141653#true} is VALID [2022-02-20 14:40:24,578 INFO L290 TraceCheckUtils]: 4: Hoare triple {141653#true} assume !(0 != main_~p1~0#1); {141653#true} is VALID [2022-02-20 14:40:24,578 INFO L290 TraceCheckUtils]: 5: Hoare triple {141653#true} assume !(0 != main_~p2~0#1); {141653#true} is VALID [2022-02-20 14:40:24,578 INFO L290 TraceCheckUtils]: 6: Hoare triple {141653#true} assume !(0 != main_~p3~0#1); {141653#true} is VALID [2022-02-20 14:40:24,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {141653#true} assume !(0 != main_~p4~0#1); {141653#true} is VALID [2022-02-20 14:40:24,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {141653#true} assume !(0 != main_~p5~0#1); {141653#true} is VALID [2022-02-20 14:40:24,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {141653#true} assume !(0 != main_~p6~0#1); {141653#true} is VALID [2022-02-20 14:40:24,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {141653#true} assume !(0 != main_~p7~0#1); {141653#true} is VALID [2022-02-20 14:40:24,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {141653#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {141655#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:24,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {141655#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {141655#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:24,579 INFO L290 TraceCheckUtils]: 13: Hoare triple {141655#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p1~0#1); {141655#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:24,579 INFO L290 TraceCheckUtils]: 14: Hoare triple {141655#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p2~0#1); {141655#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:24,580 INFO L290 TraceCheckUtils]: 15: Hoare triple {141655#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p3~0#1); {141655#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:24,580 INFO L290 TraceCheckUtils]: 16: Hoare triple {141655#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p4~0#1); {141655#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:24,580 INFO L290 TraceCheckUtils]: 17: Hoare triple {141655#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p5~0#1); {141655#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:24,580 INFO L290 TraceCheckUtils]: 18: Hoare triple {141655#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p6~0#1); {141655#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:24,581 INFO L290 TraceCheckUtils]: 19: Hoare triple {141655#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p7~0#1); {141655#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-20 14:40:24,581 INFO L290 TraceCheckUtils]: 20: Hoare triple {141655#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p8~0#1); {141654#false} is VALID [2022-02-20 14:40:24,581 INFO L290 TraceCheckUtils]: 21: Hoare triple {141654#false} assume 0 != main_~p9~0#1; {141654#false} is VALID [2022-02-20 14:40:24,581 INFO L290 TraceCheckUtils]: 22: Hoare triple {141654#false} assume 1 != main_~lk9~0#1; {141654#false} is VALID [2022-02-20 14:40:24,581 INFO L290 TraceCheckUtils]: 23: Hoare triple {141654#false} assume !false; {141654#false} is VALID [2022-02-20 14:40:24,582 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:24,582 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:24,582 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1724880132] [2022-02-20 14:40:24,582 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1724880132] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:24,582 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:24,582 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:24,582 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [907099064] [2022-02-20 14:40:24,583 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:24,583 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:40:24,583 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:24,583 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:40:24,595 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:40:24,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:24,595 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:24,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:24,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:24,596 INFO L87 Difference]: Start difference. First operand 6533 states and 7939 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:40:27,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:27,367 INFO L93 Difference]: Finished difference Result 9801 states and 11845 transitions. [2022-02-20 14:40:27,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:27,367 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:40:27,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:27,367 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:40:27,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2022-02-20 14:40:27,368 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:40:27,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2022-02-20 14:40:27,368 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 144 transitions. [2022-02-20 14:40:27,447 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:29,044 INFO L225 Difference]: With dead ends: 9801 [2022-02-20 14:40:29,044 INFO L226 Difference]: Without dead ends: 6663 [2022-02-20 14:40:29,047 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:29,047 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 38 mSDsluCounter, 45 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 116 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:29,047 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 116 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:29,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6663 states. [2022-02-20 14:40:29,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6663 to 6661. [2022-02-20 14:40:29,132 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:29,140 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6663 states. Second operand has 6661 states, 6660 states have (on average 1.1920420420420421) internal successors, (7939), 6660 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call 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:29,147 INFO L74 IsIncluded]: Start isIncluded. First operand 6663 states. Second operand has 6661 states, 6660 states have (on average 1.1920420420420421) internal successors, (7939), 6660 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call 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:29,154 INFO L87 Difference]: Start difference. First operand 6663 states. Second operand has 6661 states, 6660 states have (on average 1.1920420420420421) internal successors, (7939), 6660 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call 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:30,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:30,575 INFO L93 Difference]: Finished difference Result 6663 states and 7940 transitions. [2022-02-20 14:40:30,575 INFO L276 IsEmpty]: Start isEmpty. Operand 6663 states and 7940 transitions. [2022-02-20 14:40:30,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:30,580 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:30,585 INFO L74 IsIncluded]: Start isIncluded. First operand has 6661 states, 6660 states have (on average 1.1920420420420421) internal successors, (7939), 6660 states have internal predecessors, (7939), 0 states have call successors, (0), 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 6663 states. [2022-02-20 14:40:30,590 INFO L87 Difference]: Start difference. First operand has 6661 states, 6660 states have (on average 1.1920420420420421) internal successors, (7939), 6660 states have internal predecessors, (7939), 0 states have call successors, (0), 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 6663 states. [2022-02-20 14:40:31,970 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:31,970 INFO L93 Difference]: Finished difference Result 6663 states and 7940 transitions. [2022-02-20 14:40:31,970 INFO L276 IsEmpty]: Start isEmpty. Operand 6663 states and 7940 transitions. [2022-02-20 14:40:31,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:31,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:31,975 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:31,975 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:31,980 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6661 states, 6660 states have (on average 1.1920420420420421) internal successors, (7939), 6660 states have internal predecessors, (7939), 0 states have call successors, (0), 0 states have call 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:33,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6661 states to 6661 states and 7939 transitions. [2022-02-20 14:40:33,376 INFO L78 Accepts]: Start accepts. Automaton has 6661 states and 7939 transitions. Word has length 24 [2022-02-20 14:40:33,376 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:33,376 INFO L470 AbstractCegarLoop]: Abstraction has 6661 states and 7939 transitions. [2022-02-20 14:40:33,376 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:40:33,377 INFO L276 IsEmpty]: Start isEmpty. Operand 6661 states and 7939 transitions. [2022-02-20 14:40:33,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 14:40:33,379 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:33,379 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:40:33,379 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-20 14:40:33,380 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:33,380 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:33,380 INFO L85 PathProgramCache]: Analyzing trace with hash 1656417309, now seen corresponding path program 1 times [2022-02-20 14:40:33,380 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:33,380 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1693240513] [2022-02-20 14:40:33,380 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:33,380 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:33,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:33,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {172092#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(15, 2);call #Ultimate.allocInit(12, 3); {172092#true} is VALID [2022-02-20 14:40:33,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {172092#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_~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_~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;havoc main_~cond~0#1; {172092#true} is VALID [2022-02-20 14:40:33,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {172092#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {172092#true} is VALID [2022-02-20 14:40:33,399 INFO L290 TraceCheckUtils]: 3: Hoare triple {172092#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; {172092#true} is VALID [2022-02-20 14:40:33,399 INFO L290 TraceCheckUtils]: 4: Hoare triple {172092#true} assume !(0 != main_~p1~0#1); {172092#true} is VALID [2022-02-20 14:40:33,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {172092#true} assume !(0 != main_~p2~0#1); {172092#true} is VALID [2022-02-20 14:40:33,399 INFO L290 TraceCheckUtils]: 6: Hoare triple {172092#true} assume !(0 != main_~p3~0#1); {172092#true} is VALID [2022-02-20 14:40:33,399 INFO L290 TraceCheckUtils]: 7: Hoare triple {172092#true} assume !(0 != main_~p4~0#1); {172092#true} is VALID [2022-02-20 14:40:33,399 INFO L290 TraceCheckUtils]: 8: Hoare triple {172092#true} assume !(0 != main_~p5~0#1); {172092#true} is VALID [2022-02-20 14:40:33,399 INFO L290 TraceCheckUtils]: 9: Hoare triple {172092#true} assume !(0 != main_~p6~0#1); {172092#true} is VALID [2022-02-20 14:40:33,399 INFO L290 TraceCheckUtils]: 10: Hoare triple {172092#true} assume !(0 != main_~p7~0#1); {172092#true} is VALID [2022-02-20 14:40:33,400 INFO L290 TraceCheckUtils]: 11: Hoare triple {172092#true} assume !(0 != main_~p8~0#1); {172092#true} is VALID [2022-02-20 14:40:33,400 INFO L290 TraceCheckUtils]: 12: Hoare triple {172092#true} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {172094#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:33,400 INFO L290 TraceCheckUtils]: 13: Hoare triple {172094#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p1~0#1); {172094#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:33,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {172094#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p2~0#1); {172094#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:33,401 INFO L290 TraceCheckUtils]: 15: Hoare triple {172094#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p3~0#1); {172094#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:33,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {172094#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p4~0#1); {172094#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:33,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {172094#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p5~0#1); {172094#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:33,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {172094#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p6~0#1); {172094#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:33,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {172094#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p7~0#1); {172094#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:33,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {172094#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p8~0#1); {172094#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:33,402 INFO L290 TraceCheckUtils]: 21: Hoare triple {172094#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 0 != main_~p9~0#1; {172094#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-20 14:40:33,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {172094#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 1 != main_~lk9~0#1; {172093#false} is VALID [2022-02-20 14:40:33,403 INFO L290 TraceCheckUtils]: 23: Hoare triple {172093#false} assume !false; {172093#false} is VALID [2022-02-20 14:40:33,403 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:33,403 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:33,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1693240513] [2022-02-20 14:40:33,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1693240513] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:33,403 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:33,403 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:33,404 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211020865] [2022-02-20 14:40:33,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:33,405 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:40:33,405 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:33,405 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:40:33,417 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:40:33,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:33,419 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:33,420 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:33,420 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:33,420 INFO L87 Difference]: Start difference. First operand 6661 states and 7939 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:40:36,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:36,783 INFO L93 Difference]: Finished difference Result 10759 states and 12676 transitions. [2022-02-20 14:40:36,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:40:36,783 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:40:36,784 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:40:36,784 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:40:36,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-02-20 14:40:36,784 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:40:36,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-02-20 14:40:36,785 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2022-02-20 14:40:36,829 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:40:40,083 INFO L225 Difference]: With dead ends: 10759 [2022-02-20 14:40:40,084 INFO L226 Difference]: Without dead ends: 10757 [2022-02-20 14:40:40,085 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:40,085 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 18 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 98 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:40,086 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [18 Valid, 98 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:40,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10757 states. [2022-02-20 14:40:40,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10757 to 10245. [2022-02-20 14:40:40,195 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:40:40,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 10757 states. Second operand has 10245 states, 10244 states have (on average 1.1623389301054277) internal successors, (11907), 10244 states have internal predecessors, (11907), 0 states have call successors, (0), 0 states have call 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:40,217 INFO L74 IsIncluded]: Start isIncluded. First operand 10757 states. Second operand has 10245 states, 10244 states have (on average 1.1623389301054277) internal successors, (11907), 10244 states have internal predecessors, (11907), 0 states have call successors, (0), 0 states have call 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:40,261 INFO L87 Difference]: Start difference. First operand 10757 states. Second operand has 10245 states, 10244 states have (on average 1.1623389301054277) internal successors, (11907), 10244 states have internal predecessors, (11907), 0 states have call successors, (0), 0 states have call 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:43,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:43,553 INFO L93 Difference]: Finished difference Result 10757 states and 12419 transitions. [2022-02-20 14:40:43,553 INFO L276 IsEmpty]: Start isEmpty. Operand 10757 states and 12419 transitions. [2022-02-20 14:40:43,561 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:43,561 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:43,568 INFO L74 IsIncluded]: Start isIncluded. First operand has 10245 states, 10244 states have (on average 1.1623389301054277) internal successors, (11907), 10244 states have internal predecessors, (11907), 0 states have call successors, (0), 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 10757 states. [2022-02-20 14:40:43,575 INFO L87 Difference]: Start difference. First operand has 10245 states, 10244 states have (on average 1.1623389301054277) internal successors, (11907), 10244 states have internal predecessors, (11907), 0 states have call successors, (0), 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 10757 states. [2022-02-20 14:40:46,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:40:46,689 INFO L93 Difference]: Finished difference Result 10757 states and 12419 transitions. [2022-02-20 14:40:46,689 INFO L276 IsEmpty]: Start isEmpty. Operand 10757 states and 12419 transitions. [2022-02-20 14:40:46,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:40:46,697 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:40:46,697 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:40:46,697 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:40:46,703 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10245 states, 10244 states have (on average 1.1623389301054277) internal successors, (11907), 10244 states have internal predecessors, (11907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:40:49,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10245 states to 10245 states and 11907 transitions. [2022-02-20 14:40:49,405 INFO L78 Accepts]: Start accepts. Automaton has 10245 states and 11907 transitions. Word has length 24 [2022-02-20 14:40:49,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:40:49,406 INFO L470 AbstractCegarLoop]: Abstraction has 10245 states and 11907 transitions. [2022-02-20 14:40:49,406 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:40:49,406 INFO L276 IsEmpty]: Start isEmpty. Operand 10245 states and 11907 transitions. [2022-02-20 14:40:49,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 14:40:49,412 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:40:49,412 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:40:49,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-20 14:40:49,413 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:40:49,413 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:40:49,413 INFO L85 PathProgramCache]: Analyzing trace with hash 1914582747, now seen corresponding path program 1 times [2022-02-20 14:40:49,413 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:40:49,413 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794945123] [2022-02-20 14:40:49,414 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:40:49,414 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:40:49,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:40:49,444 INFO L290 TraceCheckUtils]: 0: Hoare triple {215388#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(15, 2);call #Ultimate.allocInit(12, 3); {215388#true} is VALID [2022-02-20 14:40:49,444 INFO L290 TraceCheckUtils]: 1: Hoare triple {215388#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_~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_~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;havoc main_~cond~0#1; {215388#true} is VALID [2022-02-20 14:40:49,444 INFO L290 TraceCheckUtils]: 2: Hoare triple {215388#true} assume !false;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1; {215388#true} is VALID [2022-02-20 14:40:49,444 INFO L290 TraceCheckUtils]: 3: Hoare triple {215388#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; {215388#true} is VALID [2022-02-20 14:40:49,444 INFO L290 TraceCheckUtils]: 4: Hoare triple {215388#true} assume !(0 != main_~p1~0#1); {215388#true} is VALID [2022-02-20 14:40:49,444 INFO L290 TraceCheckUtils]: 5: Hoare triple {215388#true} assume !(0 != main_~p2~0#1); {215388#true} is VALID [2022-02-20 14:40:49,444 INFO L290 TraceCheckUtils]: 6: Hoare triple {215388#true} assume !(0 != main_~p3~0#1); {215388#true} is VALID [2022-02-20 14:40:49,444 INFO L290 TraceCheckUtils]: 7: Hoare triple {215388#true} assume !(0 != main_~p4~0#1); {215388#true} is VALID [2022-02-20 14:40:49,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {215388#true} assume !(0 != main_~p5~0#1); {215388#true} is VALID [2022-02-20 14:40:49,444 INFO L290 TraceCheckUtils]: 9: Hoare triple {215388#true} assume !(0 != main_~p6~0#1); {215388#true} is VALID [2022-02-20 14:40:49,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {215388#true} assume !(0 != main_~p7~0#1); {215388#true} is VALID [2022-02-20 14:40:49,445 INFO L290 TraceCheckUtils]: 11: Hoare triple {215388#true} assume !(0 != main_~p8~0#1); {215388#true} is VALID [2022-02-20 14:40:49,445 INFO L290 TraceCheckUtils]: 12: Hoare triple {215388#true} assume !(0 != main_~p9~0#1); {215390#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-20 14:40:49,445 INFO L290 TraceCheckUtils]: 13: Hoare triple {215390#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume !(0 != main_~p1~0#1); {215390#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-20 14:40:49,446 INFO L290 TraceCheckUtils]: 14: Hoare triple {215390#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume !(0 != main_~p2~0#1); {215390#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-20 14:40:49,446 INFO L290 TraceCheckUtils]: 15: Hoare triple {215390#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume !(0 != main_~p3~0#1); {215390#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-20 14:40:49,446 INFO L290 TraceCheckUtils]: 16: Hoare triple {215390#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume !(0 != main_~p4~0#1); {215390#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-20 14:40:49,447 INFO L290 TraceCheckUtils]: 17: Hoare triple {215390#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume !(0 != main_~p5~0#1); {215390#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-20 14:40:49,447 INFO L290 TraceCheckUtils]: 18: Hoare triple {215390#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume !(0 != main_~p6~0#1); {215390#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-20 14:40:49,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {215390#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume !(0 != main_~p7~0#1); {215390#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-20 14:40:49,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {215390#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume !(0 != main_~p8~0#1); {215390#(= |ULTIMATE.start_main_~p9~0#1| 0)} is VALID [2022-02-20 14:40:49,448 INFO L290 TraceCheckUtils]: 21: Hoare triple {215390#(= |ULTIMATE.start_main_~p9~0#1| 0)} assume 0 != main_~p9~0#1; {215389#false} is VALID [2022-02-20 14:40:49,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {215389#false} assume 1 != main_~lk9~0#1; {215389#false} is VALID [2022-02-20 14:40:49,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {215389#false} assume !false; {215389#false} is VALID [2022-02-20 14:40:49,448 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:49,448 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:40:49,448 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794945123] [2022-02-20 14:40:49,449 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794945123] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:40:49,449 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:40:49,449 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:40:49,449 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656083682] [2022-02-20 14:40:49,449 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:40:49,449 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:40:49,450 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:40:49,450 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:40:49,464 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:40:49,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:40:49,464 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:40:49,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:40:49,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:40:49,465 INFO L87 Difference]: Start difference. First operand 10245 states and 11907 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:41:04,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:41:04,210 INFO L93 Difference]: Finished difference Result 22789 states and 25987 transitions. [2022-02-20 14:41:04,210 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:41:04,210 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:41:04,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:41:04,211 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:41:04,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2022-02-20 14:41:04,211 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:41:04,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2022-02-20 14:41:04,212 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 144 transitions. [2022-02-20 14:41:04,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:41:04,288 INFO L225 Difference]: With dead ends: 22789 [2022-02-20 14:41:04,288 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 14:41:04,297 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:41:04,298 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 34 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 135 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:41:04,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [34 Valid, 135 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:41:04,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 14:41:04,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 14:41:04,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:41:04,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:41:04,300 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:41:04,300 INFO L87 Difference]: Start difference. First operand 0 states. Second operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:41:04,300 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:41:04,300 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 14:41:04,300 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 14:41:04,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:41:04,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:41:04,300 INFO L74 IsIncluded]: Start isIncluded. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 14:41:04,300 INFO L87 Difference]: Start difference. First operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 0 states. [2022-02-20 14:41:04,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:41:04,301 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 14:41:04,301 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 14:41:04,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:41:04,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:41:04,301 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:41:04,301 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:41:04,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 0 states, 0 states have (on average 0.0) internal successors, (0), 0 states have internal predecessors, (0), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:41:04,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 14:41:04,302 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 24 [2022-02-20 14:41:04,302 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:41:04,302 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 14:41:04,302 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:41:04,302 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 14:41:04,302 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:41:04,304 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 14:41:04,304 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-20 14:41:04,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 14:41:04,314 INFO L858 garLoopResultBuilder]: For program point L126-1(lines 38 146) no Hoare annotation was computed. [2022-02-20 14:41:04,314 INFO L858 garLoopResultBuilder]: For program point L102(line 102) no Hoare annotation was computed. [2022-02-20 14:41:04,314 INFO L858 garLoopResultBuilder]: For program point L127(line 127) no Hoare annotation was computed. [2022-02-20 14:41:04,314 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 14:41:04,314 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 14:41:04,314 INFO L858 garLoopResultBuilder]: For program point L111-1(lines 38 146) no Hoare annotation was computed. [2022-02-20 14:41:04,315 INFO L858 garLoopResultBuilder]: For program point L136-1(lines 38 146) no Hoare annotation was computed. [2022-02-20 14:41:04,315 INFO L858 garLoopResultBuilder]: For program point L95-1(lines 38 146) no Hoare annotation was computed. [2022-02-20 14:41:04,315 INFO L858 garLoopResultBuilder]: For program point L87-1(lines 38 146) no Hoare annotation was computed. [2022-02-20 14:41:04,315 INFO L858 garLoopResultBuilder]: For program point L112(line 112) no Hoare annotation was computed. [2022-02-20 14:41:04,315 INFO L858 garLoopResultBuilder]: For program point L79-1(lines 38 146) no Hoare annotation was computed. [2022-02-20 14:41:04,315 INFO L858 garLoopResultBuilder]: For program point L137(line 137) no Hoare annotation was computed. [2022-02-20 14:41:04,315 INFO L858 garLoopResultBuilder]: For program point L71-1(lines 38 146) no Hoare annotation was computed. [2022-02-20 14:41:04,315 INFO L858 garLoopResultBuilder]: For program point L63(lines 63 65) no Hoare annotation was computed. [2022-02-20 14:41:04,316 INFO L858 garLoopResultBuilder]: For program point L63-2(lines 38 146) no Hoare annotation was computed. [2022-02-20 14:41:04,316 INFO L858 garLoopResultBuilder]: For program point L121-1(lines 38 146) no Hoare annotation was computed. [2022-02-20 14:41:04,316 INFO L858 garLoopResultBuilder]: For program point L122(line 122) no Hoare annotation was computed. [2022-02-20 14:41:04,316 INFO L861 garLoopResultBuilder]: At program point L147(lines 7 151) the Hoare annotation is: true [2022-02-20 14:41:04,316 INFO L858 garLoopResultBuilder]: For program point L106-1(lines 38 146) no Hoare annotation was computed. [2022-02-20 14:41:04,316 INFO L858 garLoopResultBuilder]: For program point L40(lines 40 42) no Hoare annotation was computed. [2022-02-20 14:41:04,316 INFO L858 garLoopResultBuilder]: For program point L131-1(lines 38 146) no Hoare annotation was computed. [2022-02-20 14:41:04,316 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 14:41:04,317 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 149) no Hoare annotation was computed. [2022-02-20 14:41:04,317 INFO L858 garLoopResultBuilder]: For program point L107(line 107) no Hoare annotation was computed. [2022-02-20 14:41:04,317 INFO L858 garLoopResultBuilder]: For program point L132(line 132) no Hoare annotation was computed. [2022-02-20 14:41:04,317 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 14:41:04,317 INFO L858 garLoopResultBuilder]: For program point L91-1(lines 38 146) no Hoare annotation was computed. [2022-02-20 14:41:04,317 INFO L858 garLoopResultBuilder]: For program point L116-1(lines 38 146) no Hoare annotation was computed. [2022-02-20 14:41:04,317 INFO L858 garLoopResultBuilder]: For program point L83-1(lines 38 146) no Hoare annotation was computed. [2022-02-20 14:41:04,317 INFO L861 garLoopResultBuilder]: At program point L141-1(lines 38 146) the Hoare annotation is: true [2022-02-20 14:41:04,317 INFO L858 garLoopResultBuilder]: For program point L75-1(lines 38 146) no Hoare annotation was computed. [2022-02-20 14:41:04,318 INFO L858 garLoopResultBuilder]: For program point L67-1(lines 38 146) no Hoare annotation was computed. [2022-02-20 14:41:04,318 INFO L861 garLoopResultBuilder]: At program point L150(lines 6 151) the Hoare annotation is: true [2022-02-20 14:41:04,318 INFO L858 garLoopResultBuilder]: For program point L117(line 117) no Hoare annotation was computed. [2022-02-20 14:41:04,318 INFO L858 garLoopResultBuilder]: For program point L142(line 142) no Hoare annotation was computed. [2022-02-20 14:41:04,318 INFO L854 garLoopResultBuilder]: At program point L142-1(lines 7 151) the Hoare annotation is: false [2022-02-20 14:41:04,318 INFO L858 garLoopResultBuilder]: For program point L101-1(lines 38 146) no Hoare annotation was computed. [2022-02-20 14:41:04,321 INFO L732 BasicCegarLoop]: Path program 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:41:04,322 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 14:41:04,324 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 14:41:04,324 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 14:41:04,324 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 14:41:04,324 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 14:41:04,324 WARN L170 areAnnotationChecker]: L40 has no Hoare annotation [2022-02-20 14:41:04,324 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 14:41:04,325 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-02-20 14:41:04,325 WARN L170 areAnnotationChecker]: L63 has no Hoare annotation [2022-02-20 14:41:04,325 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 14:41:04,325 WARN L170 areAnnotationChecker]: L63-2 has no Hoare annotation [2022-02-20 14:41:04,325 WARN L170 areAnnotationChecker]: L63-2 has no Hoare annotation [2022-02-20 14:41:04,325 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 14:41:04,325 WARN L170 areAnnotationChecker]: L67-1 has no Hoare annotation [2022-02-20 14:41:04,325 WARN L170 areAnnotationChecker]: L71-1 has no Hoare annotation [2022-02-20 14:41:04,325 WARN L170 areAnnotationChecker]: L71-1 has no Hoare annotation [2022-02-20 14:41:04,325 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-02-20 14:41:04,325 WARN L170 areAnnotationChecker]: L75-1 has no Hoare annotation [2022-02-20 14:41:04,325 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2022-02-20 14:41:04,326 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2022-02-20 14:41:04,326 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2022-02-20 14:41:04,326 WARN L170 areAnnotationChecker]: L83-1 has no Hoare annotation [2022-02-20 14:41:04,326 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2022-02-20 14:41:04,326 WARN L170 areAnnotationChecker]: L87-1 has no Hoare annotation [2022-02-20 14:41:04,326 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2022-02-20 14:41:04,326 WARN L170 areAnnotationChecker]: L91-1 has no Hoare annotation [2022-02-20 14:41:04,326 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2022-02-20 14:41:04,326 WARN L170 areAnnotationChecker]: L95-1 has no Hoare annotation [2022-02-20 14:41:04,326 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-02-20 14:41:04,326 WARN L170 areAnnotationChecker]: L102 has no Hoare annotation [2022-02-20 14:41:04,327 WARN L170 areAnnotationChecker]: L101-1 has no Hoare annotation [2022-02-20 14:41:04,327 WARN L170 areAnnotationChecker]: L101-1 has no Hoare annotation [2022-02-20 14:41:04,327 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-02-20 14:41:04,327 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2022-02-20 14:41:04,327 WARN L170 areAnnotationChecker]: L107 has no Hoare annotation [2022-02-20 14:41:04,327 WARN L170 areAnnotationChecker]: L106-1 has no Hoare annotation [2022-02-20 14:41:04,327 WARN L170 areAnnotationChecker]: L106-1 has no Hoare annotation [2022-02-20 14:41:04,327 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-02-20 14:41:04,327 WARN L170 areAnnotationChecker]: L112 has no Hoare annotation [2022-02-20 14:41:04,327 WARN L170 areAnnotationChecker]: L111-1 has no Hoare annotation [2022-02-20 14:41:04,327 WARN L170 areAnnotationChecker]: L111-1 has no Hoare annotation [2022-02-20 14:41:04,328 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-02-20 14:41:04,328 WARN L170 areAnnotationChecker]: L117 has no Hoare annotation [2022-02-20 14:41:04,328 WARN L170 areAnnotationChecker]: L116-1 has no Hoare annotation [2022-02-20 14:41:04,328 WARN L170 areAnnotationChecker]: L116-1 has no Hoare annotation [2022-02-20 14:41:04,328 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2022-02-20 14:41:04,328 WARN L170 areAnnotationChecker]: L122 has no Hoare annotation [2022-02-20 14:41:04,328 WARN L170 areAnnotationChecker]: L121-1 has no Hoare annotation [2022-02-20 14:41:04,328 WARN L170 areAnnotationChecker]: L121-1 has no Hoare annotation [2022-02-20 14:41:04,328 WARN L170 areAnnotationChecker]: L127 has no Hoare annotation [2022-02-20 14:41:04,328 WARN L170 areAnnotationChecker]: L127 has no Hoare annotation [2022-02-20 14:41:04,328 WARN L170 areAnnotationChecker]: L126-1 has no Hoare annotation [2022-02-20 14:41:04,328 WARN L170 areAnnotationChecker]: L126-1 has no Hoare annotation [2022-02-20 14:41:04,329 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-02-20 14:41:04,329 WARN L170 areAnnotationChecker]: L132 has no Hoare annotation [2022-02-20 14:41:04,329 WARN L170 areAnnotationChecker]: L131-1 has no Hoare annotation [2022-02-20 14:41:04,329 WARN L170 areAnnotationChecker]: L131-1 has no Hoare annotation [2022-02-20 14:41:04,329 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-02-20 14:41:04,329 WARN L170 areAnnotationChecker]: L137 has no Hoare annotation [2022-02-20 14:41:04,329 WARN L170 areAnnotationChecker]: L136-1 has no Hoare annotation [2022-02-20 14:41:04,329 WARN L170 areAnnotationChecker]: L136-1 has no Hoare annotation [2022-02-20 14:41:04,329 WARN L170 areAnnotationChecker]: L142 has no Hoare annotation [2022-02-20 14:41:04,329 WARN L170 areAnnotationChecker]: L142 has no Hoare annotation [2022-02-20 14:41:04,329 INFO L163 areAnnotationChecker]: CFG has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2022-02-20 14:41:04,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 02:41:04 BoogieIcfgContainer [2022-02-20 14:41:04,334 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 14:41:04,334 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 14:41:04,334 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 14:41:04,335 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 14:41:04,335 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:39:56" (3/4) ... [2022-02-20 14:41:04,337 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 14:41:04,344 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-02-20 14:41:04,344 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 14:41:04,344 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 14:41:04,344 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 14:41:04,369 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 14:41:04,369 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 14:41:04,370 INFO L158 Benchmark]: Toolchain (without parser) took 68141.61ms. Allocated memory was 98.6MB in the beginning and 270.5MB in the end (delta: 172.0MB). Free memory was 66.7MB in the beginning and 140.2MB in the end (delta: -73.4MB). Peak memory consumption was 97.6MB. Max. memory is 16.1GB. [2022-02-20 14:41:04,370 INFO L158 Benchmark]: CDTParser took 0.15ms. Allocated memory is still 98.6MB. Free memory was 53.3MB in the beginning and 53.2MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:41:04,370 INFO L158 Benchmark]: CACSL2BoogieTranslator took 207.74ms. Allocated memory is still 98.6MB. Free memory was 66.5MB in the beginning and 74.2MB in the end (delta: -7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 14:41:04,370 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.68ms. Allocated memory is still 98.6MB. Free memory was 74.2MB in the beginning and 72.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:41:04,371 INFO L158 Benchmark]: Boogie Preprocessor took 28.14ms. Allocated memory is still 98.6MB. Free memory was 72.0MB in the beginning and 70.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:41:04,371 INFO L158 Benchmark]: RCFGBuilder took 371.04ms. Allocated memory is still 98.6MB. Free memory was 70.9MB in the beginning and 55.4MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. [2022-02-20 14:41:04,371 INFO L158 Benchmark]: TraceAbstraction took 67444.47ms. Allocated memory was 98.6MB in the beginning and 270.5MB in the end (delta: 172.0MB). Free memory was 54.6MB in the beginning and 143.3MB in the end (delta: -88.7MB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. [2022-02-20 14:41:04,371 INFO L158 Benchmark]: Witness Printer took 34.79ms. Allocated memory is still 270.5MB. Free memory was 143.3MB in the beginning and 140.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:41:04,372 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15ms. Allocated memory is still 98.6MB. Free memory was 53.3MB in the beginning and 53.2MB in the end (delta: 43.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 207.74ms. Allocated memory is still 98.6MB. Free memory was 66.5MB in the beginning and 74.2MB in the end (delta: -7.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.68ms. Allocated memory is still 98.6MB. Free memory was 74.2MB in the beginning and 72.0MB in the end (delta: 2.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 28.14ms. Allocated memory is still 98.6MB. Free memory was 72.0MB in the beginning and 70.9MB in the end (delta: 1.2MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 371.04ms. Allocated memory is still 98.6MB. Free memory was 70.9MB in the beginning and 55.4MB in the end (delta: 15.5MB). Peak memory consumption was 16.8MB. Max. memory is 16.1GB. * TraceAbstraction took 67444.47ms. Allocated memory was 98.6MB in the beginning and 270.5MB in the end (delta: 172.0MB). Free memory was 54.6MB in the beginning and 143.3MB in the end (delta: -88.7MB). Peak memory consumption was 85.9MB. Max. memory is 16.1GB. * Witness Printer took 34.79ms. Allocated memory is still 270.5MB. Free memory was 143.3MB in the beginning and 140.2MB in the end (delta: 3.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - PositiveResult [Line: 149]: call to reach_error is unreachable For all program executions holds that call to reach_error is unreachable at this location - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 37 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 67.4s, OverallIterations: 25, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.1s, AutomataDifference: 40.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 922 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 922 mSDsluCounter, 3098 SdHoareTripleChecker+Invalid, 0.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 1232 mSDsCounter, 25 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 133 IncrementalHoareTripleChecker+Invalid, 158 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 25 mSolverCounterUnsat, 1866 mSDtfsCounter, 133 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 75 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=10245occurred in iteration=24, InterpolantAutomatonStates: 75, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 24.9s AutomataMinimizationTime, 25 MinimizatonAttempts, 2072 StatesRemovedByMinimization, 24 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 521 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 505 NumberOfCodeBlocks, 505 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 480 ConstructedInterpolants, 0 QuantifiedInterpolants, 1011 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 25 InterpolantComputations, 25 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 6]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 38]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 7]: Loop Invariant Derived loop invariant: 0 RESULT: Ultimate proved your program to be correct! [2022-02-20 14:41:04,404 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE