./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/locks/test_locks_6.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_6.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 c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:39:47,582 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:39:47,590 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:39:47,615 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:39:47,617 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:39:47,620 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:39:47,623 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:39:47,625 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:39:47,627 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:39:47,627 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:39:47,628 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:39:47,629 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:39:47,629 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:39:47,634 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:39:47,635 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:39:47,635 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:39:47,637 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:39:47,639 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:39:47,640 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:39:47,643 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:39:47,647 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:39:47,647 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:39:47,648 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:39:47,649 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:39:47,651 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:39:47,653 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:39:47,654 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:39:47,654 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:39:47,655 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:39:47,656 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:39:47,656 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:39:47,656 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:39:47,657 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:39:47,658 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:39:47,659 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:39:47,659 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:39:47,660 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:39:47,660 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:39:47,660 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:39:47,661 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:39:47,661 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:39:47,662 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:47,680 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:39:47,680 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:39:47,681 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:39:47,681 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:39:47,682 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:39:47,682 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:39:47,682 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:39:47,682 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:39:47,683 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:39:47,683 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:39:47,683 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:39:47,683 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:39:47,684 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:39:47,684 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:39:47,684 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:39:47,684 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:39:47,684 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:39:47,684 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:39:47,684 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:39:47,685 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:39:47,685 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:39:47,685 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:39:47,685 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:39:47,685 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:39:47,685 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:39:47,685 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:39:47,686 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:39:47,687 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:39:47,687 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:39:47,687 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:39:47,687 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:39:47,687 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:39:47,687 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:39:47,688 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 -> c0f4ea6e3bcbb2b79339dce82d9fa934022810e04d651b4bbb6fb3904b8f8c98 [2022-02-20 14:39:47,883 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:39:47,901 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:39:47,903 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:39:47,904 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:39:47,905 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:39:47,906 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_6.c [2022-02-20 14:39:47,965 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a55e14f4/d777c24dab3d43d9b199e2eda4e7dd0d/FLAG1229ec5aa [2022-02-20 14:39:48,284 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:39:48,284 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_6.c [2022-02-20 14:39:48,298 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a55e14f4/d777c24dab3d43d9b199e2eda4e7dd0d/FLAG1229ec5aa [2022-02-20 14:39:48,720 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6a55e14f4/d777c24dab3d43d9b199e2eda4e7dd0d [2022-02-20 14:39:48,722 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:39:48,735 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:39:48,739 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:39:48,739 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:39:48,741 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:39:48,742 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:39:48" (1/1) ... [2022-02-20 14:39:48,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2a23aefa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:48, skipping insertion in model container [2022-02-20 14:39:48,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:39:48" (1/1) ... [2022-02-20 14:39:48,750 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:39:48,763 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:39:48,907 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_6.c[2544,2557] [2022-02-20 14:39:48,910 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:39:48,916 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:39:48,928 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_6.c[2544,2557] [2022-02-20 14:39:48,929 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:39:48,937 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:39:48,938 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:48 WrapperNode [2022-02-20 14:39:48,938 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:39:48,939 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:39:48,939 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:39:48,939 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:39:48,944 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:48" (1/1) ... [2022-02-20 14:39:48,948 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:48" (1/1) ... [2022-02-20 14:39:48,961 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 94 [2022-02-20 14:39:48,962 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:39:48,962 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:39:48,963 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:39:48,963 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:39:48,967 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:48" (1/1) ... [2022-02-20 14:39:48,968 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:48" (1/1) ... [2022-02-20 14:39:48,974 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:48" (1/1) ... [2022-02-20 14:39:48,975 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:48" (1/1) ... [2022-02-20 14:39:48,986 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:48" (1/1) ... [2022-02-20 14:39:48,990 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:48" (1/1) ... [2022-02-20 14:39:48,993 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:48" (1/1) ... [2022-02-20 14:39:48,996 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:39:48,998 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:39:48,999 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:39:48,999 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:39:49,000 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:48" (1/1) ... [2022-02-20 14:39:49,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:39:49,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:39:49,041 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:49,070 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:49,085 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:39:49,085 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:39:49,085 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:39:49,085 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:39:49,128 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:39:49,129 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:39:49,332 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:39:49,336 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:39:49,336 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-20 14:39:49,337 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:39:49 BoogieIcfgContainer [2022-02-20 14:39:49,337 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:39:49,338 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:39:49,338 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:39:49,341 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:39:49,341 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:39:48" (1/3) ... [2022-02-20 14:39:49,341 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae14b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:39:49, skipping insertion in model container [2022-02-20 14:39:49,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:39:48" (2/3) ... [2022-02-20 14:39:49,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4ae14b90 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:39:49, skipping insertion in model container [2022-02-20 14:39:49,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:39:49" (3/3) ... [2022-02-20 14:39:49,343 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_6.c [2022-02-20 14:39:49,346 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:39:49,346 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:39:49,389 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:39:49,403 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:49,404 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:39:49,423 INFO L276 IsEmpty]: Start isEmpty. Operand has 28 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 27 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:49,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 14:39:49,427 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:49,427 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:49,428 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:49,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:49,432 INFO L85 PathProgramCache]: Analyzing trace with hash -721193823, now seen corresponding path program 1 times [2022-02-20 14:39:49,438 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:49,438 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1365053907] [2022-02-20 14:39:49,439 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:49,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:49,530 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:49,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {31#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); {31#true} is VALID [2022-02-20 14:39:49,608 INFO L290 TraceCheckUtils]: 1: Hoare triple {31#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_~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_~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;havoc main_~cond~0#1; {31#true} is VALID [2022-02-20 14:39:49,608 INFO L290 TraceCheckUtils]: 2: Hoare triple {31#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {31#true} is VALID [2022-02-20 14:39:49,609 INFO L290 TraceCheckUtils]: 3: Hoare triple {31#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; {31#true} is VALID [2022-02-20 14:39:49,609 INFO L290 TraceCheckUtils]: 4: Hoare triple {31#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {33#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:49,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {33#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {33#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:49,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume !(0 != main_~p3~0#1); {33#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:49,613 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {33#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:49,614 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {33#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:49,614 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {33#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:49,615 INFO L290 TraceCheckUtils]: 10: Hoare triple {33#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p1~0#1; {33#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-20 14:39:49,615 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 1 != main_~lk1~0#1; {32#false} is VALID [2022-02-20 14:39:49,616 INFO L290 TraceCheckUtils]: 12: Hoare triple {32#false} assume !false; {32#false} is VALID [2022-02-20 14:39:49,616 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:49,617 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:49,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1365053907] [2022-02-20 14:39:49,618 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1365053907] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:49,618 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:49,618 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:49,620 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1493761841] [2022-02-20 14:39:49,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:49,623 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-02-20 14:39:49,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:49,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:49,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:49,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:49,651 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:49,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:49,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:49,670 INFO L87 Difference]: Start difference. First operand has 28 states, 26 states have (on average 1.8461538461538463) internal successors, (48), 27 states have internal predecessors, (48), 0 states have call successors, (0), 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 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:49,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:49,767 INFO L93 Difference]: Finished difference Result 59 states and 97 transitions. [2022-02-20 14:39:49,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:49,767 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-02-20 14:39:49,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:49,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:49,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2022-02-20 14:39:49,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:49,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2022-02-20 14:39:49,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 97 transitions. [2022-02-20 14:39:49,904 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:49,911 INFO L225 Difference]: With dead ends: 59 [2022-02-20 14:39:49,911 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 14:39:49,913 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:49,915 INFO L933 BasicCegarLoop]: 51 mSDtfsCounter, 32 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 91 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:49,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 91 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:49,926 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 14:39:49,933 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 31. [2022-02-20 14:39:49,933 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:49,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:49,935 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:49,935 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:49,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:49,938 INFO L93 Difference]: Finished difference Result 45 states and 77 transitions. [2022-02-20 14:39:49,939 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 77 transitions. [2022-02-20 14:39:49,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:49,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:49,940 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 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 45 states. [2022-02-20 14:39:49,940 INFO L87 Difference]: Start difference. First operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 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 45 states. [2022-02-20 14:39:49,943 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:49,943 INFO L93 Difference]: Finished difference Result 45 states and 77 transitions. [2022-02-20 14:39:49,944 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 77 transitions. [2022-02-20 14:39:49,944 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:49,944 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:49,944 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:49,944 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:49,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.8) internal successors, (54), 30 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:49,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 54 transitions. [2022-02-20 14:39:49,947 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 54 transitions. Word has length 13 [2022-02-20 14:39:49,948 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:49,948 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 54 transitions. [2022-02-20 14:39:49,948 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:49,948 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 54 transitions. [2022-02-20 14:39:49,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 14:39:49,949 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:49,949 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:49,949 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:39:49,950 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:49,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:49,950 INFO L85 PathProgramCache]: Analyzing trace with hash -41135453, now seen corresponding path program 1 times [2022-02-20 14:39:49,950 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:49,951 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1333025880] [2022-02-20 14:39:49,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:49,951 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:49,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:49,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {229#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); {229#true} is VALID [2022-02-20 14:39:49,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {229#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_~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_~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;havoc main_~cond~0#1; {229#true} is VALID [2022-02-20 14:39:49,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {229#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {229#true} is VALID [2022-02-20 14:39:49,983 INFO L290 TraceCheckUtils]: 3: Hoare triple {229#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; {229#true} is VALID [2022-02-20 14:39:49,983 INFO L290 TraceCheckUtils]: 4: Hoare triple {229#true} assume !(0 != main_~p1~0#1); {231#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:49,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {231#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {231#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:49,984 INFO L290 TraceCheckUtils]: 6: Hoare triple {231#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume !(0 != main_~p3~0#1); {231#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:49,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {231#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {231#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:49,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {231#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {231#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:49,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {231#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {231#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-20 14:39:49,986 INFO L290 TraceCheckUtils]: 10: Hoare triple {231#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p1~0#1; {230#false} is VALID [2022-02-20 14:39:49,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {230#false} assume 1 != main_~lk1~0#1; {230#false} is VALID [2022-02-20 14:39:49,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {230#false} assume !false; {230#false} is VALID [2022-02-20 14:39:49,987 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:49,987 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:49,987 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1333025880] [2022-02-20 14:39:49,987 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1333025880] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:49,987 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:49,987 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:49,988 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821097849] [2022-02-20 14:39:49,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:49,989 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-02-20 14:39:49,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:49,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:50,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:50,000 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:50,000 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:50,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:50,001 INFO L87 Difference]: Start difference. First operand 31 states and 54 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:50,067 INFO L93 Difference]: Finished difference Result 74 states and 129 transitions. [2022-02-20 14:39:50,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:50,068 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-02-20 14:39:50,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:50,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2022-02-20 14:39:50,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2022-02-20 14:39:50,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 116 transitions. [2022-02-20 14:39:50,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:50,151 INFO L225 Difference]: With dead ends: 74 [2022-02-20 14:39:50,151 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 14:39:50,151 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:50,156 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 28 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 87 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:50,171 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 87 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:50,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 14:39:50,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 43. [2022-02-20 14:39:50,175 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:50,176 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 43 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 42 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,176 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 43 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 42 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,177 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 43 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 42 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:50,179 INFO L93 Difference]: Finished difference Result 45 states and 75 transitions. [2022-02-20 14:39:50,179 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 75 transitions. [2022-02-20 14:39:50,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:50,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:50,180 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 42 states have internal predecessors, (74), 0 states have call successors, (0), 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 45 states. [2022-02-20 14:39:50,180 INFO L87 Difference]: Start difference. First operand has 43 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 42 states have internal predecessors, (74), 0 states have call successors, (0), 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 45 states. [2022-02-20 14:39:50,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:50,183 INFO L93 Difference]: Finished difference Result 45 states and 75 transitions. [2022-02-20 14:39:50,183 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 75 transitions. [2022-02-20 14:39:50,184 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:50,184 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:50,184 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:50,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:50,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 42 states have (on average 1.7619047619047619) internal successors, (74), 42 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 74 transitions. [2022-02-20 14:39:50,188 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 74 transitions. Word has length 13 [2022-02-20 14:39:50,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:50,188 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 74 transitions. [2022-02-20 14:39:50,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,188 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 74 transitions. [2022-02-20 14:39:50,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 14:39:50,189 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:50,189 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:50,191 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:39:50,191 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:50,191 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:50,192 INFO L85 PathProgramCache]: Analyzing trace with hash -881957389, now seen corresponding path program 1 times [2022-02-20 14:39:50,192 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:50,192 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627767169] [2022-02-20 14:39:50,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:50,192 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:50,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:50,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {450#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); {450#true} is VALID [2022-02-20 14:39:50,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {450#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_~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_~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;havoc main_~cond~0#1; {450#true} is VALID [2022-02-20 14:39:50,246 INFO L290 TraceCheckUtils]: 2: Hoare triple {450#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {450#true} is VALID [2022-02-20 14:39:50,246 INFO L290 TraceCheckUtils]: 3: Hoare triple {450#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; {450#true} is VALID [2022-02-20 14:39:50,246 INFO L290 TraceCheckUtils]: 4: Hoare triple {450#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {452#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:50,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {452#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {452#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:50,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {452#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p3~0#1); {452#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:50,248 INFO L290 TraceCheckUtils]: 7: Hoare triple {452#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {452#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:50,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {452#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {452#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:50,249 INFO L290 TraceCheckUtils]: 9: Hoare triple {452#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {452#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-20 14:39:50,249 INFO L290 TraceCheckUtils]: 10: Hoare triple {452#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p1~0#1); {451#false} is VALID [2022-02-20 14:39:50,250 INFO L290 TraceCheckUtils]: 11: Hoare triple {451#false} assume 0 != main_~p2~0#1; {451#false} is VALID [2022-02-20 14:39:50,250 INFO L290 TraceCheckUtils]: 12: Hoare triple {451#false} assume 1 != main_~lk2~0#1; {451#false} is VALID [2022-02-20 14:39:50,250 INFO L290 TraceCheckUtils]: 13: Hoare triple {451#false} assume !false; {451#false} is VALID [2022-02-20 14:39:50,250 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:50,251 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:50,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627767169] [2022-02-20 14:39:50,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627767169] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:50,252 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:50,252 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:50,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723339090] [2022-02-20 14:39:50,253 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:50,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:39:50,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:50,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:50,272 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:50,272 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:50,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:50,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:50,273 INFO L87 Difference]: Start difference. First operand 43 states and 74 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:50,343 INFO L93 Difference]: Finished difference Result 69 states and 114 transitions. [2022-02-20 14:39:50,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:50,344 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:39:50,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:50,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-02-20 14:39:50,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-02-20 14:39:50,351 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-02-20 14:39:50,428 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:50,432 INFO L225 Difference]: With dead ends: 69 [2022-02-20 14:39:50,433 INFO L226 Difference]: Without dead ends: 48 [2022-02-20 14:39:50,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:50,439 INFO L933 BasicCegarLoop]: 62 mSDtfsCounter, 30 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 96 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:50,440 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 96 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:50,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2022-02-20 14:39:50,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 46. [2022-02-20 14:39:50,448 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:50,449 INFO L82 GeneralOperation]: Start isEquivalent. First operand 48 states. Second operand has 46 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 45 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,449 INFO L74 IsIncluded]: Start isIncluded. First operand 48 states. Second operand has 46 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 45 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,449 INFO L87 Difference]: Start difference. First operand 48 states. Second operand has 46 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 45 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:50,451 INFO L93 Difference]: Finished difference Result 48 states and 77 transitions. [2022-02-20 14:39:50,451 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 77 transitions. [2022-02-20 14:39:50,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:50,452 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:50,452 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 45 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 48 states. [2022-02-20 14:39:50,452 INFO L87 Difference]: Start difference. First operand has 46 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 45 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 48 states. [2022-02-20 14:39:50,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:50,454 INFO L93 Difference]: Finished difference Result 48 states and 77 transitions. [2022-02-20 14:39:50,454 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 77 transitions. [2022-02-20 14:39:50,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:50,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:50,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:50,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:50,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 45 states have (on average 1.6888888888888889) internal successors, (76), 45 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 76 transitions. [2022-02-20 14:39:50,456 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 76 transitions. Word has length 14 [2022-02-20 14:39:50,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:50,457 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 76 transitions. [2022-02-20 14:39:50,457 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,457 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 76 transitions. [2022-02-20 14:39:50,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 14:39:50,458 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:50,458 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:50,458 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 14:39:50,458 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:50,459 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:50,459 INFO L85 PathProgramCache]: Analyzing trace with hash -1274984399, now seen corresponding path program 1 times [2022-02-20 14:39:50,459 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:50,459 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1470298948] [2022-02-20 14:39:50,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:50,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:50,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:50,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {677#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); {677#true} is VALID [2022-02-20 14:39:50,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {677#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_~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_~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;havoc main_~cond~0#1; {677#true} is VALID [2022-02-20 14:39:50,488 INFO L290 TraceCheckUtils]: 2: Hoare triple {677#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {677#true} is VALID [2022-02-20 14:39:50,489 INFO L290 TraceCheckUtils]: 3: Hoare triple {677#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; {677#true} is VALID [2022-02-20 14:39:50,489 INFO L290 TraceCheckUtils]: 4: Hoare triple {677#true} assume !(0 != main_~p1~0#1); {677#true} is VALID [2022-02-20 14:39:50,489 INFO L290 TraceCheckUtils]: 5: Hoare triple {677#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {679#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:50,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {679#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p3~0#1); {679#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:50,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {679#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {679#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:50,490 INFO L290 TraceCheckUtils]: 8: Hoare triple {679#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {679#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:50,491 INFO L290 TraceCheckUtils]: 9: Hoare triple {679#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {679#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:50,491 INFO L290 TraceCheckUtils]: 10: Hoare triple {679#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p1~0#1); {679#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:50,492 INFO L290 TraceCheckUtils]: 11: Hoare triple {679#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p2~0#1; {679#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-20 14:39:50,492 INFO L290 TraceCheckUtils]: 12: Hoare triple {679#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 1 != main_~lk2~0#1; {678#false} is VALID [2022-02-20 14:39:50,492 INFO L290 TraceCheckUtils]: 13: Hoare triple {678#false} assume !false; {678#false} is VALID [2022-02-20 14:39:50,493 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:50,493 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:50,493 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1470298948] [2022-02-20 14:39:50,493 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1470298948] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:50,493 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:50,493 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:50,493 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1386183785] [2022-02-20 14:39:50,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:50,494 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:39:50,494 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:50,494 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,505 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:50,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:50,505 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:50,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:50,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:50,506 INFO L87 Difference]: Start difference. First operand 46 states and 76 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,569 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:50,572 INFO L93 Difference]: Finished difference Result 85 states and 141 transitions. [2022-02-20 14:39:50,573 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:50,573 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:39:50,573 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:50,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-02-20 14:39:50,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,577 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-02-20 14:39:50,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 75 transitions. [2022-02-20 14:39:50,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:50,646 INFO L225 Difference]: With dead ends: 85 [2022-02-20 14:39:50,646 INFO L226 Difference]: Without dead ends: 83 [2022-02-20 14:39:50,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:50,647 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 25 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 77 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:50,647 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 77 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:50,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2022-02-20 14:39:50,651 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 61. [2022-02-20 14:39:50,651 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:50,651 INFO L82 GeneralOperation]: Start isEquivalent. First operand 83 states. Second operand has 61 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 60 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,651 INFO L74 IsIncluded]: Start isIncluded. First operand 83 states. Second operand has 61 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 60 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,651 INFO L87 Difference]: Start difference. First operand 83 states. Second operand has 61 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 60 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:50,653 INFO L93 Difference]: Finished difference Result 83 states and 138 transitions. [2022-02-20 14:39:50,653 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 138 transitions. [2022-02-20 14:39:50,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:50,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:50,654 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 60 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 83 states. [2022-02-20 14:39:50,654 INFO L87 Difference]: Start difference. First operand has 61 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 60 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 83 states. [2022-02-20 14:39:50,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:50,671 INFO L93 Difference]: Finished difference Result 83 states and 138 transitions. [2022-02-20 14:39:50,671 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 138 transitions. [2022-02-20 14:39:50,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:50,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:50,671 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:50,671 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:50,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 60 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 101 transitions. [2022-02-20 14:39:50,673 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 101 transitions. Word has length 14 [2022-02-20 14:39:50,673 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:50,673 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 101 transitions. [2022-02-20 14:39:50,673 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,673 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 101 transitions. [2022-02-20 14:39:50,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 14:39:50,676 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:50,676 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:50,676 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 14:39:50,676 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:50,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:50,677 INFO L85 PathProgramCache]: Analyzing trace with hash -594926029, now seen corresponding path program 1 times [2022-02-20 14:39:50,677 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:50,677 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [570954815] [2022-02-20 14:39:50,677 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:50,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:50,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:50,701 INFO L290 TraceCheckUtils]: 0: Hoare triple {1006#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); {1006#true} is VALID [2022-02-20 14:39:50,701 INFO L290 TraceCheckUtils]: 1: Hoare triple {1006#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_~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_~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;havoc main_~cond~0#1; {1006#true} is VALID [2022-02-20 14:39:50,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {1006#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {1006#true} is VALID [2022-02-20 14:39:50,702 INFO L290 TraceCheckUtils]: 3: Hoare triple {1006#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; {1006#true} is VALID [2022-02-20 14:39:50,702 INFO L290 TraceCheckUtils]: 4: Hoare triple {1006#true} assume !(0 != main_~p1~0#1); {1006#true} is VALID [2022-02-20 14:39:50,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {1006#true} assume !(0 != main_~p2~0#1); {1008#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:50,703 INFO L290 TraceCheckUtils]: 6: Hoare triple {1008#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p3~0#1); {1008#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:50,703 INFO L290 TraceCheckUtils]: 7: Hoare triple {1008#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1008#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:50,703 INFO L290 TraceCheckUtils]: 8: Hoare triple {1008#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1008#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:50,704 INFO L290 TraceCheckUtils]: 9: Hoare triple {1008#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1008#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:50,704 INFO L290 TraceCheckUtils]: 10: Hoare triple {1008#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p1~0#1); {1008#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-20 14:39:50,704 INFO L290 TraceCheckUtils]: 11: Hoare triple {1008#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p2~0#1; {1007#false} is VALID [2022-02-20 14:39:50,704 INFO L290 TraceCheckUtils]: 12: Hoare triple {1007#false} assume 1 != main_~lk2~0#1; {1007#false} is VALID [2022-02-20 14:39:50,705 INFO L290 TraceCheckUtils]: 13: Hoare triple {1007#false} assume !false; {1007#false} is VALID [2022-02-20 14:39:50,705 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:50,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:50,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [570954815] [2022-02-20 14:39:50,705 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [570954815] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:50,705 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:50,705 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:50,705 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7321561] [2022-02-20 14:39:50,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:50,706 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:39:50,706 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:50,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,714 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:50,714 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:50,714 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:50,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:50,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:50,714 INFO L87 Difference]: Start difference. First operand 61 states and 101 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:50,757 INFO L93 Difference]: Finished difference Result 141 states and 235 transitions. [2022-02-20 14:39:50,757 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:50,757 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:39:50,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:50,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-02-20 14:39:50,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 113 transitions. [2022-02-20 14:39:50,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 113 transitions. [2022-02-20 14:39:50,821 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:50,824 INFO L225 Difference]: With dead ends: 141 [2022-02-20 14:39:50,824 INFO L226 Difference]: Without dead ends: 85 [2022-02-20 14:39:50,825 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:50,828 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 27 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 88 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:50,828 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 88 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:50,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2022-02-20 14:39:50,841 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 83. [2022-02-20 14:39:50,842 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:50,842 INFO L82 GeneralOperation]: Start isEquivalent. First operand 85 states. Second operand has 83 states, 82 states have (on average 1.646341463414634) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,842 INFO L74 IsIncluded]: Start isIncluded. First operand 85 states. Second operand has 83 states, 82 states have (on average 1.646341463414634) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,842 INFO L87 Difference]: Start difference. First operand 85 states. Second operand has 83 states, 82 states have (on average 1.646341463414634) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:50,845 INFO L93 Difference]: Finished difference Result 85 states and 136 transitions. [2022-02-20 14:39:50,845 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 136 transitions. [2022-02-20 14:39:50,845 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:50,845 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:50,846 INFO L74 IsIncluded]: Start isIncluded. First operand has 83 states, 82 states have (on average 1.646341463414634) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 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 85 states. [2022-02-20 14:39:50,846 INFO L87 Difference]: Start difference. First operand has 83 states, 82 states have (on average 1.646341463414634) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 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 85 states. [2022-02-20 14:39:50,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:50,848 INFO L93 Difference]: Finished difference Result 85 states and 136 transitions. [2022-02-20 14:39:50,848 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 136 transitions. [2022-02-20 14:39:50,848 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:50,848 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:50,849 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:50,849 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:50,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 82 states have (on average 1.646341463414634) internal successors, (135), 82 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,851 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 135 transitions. [2022-02-20 14:39:50,854 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 135 transitions. Word has length 14 [2022-02-20 14:39:50,855 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:50,855 INFO L470 AbstractCegarLoop]: Abstraction has 83 states and 135 transitions. [2022-02-20 14:39:50,855 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,855 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 135 transitions. [2022-02-20 14:39:50,856 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:39:50,856 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:50,856 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:50,856 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 14:39:50,856 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:50,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:50,857 INFO L85 PathProgramCache]: Analyzing trace with hash -869595720, now seen corresponding path program 1 times [2022-02-20 14:39:50,857 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:50,857 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650411799] [2022-02-20 14:39:50,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:50,857 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:50,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:50,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {1421#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); {1421#true} is VALID [2022-02-20 14:39:50,913 INFO L290 TraceCheckUtils]: 1: Hoare triple {1421#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_~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_~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;havoc main_~cond~0#1; {1421#true} is VALID [2022-02-20 14:39:50,913 INFO L290 TraceCheckUtils]: 2: Hoare triple {1421#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {1421#true} is VALID [2022-02-20 14:39:50,913 INFO L290 TraceCheckUtils]: 3: Hoare triple {1421#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; {1421#true} is VALID [2022-02-20 14:39:50,913 INFO L290 TraceCheckUtils]: 4: Hoare triple {1421#true} assume !(0 != main_~p1~0#1); {1421#true} is VALID [2022-02-20 14:39:50,914 INFO L290 TraceCheckUtils]: 5: Hoare triple {1421#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {1423#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:50,914 INFO L290 TraceCheckUtils]: 6: Hoare triple {1423#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p3~0#1); {1423#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:50,914 INFO L290 TraceCheckUtils]: 7: Hoare triple {1423#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1423#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:50,917 INFO L290 TraceCheckUtils]: 8: Hoare triple {1423#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1423#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:50,918 INFO L290 TraceCheckUtils]: 9: Hoare triple {1423#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1423#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:50,918 INFO L290 TraceCheckUtils]: 10: Hoare triple {1423#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p1~0#1); {1423#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-20 14:39:50,919 INFO L290 TraceCheckUtils]: 11: Hoare triple {1423#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p2~0#1); {1422#false} is VALID [2022-02-20 14:39:50,919 INFO L290 TraceCheckUtils]: 12: Hoare triple {1422#false} assume 0 != main_~p3~0#1; {1422#false} is VALID [2022-02-20 14:39:50,919 INFO L290 TraceCheckUtils]: 13: Hoare triple {1422#false} assume 1 != main_~lk3~0#1; {1422#false} is VALID [2022-02-20 14:39:50,919 INFO L290 TraceCheckUtils]: 14: Hoare triple {1422#false} assume !false; {1422#false} is VALID [2022-02-20 14:39:50,919 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:50,919 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:50,919 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650411799] [2022-02-20 14:39:50,919 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650411799] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:50,920 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:50,920 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:50,920 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509764561] [2022-02-20 14:39:50,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:50,920 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 14:39:50,920 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:50,920 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,928 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:50,929 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:50,929 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:50,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:50,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:50,929 INFO L87 Difference]: Start difference. First operand 83 states and 135 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:50,973 INFO L93 Difference]: Finished difference Result 126 states and 202 transitions. [2022-02-20 14:39:50,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:50,973 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 14:39:50,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:50,973 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2022-02-20 14:39:50,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:50,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 108 transitions. [2022-02-20 14:39:50,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 108 transitions. [2022-02-20 14:39:51,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 108 edges. 108 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:51,031 INFO L225 Difference]: With dead ends: 126 [2022-02-20 14:39:51,031 INFO L226 Difference]: Without dead ends: 87 [2022-02-20 14:39:51,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:51,036 INFO L933 BasicCegarLoop]: 59 mSDtfsCounter, 29 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 92 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:51,055 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 92 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:51,056 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-02-20 14:39:51,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 85. [2022-02-20 14:39:51,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:51,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 85 states, 84 states have (on average 1.6071428571428572) internal successors, (135), 84 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,059 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 85 states, 84 states have (on average 1.6071428571428572) internal successors, (135), 84 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,060 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 85 states, 84 states have (on average 1.6071428571428572) internal successors, (135), 84 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:51,062 INFO L93 Difference]: Finished difference Result 87 states and 136 transitions. [2022-02-20 14:39:51,062 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 136 transitions. [2022-02-20 14:39:51,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:51,062 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:51,062 INFO L74 IsIncluded]: Start isIncluded. First operand has 85 states, 84 states have (on average 1.6071428571428572) internal successors, (135), 84 states have internal predecessors, (135), 0 states have call successors, (0), 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 87 states. [2022-02-20 14:39:51,062 INFO L87 Difference]: Start difference. First operand has 85 states, 84 states have (on average 1.6071428571428572) internal successors, (135), 84 states have internal predecessors, (135), 0 states have call successors, (0), 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 87 states. [2022-02-20 14:39:51,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:51,064 INFO L93 Difference]: Finished difference Result 87 states and 136 transitions. [2022-02-20 14:39:51,064 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 136 transitions. [2022-02-20 14:39:51,065 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:51,065 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:51,065 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:51,065 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:51,065 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 84 states have (on average 1.6071428571428572) internal successors, (135), 84 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 135 transitions. [2022-02-20 14:39:51,068 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 135 transitions. Word has length 15 [2022-02-20 14:39:51,069 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:51,069 INFO L470 AbstractCegarLoop]: Abstraction has 85 states and 135 transitions. [2022-02-20 14:39:51,069 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,069 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 135 transitions. [2022-02-20 14:39:51,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:39:51,070 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:51,070 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:51,070 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 14:39:51,070 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:51,071 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:51,071 INFO L85 PathProgramCache]: Analyzing trace with hash -1262622730, now seen corresponding path program 1 times [2022-02-20 14:39:51,071 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:51,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236986127] [2022-02-20 14:39:51,071 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:51,071 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:51,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:51,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {1827#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); {1827#true} is VALID [2022-02-20 14:39:51,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {1827#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_~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_~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;havoc main_~cond~0#1; {1827#true} is VALID [2022-02-20 14:39:51,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {1827#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {1827#true} is VALID [2022-02-20 14:39:51,115 INFO L290 TraceCheckUtils]: 3: Hoare triple {1827#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; {1827#true} is VALID [2022-02-20 14:39:51,115 INFO L290 TraceCheckUtils]: 4: Hoare triple {1827#true} assume !(0 != main_~p1~0#1); {1827#true} is VALID [2022-02-20 14:39:51,115 INFO L290 TraceCheckUtils]: 5: Hoare triple {1827#true} assume !(0 != main_~p2~0#1); {1827#true} is VALID [2022-02-20 14:39:51,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {1827#true} assume !(0 != main_~p3~0#1); {1829#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:51,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {1829#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1829#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:51,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {1829#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1829#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:51,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {1829#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1829#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:51,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {1829#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p1~0#1); {1829#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:51,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {1829#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p2~0#1); {1829#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-20 14:39:51,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {1829#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p3~0#1; {1828#false} is VALID [2022-02-20 14:39:51,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {1828#false} assume 1 != main_~lk3~0#1; {1828#false} is VALID [2022-02-20 14:39:51,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {1828#false} assume !false; {1828#false} is VALID [2022-02-20 14:39:51,118 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:51,118 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:51,118 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236986127] [2022-02-20 14:39:51,119 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236986127] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:51,119 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:51,119 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:51,119 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [526993927] [2022-02-20 14:39:51,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:51,119 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 14:39:51,119 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:51,119 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:51,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:51,132 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:51,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:51,132 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:51,132 INFO L87 Difference]: Start difference. First operand 85 states and 135 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:51,177 INFO L93 Difference]: Finished difference Result 237 states and 377 transitions. [2022-02-20 14:39:51,177 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:51,177 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 14:39:51,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:51,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-02-20 14:39:51,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 111 transitions. [2022-02-20 14:39:51,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 111 transitions. [2022-02-20 14:39:51,252 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:51,255 INFO L225 Difference]: With dead ends: 237 [2022-02-20 14:39:51,255 INFO L226 Difference]: Without dead ends: 159 [2022-02-20 14:39:51,256 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:51,257 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 27 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:51,257 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 79 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:51,258 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-02-20 14:39:51,277 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 157. [2022-02-20 14:39:51,277 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:51,278 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 157 states, 156 states have (on average 1.5576923076923077) internal successors, (243), 156 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,278 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 157 states, 156 states have (on average 1.5576923076923077) internal successors, (243), 156 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,278 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 157 states, 156 states have (on average 1.5576923076923077) internal successors, (243), 156 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:51,282 INFO L93 Difference]: Finished difference Result 159 states and 244 transitions. [2022-02-20 14:39:51,282 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 244 transitions. [2022-02-20 14:39:51,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:51,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:51,283 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 156 states have (on average 1.5576923076923077) internal successors, (243), 156 states have internal predecessors, (243), 0 states have call successors, (0), 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 159 states. [2022-02-20 14:39:51,283 INFO L87 Difference]: Start difference. First operand has 157 states, 156 states have (on average 1.5576923076923077) internal successors, (243), 156 states have internal predecessors, (243), 0 states have call successors, (0), 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 159 states. [2022-02-20 14:39:51,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:51,287 INFO L93 Difference]: Finished difference Result 159 states and 244 transitions. [2022-02-20 14:39:51,287 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 244 transitions. [2022-02-20 14:39:51,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:51,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:51,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:51,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:51,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.5576923076923077) internal successors, (243), 156 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 243 transitions. [2022-02-20 14:39:51,294 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 243 transitions. Word has length 15 [2022-02-20 14:39:51,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:51,294 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 243 transitions. [2022-02-20 14:39:51,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,295 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 243 transitions. [2022-02-20 14:39:51,296 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:39:51,296 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:51,296 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:51,296 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 14:39:51,297 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:51,298 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:51,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1942681100, now seen corresponding path program 1 times [2022-02-20 14:39:51,298 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:51,298 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687817425] [2022-02-20 14:39:51,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:51,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:51,327 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:51,346 INFO L290 TraceCheckUtils]: 0: Hoare triple {2570#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); {2570#true} is VALID [2022-02-20 14:39:51,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {2570#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_~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_~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;havoc main_~cond~0#1; {2570#true} is VALID [2022-02-20 14:39:51,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {2570#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {2570#true} is VALID [2022-02-20 14:39:51,346 INFO L290 TraceCheckUtils]: 3: Hoare triple {2570#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; {2570#true} is VALID [2022-02-20 14:39:51,346 INFO L290 TraceCheckUtils]: 4: Hoare triple {2570#true} assume !(0 != main_~p1~0#1); {2570#true} is VALID [2022-02-20 14:39:51,347 INFO L290 TraceCheckUtils]: 5: Hoare triple {2570#true} assume !(0 != main_~p2~0#1); {2570#true} is VALID [2022-02-20 14:39:51,347 INFO L290 TraceCheckUtils]: 6: Hoare triple {2570#true} assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; {2572#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:51,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {2572#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {2572#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:51,350 INFO L290 TraceCheckUtils]: 8: Hoare triple {2572#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2572#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:51,350 INFO L290 TraceCheckUtils]: 9: Hoare triple {2572#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2572#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:51,350 INFO L290 TraceCheckUtils]: 10: Hoare triple {2572#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p1~0#1); {2572#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:51,351 INFO L290 TraceCheckUtils]: 11: Hoare triple {2572#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p2~0#1); {2572#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:51,351 INFO L290 TraceCheckUtils]: 12: Hoare triple {2572#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p3~0#1; {2572#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-20 14:39:51,351 INFO L290 TraceCheckUtils]: 13: Hoare triple {2572#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 1 != main_~lk3~0#1; {2571#false} is VALID [2022-02-20 14:39:51,352 INFO L290 TraceCheckUtils]: 14: Hoare triple {2571#false} assume !false; {2571#false} is VALID [2022-02-20 14:39:51,352 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:51,352 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:51,352 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687817425] [2022-02-20 14:39:51,352 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687817425] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:51,352 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:51,352 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:51,353 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1547949850] [2022-02-20 14:39:51,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:51,354 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 14:39:51,354 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:51,354 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,362 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:51,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:51,362 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:51,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:51,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:51,363 INFO L87 Difference]: Start difference. First operand 157 states and 243 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,410 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:51,410 INFO L93 Difference]: Finished difference Result 193 states and 301 transitions. [2022-02-20 14:39:51,410 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:51,410 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 14:39:51,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:51,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-02-20 14:39:51,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 68 transitions. [2022-02-20 14:39:51,412 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 68 transitions. [2022-02-20 14:39:51,444 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:51,447 INFO L225 Difference]: With dead ends: 193 [2022-02-20 14:39:51,447 INFO L226 Difference]: Without dead ends: 191 [2022-02-20 14:39:51,447 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:51,448 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 22 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 98 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:51,448 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 98 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:51,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-02-20 14:39:51,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 157. [2022-02-20 14:39:51,453 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:51,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 157 states, 156 states have (on average 1.5320512820512822) internal successors, (239), 156 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,454 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 157 states, 156 states have (on average 1.5320512820512822) internal successors, (239), 156 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,460 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 157 states, 156 states have (on average 1.5320512820512822) internal successors, (239), 156 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:51,465 INFO L93 Difference]: Finished difference Result 191 states and 296 transitions. [2022-02-20 14:39:51,466 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 296 transitions. [2022-02-20 14:39:51,466 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:51,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:51,468 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 156 states have (on average 1.5320512820512822) internal successors, (239), 156 states have internal predecessors, (239), 0 states have call successors, (0), 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 191 states. [2022-02-20 14:39:51,468 INFO L87 Difference]: Start difference. First operand has 157 states, 156 states have (on average 1.5320512820512822) internal successors, (239), 156 states have internal predecessors, (239), 0 states have call successors, (0), 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 191 states. [2022-02-20 14:39:51,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:51,473 INFO L93 Difference]: Finished difference Result 191 states and 296 transitions. [2022-02-20 14:39:51,473 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 296 transitions. [2022-02-20 14:39:51,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:51,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:51,474 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:51,474 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:51,474 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 156 states have (on average 1.5320512820512822) internal successors, (239), 156 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 239 transitions. [2022-02-20 14:39:51,478 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 239 transitions. Word has length 15 [2022-02-20 14:39:51,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:51,478 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 239 transitions. [2022-02-20 14:39:51,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,478 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 239 transitions. [2022-02-20 14:39:51,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:39:51,479 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:51,479 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:51,479 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 14:39:51,479 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:51,479 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:51,480 INFO L85 PathProgramCache]: Analyzing trace with hash -486383640, now seen corresponding path program 1 times [2022-02-20 14:39:51,480 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:51,480 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1338596706] [2022-02-20 14:39:51,480 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:51,480 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:51,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:51,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {3333#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); {3333#true} is VALID [2022-02-20 14:39:51,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {3333#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_~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_~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;havoc main_~cond~0#1; {3333#true} is VALID [2022-02-20 14:39:51,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {3333#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {3333#true} is VALID [2022-02-20 14:39:51,522 INFO L290 TraceCheckUtils]: 3: Hoare triple {3333#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; {3333#true} is VALID [2022-02-20 14:39:51,523 INFO L290 TraceCheckUtils]: 4: Hoare triple {3333#true} assume !(0 != main_~p1~0#1); {3333#true} is VALID [2022-02-20 14:39:51,524 INFO L290 TraceCheckUtils]: 5: Hoare triple {3333#true} assume !(0 != main_~p2~0#1); {3333#true} is VALID [2022-02-20 14:39:51,531 INFO L290 TraceCheckUtils]: 6: Hoare triple {3333#true} assume !(0 != main_~p3~0#1); {3333#true} is VALID [2022-02-20 14:39:51,531 INFO L290 TraceCheckUtils]: 7: Hoare triple {3333#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {3335#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:51,532 INFO L290 TraceCheckUtils]: 8: Hoare triple {3335#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {3335#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:51,532 INFO L290 TraceCheckUtils]: 9: Hoare triple {3335#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {3335#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:51,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {3335#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p1~0#1); {3335#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:51,533 INFO L290 TraceCheckUtils]: 11: Hoare triple {3335#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p2~0#1); {3335#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:51,533 INFO L290 TraceCheckUtils]: 12: Hoare triple {3335#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p3~0#1); {3335#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:51,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {3335#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p4~0#1; {3335#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-20 14:39:51,534 INFO L290 TraceCheckUtils]: 14: Hoare triple {3335#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 1 != main_~lk4~0#1; {3334#false} is VALID [2022-02-20 14:39:51,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {3334#false} assume !false; {3334#false} is VALID [2022-02-20 14:39:51,535 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:51,535 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:51,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1338596706] [2022-02-20 14:39:51,535 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1338596706] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:51,535 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:51,536 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:51,537 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514489069] [2022-02-20 14:39:51,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:51,537 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:51,537 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:51,538 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:51,547 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:51,548 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:51,548 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:51,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:51,548 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:51,548 INFO L87 Difference]: Start difference. First operand 157 states and 239 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:51,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:51,599 INFO L93 Difference]: Finished difference Result 277 states and 425 transitions. [2022-02-20 14:39:51,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:51,599 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:51,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:51,599 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:51,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-02-20 14:39:51,600 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:51,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 67 transitions. [2022-02-20 14:39:51,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 67 transitions. [2022-02-20 14:39:51,634 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:51,639 INFO L225 Difference]: With dead ends: 277 [2022-02-20 14:39:51,639 INFO L226 Difference]: Without dead ends: 275 [2022-02-20 14:39:51,639 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:51,642 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 19 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 73 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:51,642 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 73 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:51,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 275 states. [2022-02-20 14:39:51,647 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 275 to 225. [2022-02-20 14:39:51,647 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:51,648 INFO L82 GeneralOperation]: Start isEquivalent. First operand 275 states. Second operand has 225 states, 224 states have (on average 1.4955357142857142) internal successors, (335), 224 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,648 INFO L74 IsIncluded]: Start isIncluded. First operand 275 states. Second operand has 225 states, 224 states have (on average 1.4955357142857142) internal successors, (335), 224 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,649 INFO L87 Difference]: Start difference. First operand 275 states. Second operand has 225 states, 224 states have (on average 1.4955357142857142) internal successors, (335), 224 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:51,655 INFO L93 Difference]: Finished difference Result 275 states and 416 transitions. [2022-02-20 14:39:51,655 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 416 transitions. [2022-02-20 14:39:51,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:51,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:51,656 INFO L74 IsIncluded]: Start isIncluded. First operand has 225 states, 224 states have (on average 1.4955357142857142) internal successors, (335), 224 states have internal predecessors, (335), 0 states have call successors, (0), 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 275 states. [2022-02-20 14:39:51,657 INFO L87 Difference]: Start difference. First operand has 225 states, 224 states have (on average 1.4955357142857142) internal successors, (335), 224 states have internal predecessors, (335), 0 states have call successors, (0), 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 275 states. [2022-02-20 14:39:51,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:51,664 INFO L93 Difference]: Finished difference Result 275 states and 416 transitions. [2022-02-20 14:39:51,665 INFO L276 IsEmpty]: Start isEmpty. Operand 275 states and 416 transitions. [2022-02-20 14:39:51,665 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:51,665 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:51,665 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:51,665 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:51,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 225 states, 224 states have (on average 1.4955357142857142) internal successors, (335), 224 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 225 states to 225 states and 335 transitions. [2022-02-20 14:39:51,670 INFO L78 Accepts]: Start accepts. Automaton has 225 states and 335 transitions. Word has length 16 [2022-02-20 14:39:51,671 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:51,671 INFO L470 AbstractCegarLoop]: Abstraction has 225 states and 335 transitions. [2022-02-20 14:39:51,671 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:51,671 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 335 transitions. [2022-02-20 14:39:51,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:39:51,671 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:51,671 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:51,672 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 14:39:51,672 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:51,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:51,672 INFO L85 PathProgramCache]: Analyzing trace with hash 193674730, now seen corresponding path program 1 times [2022-02-20 14:39:51,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:51,673 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731441967] [2022-02-20 14:39:51,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:51,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:51,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:51,712 INFO L290 TraceCheckUtils]: 0: Hoare triple {4420#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); {4420#true} is VALID [2022-02-20 14:39:51,713 INFO L290 TraceCheckUtils]: 1: Hoare triple {4420#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_~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_~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;havoc main_~cond~0#1; {4420#true} is VALID [2022-02-20 14:39:51,713 INFO L290 TraceCheckUtils]: 2: Hoare triple {4420#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {4420#true} is VALID [2022-02-20 14:39:51,713 INFO L290 TraceCheckUtils]: 3: Hoare triple {4420#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; {4420#true} is VALID [2022-02-20 14:39:51,713 INFO L290 TraceCheckUtils]: 4: Hoare triple {4420#true} assume !(0 != main_~p1~0#1); {4420#true} is VALID [2022-02-20 14:39:51,713 INFO L290 TraceCheckUtils]: 5: Hoare triple {4420#true} assume !(0 != main_~p2~0#1); {4420#true} is VALID [2022-02-20 14:39:51,714 INFO L290 TraceCheckUtils]: 6: Hoare triple {4420#true} assume !(0 != main_~p3~0#1); {4420#true} is VALID [2022-02-20 14:39:51,714 INFO L290 TraceCheckUtils]: 7: Hoare triple {4420#true} assume !(0 != main_~p4~0#1); {4422#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:51,714 INFO L290 TraceCheckUtils]: 8: Hoare triple {4422#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {4422#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:51,715 INFO L290 TraceCheckUtils]: 9: Hoare triple {4422#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {4422#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:51,715 INFO L290 TraceCheckUtils]: 10: Hoare triple {4422#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p1~0#1); {4422#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:51,715 INFO L290 TraceCheckUtils]: 11: Hoare triple {4422#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p2~0#1); {4422#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:51,716 INFO L290 TraceCheckUtils]: 12: Hoare triple {4422#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p3~0#1); {4422#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-20 14:39:51,716 INFO L290 TraceCheckUtils]: 13: Hoare triple {4422#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p4~0#1; {4421#false} is VALID [2022-02-20 14:39:51,716 INFO L290 TraceCheckUtils]: 14: Hoare triple {4421#false} assume 1 != main_~lk4~0#1; {4421#false} is VALID [2022-02-20 14:39:51,716 INFO L290 TraceCheckUtils]: 15: Hoare triple {4421#false} assume !false; {4421#false} is VALID [2022-02-20 14:39:51,717 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:51,717 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:51,717 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731441967] [2022-02-20 14:39:51,717 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731441967] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:51,717 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:51,717 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:51,717 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857786431] [2022-02-20 14:39:51,718 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:51,718 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:51,718 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:51,718 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:51,727 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:51,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:51,728 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:51,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:51,728 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:51,729 INFO L87 Difference]: Start difference. First operand 225 states and 335 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:51,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:51,777 INFO L93 Difference]: Finished difference Result 517 states and 769 transitions. [2022-02-20 14:39:51,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:51,778 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:51,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:51,778 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:51,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2022-02-20 14:39:51,779 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:51,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 107 transitions. [2022-02-20 14:39:51,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 107 transitions. [2022-02-20 14:39:51,830 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:51,834 INFO L225 Difference]: With dead ends: 517 [2022-02-20 14:39:51,834 INFO L226 Difference]: Without dead ends: 299 [2022-02-20 14:39:51,835 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:51,835 INFO L933 BasicCegarLoop]: 58 mSDtfsCounter, 25 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:39:51,836 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 90 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:39:51,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-02-20 14:39:51,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 297. [2022-02-20 14:39:51,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:51,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 299 states. Second operand has 297 states, 296 states have (on average 1.4425675675675675) internal successors, (427), 296 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,841 INFO L74 IsIncluded]: Start isIncluded. First operand 299 states. Second operand has 297 states, 296 states have (on average 1.4425675675675675) internal successors, (427), 296 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,842 INFO L87 Difference]: Start difference. First operand 299 states. Second operand has 297 states, 296 states have (on average 1.4425675675675675) internal successors, (427), 296 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,847 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:51,847 INFO L93 Difference]: Finished difference Result 299 states and 428 transitions. [2022-02-20 14:39:51,847 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 428 transitions. [2022-02-20 14:39:51,847 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:51,847 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:51,848 INFO L74 IsIncluded]: Start isIncluded. First operand has 297 states, 296 states have (on average 1.4425675675675675) internal successors, (427), 296 states have internal predecessors, (427), 0 states have call successors, (0), 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 299 states. [2022-02-20 14:39:51,848 INFO L87 Difference]: Start difference. First operand has 297 states, 296 states have (on average 1.4425675675675675) internal successors, (427), 296 states have internal predecessors, (427), 0 states have call successors, (0), 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 299 states. [2022-02-20 14:39:51,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:51,865 INFO L93 Difference]: Finished difference Result 299 states and 428 transitions. [2022-02-20 14:39:51,865 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 428 transitions. [2022-02-20 14:39:51,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:51,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:51,866 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:51,866 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:51,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 296 states have (on average 1.4425675675675675) internal successors, (427), 296 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:51,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 427 transitions. [2022-02-20 14:39:51,871 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 427 transitions. Word has length 16 [2022-02-20 14:39:51,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:51,871 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 427 transitions. [2022-02-20 14:39:51,872 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:51,872 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 427 transitions. [2022-02-20 14:39:51,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 14:39:51,872 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:51,872 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:51,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 14:39:51,873 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:51,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:51,873 INFO L85 PathProgramCache]: Analyzing trace with hash 2102192011, now seen corresponding path program 1 times [2022-02-20 14:39:51,874 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:51,874 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940629776] [2022-02-20 14:39:51,874 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:51,874 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:51,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:51,906 INFO L290 TraceCheckUtils]: 0: Hoare triple {5883#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); {5883#true} is VALID [2022-02-20 14:39:51,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {5883#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_~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_~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;havoc main_~cond~0#1; {5883#true} is VALID [2022-02-20 14:39:51,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {5883#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {5883#true} is VALID [2022-02-20 14:39:51,906 INFO L290 TraceCheckUtils]: 3: Hoare triple {5883#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; {5883#true} is VALID [2022-02-20 14:39:51,906 INFO L290 TraceCheckUtils]: 4: Hoare triple {5883#true} assume !(0 != main_~p1~0#1); {5883#true} is VALID [2022-02-20 14:39:51,907 INFO L290 TraceCheckUtils]: 5: Hoare triple {5883#true} assume !(0 != main_~p2~0#1); {5883#true} is VALID [2022-02-20 14:39:51,907 INFO L290 TraceCheckUtils]: 6: Hoare triple {5883#true} assume !(0 != main_~p3~0#1); {5883#true} is VALID [2022-02-20 14:39:51,907 INFO L290 TraceCheckUtils]: 7: Hoare triple {5883#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {5885#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:51,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {5885#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {5885#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:51,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {5885#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {5885#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:51,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {5885#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p1~0#1); {5885#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:51,908 INFO L290 TraceCheckUtils]: 11: Hoare triple {5885#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p2~0#1); {5885#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:51,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {5885#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p3~0#1); {5885#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-20 14:39:51,909 INFO L290 TraceCheckUtils]: 13: Hoare triple {5885#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p4~0#1); {5884#false} is VALID [2022-02-20 14:39:51,909 INFO L290 TraceCheckUtils]: 14: Hoare triple {5884#false} assume 0 != main_~p5~0#1; {5884#false} is VALID [2022-02-20 14:39:51,909 INFO L290 TraceCheckUtils]: 15: Hoare triple {5884#false} assume 1 != main_~lk5~0#1; {5884#false} is VALID [2022-02-20 14:39:51,910 INFO L290 TraceCheckUtils]: 16: Hoare triple {5884#false} assume !false; {5884#false} is VALID [2022-02-20 14:39:51,910 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:51,910 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:51,910 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940629776] [2022-02-20 14:39:51,910 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940629776] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:51,910 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:51,910 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:51,911 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576087387] [2022-02-20 14:39:51,911 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:51,911 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:51,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:51,911 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:51,920 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:51,920 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:51,920 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:51,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:51,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:51,920 INFO L87 Difference]: Start difference. First operand 297 states and 427 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:51,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:51,963 INFO L93 Difference]: Finished difference Result 453 states and 649 transitions. [2022-02-20 14:39:51,963 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:51,964 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:51,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:51,967 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:51,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2022-02-20 14:39:51,967 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:51,969 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 102 transitions. [2022-02-20 14:39:51,969 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 102 transitions. [2022-02-20 14:39:52,018 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:52,022 INFO L225 Difference]: With dead ends: 453 [2022-02-20 14:39:52,023 INFO L226 Difference]: Without dead ends: 311 [2022-02-20 14:39:52,023 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:52,023 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 27 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 84 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:52,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 84 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:52,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 311 states. [2022-02-20 14:39:52,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 311 to 309. [2022-02-20 14:39:52,029 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:52,029 INFO L82 GeneralOperation]: Start isEquivalent. First operand 311 states. Second operand has 309 states, 308 states have (on average 1.4123376623376624) internal successors, (435), 308 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:52,030 INFO L74 IsIncluded]: Start isIncluded. First operand 311 states. Second operand has 309 states, 308 states have (on average 1.4123376623376624) internal successors, (435), 308 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:52,030 INFO L87 Difference]: Start difference. First operand 311 states. Second operand has 309 states, 308 states have (on average 1.4123376623376624) internal successors, (435), 308 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:52,038 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:52,039 INFO L93 Difference]: Finished difference Result 311 states and 436 transitions. [2022-02-20 14:39:52,039 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 436 transitions. [2022-02-20 14:39:52,039 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:52,039 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:52,040 INFO L74 IsIncluded]: Start isIncluded. First operand has 309 states, 308 states have (on average 1.4123376623376624) internal successors, (435), 308 states have internal predecessors, (435), 0 states have call successors, (0), 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 311 states. [2022-02-20 14:39:52,040 INFO L87 Difference]: Start difference. First operand has 309 states, 308 states have (on average 1.4123376623376624) internal successors, (435), 308 states have internal predecessors, (435), 0 states have call successors, (0), 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 311 states. [2022-02-20 14:39:52,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:52,048 INFO L93 Difference]: Finished difference Result 311 states and 436 transitions. [2022-02-20 14:39:52,049 INFO L276 IsEmpty]: Start isEmpty. Operand 311 states and 436 transitions. [2022-02-20 14:39:52,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:52,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:52,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:52,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:52,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 309 states, 308 states have (on average 1.4123376623376624) internal successors, (435), 308 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:52,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 309 states to 309 states and 435 transitions. [2022-02-20 14:39:52,055 INFO L78 Accepts]: Start accepts. Automaton has 309 states and 435 transitions. Word has length 17 [2022-02-20 14:39:52,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:52,056 INFO L470 AbstractCegarLoop]: Abstraction has 309 states and 435 transitions. [2022-02-20 14:39:52,056 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:52,056 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 435 transitions. [2022-02-20 14:39:52,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 14:39:52,056 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:52,057 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:52,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 14:39:52,057 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:52,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:52,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1709165001, now seen corresponding path program 1 times [2022-02-20 14:39:52,057 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:52,058 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [467306633] [2022-02-20 14:39:52,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:52,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:52,076 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:52,090 INFO L290 TraceCheckUtils]: 0: Hoare triple {7318#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); {7318#true} is VALID [2022-02-20 14:39:52,090 INFO L290 TraceCheckUtils]: 1: Hoare triple {7318#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_~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_~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;havoc main_~cond~0#1; {7318#true} is VALID [2022-02-20 14:39:52,090 INFO L290 TraceCheckUtils]: 2: Hoare triple {7318#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {7318#true} is VALID [2022-02-20 14:39:52,091 INFO L290 TraceCheckUtils]: 3: Hoare triple {7318#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; {7318#true} is VALID [2022-02-20 14:39:52,091 INFO L290 TraceCheckUtils]: 4: Hoare triple {7318#true} assume !(0 != main_~p1~0#1); {7318#true} is VALID [2022-02-20 14:39:52,091 INFO L290 TraceCheckUtils]: 5: Hoare triple {7318#true} assume !(0 != main_~p2~0#1); {7318#true} is VALID [2022-02-20 14:39:52,091 INFO L290 TraceCheckUtils]: 6: Hoare triple {7318#true} assume !(0 != main_~p3~0#1); {7318#true} is VALID [2022-02-20 14:39:52,091 INFO L290 TraceCheckUtils]: 7: Hoare triple {7318#true} assume !(0 != main_~p4~0#1); {7318#true} is VALID [2022-02-20 14:39:52,092 INFO L290 TraceCheckUtils]: 8: Hoare triple {7318#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {7320#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:52,092 INFO L290 TraceCheckUtils]: 9: Hoare triple {7320#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {7320#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:52,092 INFO L290 TraceCheckUtils]: 10: Hoare triple {7320#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p1~0#1); {7320#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:52,093 INFO L290 TraceCheckUtils]: 11: Hoare triple {7320#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p2~0#1); {7320#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:52,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {7320#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p3~0#1); {7320#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:52,093 INFO L290 TraceCheckUtils]: 13: Hoare triple {7320#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p4~0#1); {7320#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:52,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {7320#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p5~0#1; {7320#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-20 14:39:52,094 INFO L290 TraceCheckUtils]: 15: Hoare triple {7320#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 1 != main_~lk5~0#1; {7319#false} is VALID [2022-02-20 14:39:52,094 INFO L290 TraceCheckUtils]: 16: Hoare triple {7319#false} assume !false; {7319#false} is VALID [2022-02-20 14:39:52,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:52,094 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:52,094 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [467306633] [2022-02-20 14:39:52,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [467306633] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:52,095 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:52,095 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:52,095 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [567192924] [2022-02-20 14:39:52,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:52,096 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:52,096 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:52,096 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:52,105 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:52,105 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:52,105 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:52,105 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:52,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:52,106 INFO L87 Difference]: Start difference. First operand 309 states and 435 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:52,149 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:52,149 INFO L93 Difference]: Finished difference Result 521 states and 733 transitions. [2022-02-20 14:39:52,149 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:52,149 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:52,150 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:52,150 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:52,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-02-20 14:39:52,151 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:52,151 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 63 transitions. [2022-02-20 14:39:52,151 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 63 transitions. [2022-02-20 14:39:52,181 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 63 edges. 63 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:52,190 INFO L225 Difference]: With dead ends: 521 [2022-02-20 14:39:52,190 INFO L226 Difference]: Without dead ends: 519 [2022-02-20 14:39:52,190 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:52,191 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 16 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 71 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:52,191 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 71 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:52,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 519 states. [2022-02-20 14:39:52,199 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 519 to 453. [2022-02-20 14:39:52,199 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:52,200 INFO L82 GeneralOperation]: Start isEquivalent. First operand 519 states. Second operand has 453 states, 452 states have (on average 1.3694690265486726) internal successors, (619), 452 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:52,200 INFO L74 IsIncluded]: Start isIncluded. First operand 519 states. Second operand has 453 states, 452 states have (on average 1.3694690265486726) internal successors, (619), 452 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:52,202 INFO L87 Difference]: Start difference. First operand 519 states. Second operand has 453 states, 452 states have (on average 1.3694690265486726) internal successors, (619), 452 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:52,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:52,220 INFO L93 Difference]: Finished difference Result 519 states and 716 transitions. [2022-02-20 14:39:52,220 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 716 transitions. [2022-02-20 14:39:52,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:52,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:52,221 INFO L74 IsIncluded]: Start isIncluded. First operand has 453 states, 452 states have (on average 1.3694690265486726) internal successors, (619), 452 states have internal predecessors, (619), 0 states have call successors, (0), 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 519 states. [2022-02-20 14:39:52,222 INFO L87 Difference]: Start difference. First operand has 453 states, 452 states have (on average 1.3694690265486726) internal successors, (619), 452 states have internal predecessors, (619), 0 states have call successors, (0), 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 519 states. [2022-02-20 14:39:52,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:52,234 INFO L93 Difference]: Finished difference Result 519 states and 716 transitions. [2022-02-20 14:39:52,234 INFO L276 IsEmpty]: Start isEmpty. Operand 519 states and 716 transitions. [2022-02-20 14:39:52,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:52,235 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:52,235 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:52,235 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:52,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 453 states, 452 states have (on average 1.3694690265486726) internal successors, (619), 452 states have internal predecessors, (619), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:52,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 453 states to 453 states and 619 transitions. [2022-02-20 14:39:52,245 INFO L78 Accepts]: Start accepts. Automaton has 453 states and 619 transitions. Word has length 17 [2022-02-20 14:39:52,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:52,246 INFO L470 AbstractCegarLoop]: Abstraction has 453 states and 619 transitions. [2022-02-20 14:39:52,246 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:52,246 INFO L276 IsEmpty]: Start isEmpty. Operand 453 states and 619 transitions. [2022-02-20 14:39:52,247 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 14:39:52,247 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:52,247 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:52,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 14:39:52,247 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:52,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:52,248 INFO L85 PathProgramCache]: Analyzing trace with hash -1905743925, now seen corresponding path program 1 times [2022-02-20 14:39:52,248 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:52,248 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398751280] [2022-02-20 14:39:52,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:52,249 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:52,260 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:52,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {9389#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); {9389#true} is VALID [2022-02-20 14:39:52,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {9389#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_~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_~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;havoc main_~cond~0#1; {9389#true} is VALID [2022-02-20 14:39:52,280 INFO L290 TraceCheckUtils]: 2: Hoare triple {9389#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {9389#true} is VALID [2022-02-20 14:39:52,280 INFO L290 TraceCheckUtils]: 3: Hoare triple {9389#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; {9389#true} is VALID [2022-02-20 14:39:52,280 INFO L290 TraceCheckUtils]: 4: Hoare triple {9389#true} assume !(0 != main_~p1~0#1); {9389#true} is VALID [2022-02-20 14:39:52,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {9389#true} assume !(0 != main_~p2~0#1); {9389#true} is VALID [2022-02-20 14:39:52,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {9389#true} assume !(0 != main_~p3~0#1); {9389#true} is VALID [2022-02-20 14:39:52,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {9389#true} assume !(0 != main_~p4~0#1); {9389#true} is VALID [2022-02-20 14:39:52,283 INFO L290 TraceCheckUtils]: 8: Hoare triple {9389#true} assume !(0 != main_~p5~0#1); {9391#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:52,284 INFO L290 TraceCheckUtils]: 9: Hoare triple {9391#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {9391#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:52,284 INFO L290 TraceCheckUtils]: 10: Hoare triple {9391#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p1~0#1); {9391#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:52,284 INFO L290 TraceCheckUtils]: 11: Hoare triple {9391#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p2~0#1); {9391#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:52,285 INFO L290 TraceCheckUtils]: 12: Hoare triple {9391#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p3~0#1); {9391#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:52,285 INFO L290 TraceCheckUtils]: 13: Hoare triple {9391#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p4~0#1); {9391#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-20 14:39:52,286 INFO L290 TraceCheckUtils]: 14: Hoare triple {9391#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p5~0#1; {9390#false} is VALID [2022-02-20 14:39:52,286 INFO L290 TraceCheckUtils]: 15: Hoare triple {9390#false} assume 1 != main_~lk5~0#1; {9390#false} is VALID [2022-02-20 14:39:52,286 INFO L290 TraceCheckUtils]: 16: Hoare triple {9390#false} assume !false; {9390#false} is VALID [2022-02-20 14:39:52,287 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:52,287 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:52,287 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398751280] [2022-02-20 14:39:52,287 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398751280] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:52,287 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:52,287 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:52,288 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [980461697] [2022-02-20 14:39:52,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:52,288 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:52,288 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:52,288 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:52,301 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:52,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:52,301 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:52,302 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:52,302 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:52,302 INFO L87 Difference]: Start difference. First operand 453 states and 619 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:52,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:52,381 INFO L93 Difference]: Finished difference Result 1017 states and 1373 transitions. [2022-02-20 14:39:52,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:52,381 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:52,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:52,381 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:52,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2022-02-20 14:39:52,382 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:52,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 104 transitions. [2022-02-20 14:39:52,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 104 transitions. [2022-02-20 14:39:52,443 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:52,453 INFO L225 Difference]: With dead ends: 1017 [2022-02-20 14:39:52,453 INFO L226 Difference]: Without dead ends: 583 [2022-02-20 14:39:52,454 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:52,455 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 24 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 91 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:52,455 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 91 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:52,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2022-02-20 14:39:52,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 581. [2022-02-20 14:39:52,464 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:52,465 INFO L82 GeneralOperation]: Start isEquivalent. First operand 583 states. Second operand has 581 states, 580 states have (on average 1.3017241379310345) internal successors, (755), 580 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:52,465 INFO L74 IsIncluded]: Start isIncluded. First operand 583 states. Second operand has 581 states, 580 states have (on average 1.3017241379310345) internal successors, (755), 580 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:52,466 INFO L87 Difference]: Start difference. First operand 583 states. Second operand has 581 states, 580 states have (on average 1.3017241379310345) internal successors, (755), 580 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:52,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:52,480 INFO L93 Difference]: Finished difference Result 583 states and 756 transitions. [2022-02-20 14:39:52,481 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 756 transitions. [2022-02-20 14:39:52,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:52,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:52,482 INFO L74 IsIncluded]: Start isIncluded. First operand has 581 states, 580 states have (on average 1.3017241379310345) internal successors, (755), 580 states have internal predecessors, (755), 0 states have call successors, (0), 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 583 states. [2022-02-20 14:39:52,488 INFO L87 Difference]: Start difference. First operand has 581 states, 580 states have (on average 1.3017241379310345) internal successors, (755), 580 states have internal predecessors, (755), 0 states have call successors, (0), 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 583 states. [2022-02-20 14:39:52,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:52,502 INFO L93 Difference]: Finished difference Result 583 states and 756 transitions. [2022-02-20 14:39:52,502 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 756 transitions. [2022-02-20 14:39:52,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:52,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:52,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:52,503 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:52,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 581 states, 580 states have (on average 1.3017241379310345) internal successors, (755), 580 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:52,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 581 states to 581 states and 755 transitions. [2022-02-20 14:39:52,521 INFO L78 Accepts]: Start accepts. Automaton has 581 states and 755 transitions. Word has length 17 [2022-02-20 14:39:52,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:52,522 INFO L470 AbstractCegarLoop]: Abstraction has 581 states and 755 transitions. [2022-02-20 14:39:52,522 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:52,522 INFO L276 IsEmpty]: Start isEmpty. Operand 581 states and 755 transitions. [2022-02-20 14:39:52,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:39:52,522 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:52,523 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:52,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 14:39:52,523 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:52,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:52,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1444723487, now seen corresponding path program 1 times [2022-02-20 14:39:52,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:52,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621781816] [2022-02-20 14:39:52,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:52,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:52,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:52,557 INFO L290 TraceCheckUtils]: 0: Hoare triple {12244#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); {12244#true} is VALID [2022-02-20 14:39:52,558 INFO L290 TraceCheckUtils]: 1: Hoare triple {12244#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_~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_~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;havoc main_~cond~0#1; {12244#true} is VALID [2022-02-20 14:39:52,558 INFO L290 TraceCheckUtils]: 2: Hoare triple {12244#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {12244#true} is VALID [2022-02-20 14:39:52,558 INFO L290 TraceCheckUtils]: 3: Hoare triple {12244#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; {12244#true} is VALID [2022-02-20 14:39:52,558 INFO L290 TraceCheckUtils]: 4: Hoare triple {12244#true} assume !(0 != main_~p1~0#1); {12244#true} is VALID [2022-02-20 14:39:52,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {12244#true} assume !(0 != main_~p2~0#1); {12244#true} is VALID [2022-02-20 14:39:52,559 INFO L290 TraceCheckUtils]: 6: Hoare triple {12244#true} assume !(0 != main_~p3~0#1); {12244#true} is VALID [2022-02-20 14:39:52,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {12244#true} assume !(0 != main_~p4~0#1); {12244#true} is VALID [2022-02-20 14:39:52,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {12244#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {12246#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:52,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {12246#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {12246#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:52,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {12246#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p1~0#1); {12246#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:52,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {12246#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p2~0#1); {12246#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:52,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {12246#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p3~0#1); {12246#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:52,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {12246#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p4~0#1); {12246#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-20 14:39:52,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {12246#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p5~0#1); {12245#false} is VALID [2022-02-20 14:39:52,561 INFO L290 TraceCheckUtils]: 15: Hoare triple {12245#false} assume 0 != main_~p6~0#1; {12245#false} is VALID [2022-02-20 14:39:52,562 INFO L290 TraceCheckUtils]: 16: Hoare triple {12245#false} assume 1 != main_~lk6~0#1; {12245#false} is VALID [2022-02-20 14:39:52,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {12245#false} assume !false; {12245#false} is VALID [2022-02-20 14:39:52,562 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:52,562 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:52,562 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621781816] [2022-02-20 14:39:52,562 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [621781816] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:52,563 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:52,563 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:52,563 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1005783094] [2022-02-20 14:39:52,563 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:52,564 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:52,564 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:52,564 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:52,573 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:52,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:52,574 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:52,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:52,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:52,575 INFO L87 Difference]: Start difference. First operand 581 states and 755 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:52,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:52,640 INFO L93 Difference]: Finished difference Result 873 states and 1125 transitions. [2022-02-20 14:39:52,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:52,641 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:52,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:52,641 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:52,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2022-02-20 14:39:52,642 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:52,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2022-02-20 14:39:52,642 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 99 transitions. [2022-02-20 14:39:52,687 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:39:52,698 INFO L225 Difference]: With dead ends: 873 [2022-02-20 14:39:52,698 INFO L226 Difference]: Without dead ends: 599 [2022-02-20 14:39:52,698 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:52,699 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 26 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 80 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:52,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [26 Valid, 80 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:52,701 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 599 states. [2022-02-20 14:39:52,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 599 to 597. [2022-02-20 14:39:52,711 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:52,712 INFO L82 GeneralOperation]: Start isEquivalent. First operand 599 states. Second operand has 597 states, 596 states have (on average 1.266778523489933) internal successors, (755), 596 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:52,713 INFO L74 IsIncluded]: Start isIncluded. First operand 599 states. Second operand has 597 states, 596 states have (on average 1.266778523489933) internal successors, (755), 596 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:52,714 INFO L87 Difference]: Start difference. First operand 599 states. Second operand has 597 states, 596 states have (on average 1.266778523489933) internal successors, (755), 596 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:52,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:52,730 INFO L93 Difference]: Finished difference Result 599 states and 756 transitions. [2022-02-20 14:39:52,730 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 756 transitions. [2022-02-20 14:39:52,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:52,731 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:52,731 INFO L74 IsIncluded]: Start isIncluded. First operand has 597 states, 596 states have (on average 1.266778523489933) internal successors, (755), 596 states have internal predecessors, (755), 0 states have call successors, (0), 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 599 states. [2022-02-20 14:39:52,732 INFO L87 Difference]: Start difference. First operand has 597 states, 596 states have (on average 1.266778523489933) internal successors, (755), 596 states have internal predecessors, (755), 0 states have call successors, (0), 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 599 states. [2022-02-20 14:39:52,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:52,754 INFO L93 Difference]: Finished difference Result 599 states and 756 transitions. [2022-02-20 14:39:52,755 INFO L276 IsEmpty]: Start isEmpty. Operand 599 states and 756 transitions. [2022-02-20 14:39:52,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:52,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:52,755 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:52,755 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:52,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 597 states, 596 states have (on average 1.266778523489933) internal successors, (755), 596 states have internal predecessors, (755), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:52,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 597 states to 597 states and 755 transitions. [2022-02-20 14:39:52,771 INFO L78 Accepts]: Start accepts. Automaton has 597 states and 755 transitions. Word has length 18 [2022-02-20 14:39:52,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:52,771 INFO L470 AbstractCegarLoop]: Abstraction has 597 states and 755 transitions. [2022-02-20 14:39:52,771 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:52,771 INFO L276 IsEmpty]: Start isEmpty. Operand 597 states and 755 transitions. [2022-02-20 14:39:52,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:39:52,772 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:52,772 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:52,772 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 14:39:52,772 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:52,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:52,773 INFO L85 PathProgramCache]: Analyzing trace with hash 1051696477, now seen corresponding path program 1 times [2022-02-20 14:39:52,773 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:52,773 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1139769405] [2022-02-20 14:39:52,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:52,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:52,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:52,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {15003#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); {15003#true} is VALID [2022-02-20 14:39:52,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {15003#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_~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_~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;havoc main_~cond~0#1; {15003#true} is VALID [2022-02-20 14:39:52,801 INFO L290 TraceCheckUtils]: 2: Hoare triple {15003#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {15003#true} is VALID [2022-02-20 14:39:52,801 INFO L290 TraceCheckUtils]: 3: Hoare triple {15003#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; {15003#true} is VALID [2022-02-20 14:39:52,801 INFO L290 TraceCheckUtils]: 4: Hoare triple {15003#true} assume !(0 != main_~p1~0#1); {15003#true} is VALID [2022-02-20 14:39:52,801 INFO L290 TraceCheckUtils]: 5: Hoare triple {15003#true} assume !(0 != main_~p2~0#1); {15003#true} is VALID [2022-02-20 14:39:52,801 INFO L290 TraceCheckUtils]: 6: Hoare triple {15003#true} assume !(0 != main_~p3~0#1); {15003#true} is VALID [2022-02-20 14:39:52,802 INFO L290 TraceCheckUtils]: 7: Hoare triple {15003#true} assume !(0 != main_~p4~0#1); {15003#true} is VALID [2022-02-20 14:39:52,802 INFO L290 TraceCheckUtils]: 8: Hoare triple {15003#true} assume !(0 != main_~p5~0#1); {15003#true} is VALID [2022-02-20 14:39:52,802 INFO L290 TraceCheckUtils]: 9: Hoare triple {15003#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {15005#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:52,802 INFO L290 TraceCheckUtils]: 10: Hoare triple {15005#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p1~0#1); {15005#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:52,803 INFO L290 TraceCheckUtils]: 11: Hoare triple {15005#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p2~0#1); {15005#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:52,803 INFO L290 TraceCheckUtils]: 12: Hoare triple {15005#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p3~0#1); {15005#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:52,803 INFO L290 TraceCheckUtils]: 13: Hoare triple {15005#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p4~0#1); {15005#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:52,804 INFO L290 TraceCheckUtils]: 14: Hoare triple {15005#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p5~0#1); {15005#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:52,804 INFO L290 TraceCheckUtils]: 15: Hoare triple {15005#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p6~0#1; {15005#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-20 14:39:52,804 INFO L290 TraceCheckUtils]: 16: Hoare triple {15005#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 1 != main_~lk6~0#1; {15004#false} is VALID [2022-02-20 14:39:52,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {15004#false} assume !false; {15004#false} is VALID [2022-02-20 14:39:52,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:52,805 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:52,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1139769405] [2022-02-20 14:39:52,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1139769405] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:52,805 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:52,806 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:52,806 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1191310224] [2022-02-20 14:39:52,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:52,806 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:52,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:52,806 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:52,815 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:52,815 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:52,815 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:52,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:52,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:52,815 INFO L87 Difference]: Start difference. First operand 597 states and 755 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:52,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:52,878 INFO L93 Difference]: Finished difference Result 967 states and 1204 transitions. [2022-02-20 14:39:52,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:52,879 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:52,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:52,879 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:52,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-02-20 14:39:52,880 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:52,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-02-20 14:39:52,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2022-02-20 14:39:52,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:39:52,935 INFO L225 Difference]: With dead ends: 967 [2022-02-20 14:39:52,935 INFO L226 Difference]: Without dead ends: 965 [2022-02-20 14:39:52,937 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:52,938 INFO L933 BasicCegarLoop]: 37 mSDtfsCounter, 12 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 68 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:52,939 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 68 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:52,940 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 965 states. [2022-02-20 14:39:52,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 965 to 901. [2022-02-20 14:39:52,952 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:52,953 INFO L82 GeneralOperation]: Start isEquivalent. First operand 965 states. Second operand has 901 states, 900 states have (on average 1.23) internal successors, (1107), 900 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:52,954 INFO L74 IsIncluded]: Start isIncluded. First operand 965 states. Second operand has 901 states, 900 states have (on average 1.23) internal successors, (1107), 900 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:52,955 INFO L87 Difference]: Start difference. First operand 965 states. Second operand has 901 states, 900 states have (on average 1.23) internal successors, (1107), 900 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:52,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:52,989 INFO L93 Difference]: Finished difference Result 965 states and 1171 transitions. [2022-02-20 14:39:52,989 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1171 transitions. [2022-02-20 14:39:52,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:52,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:52,992 INFO L74 IsIncluded]: Start isIncluded. First operand has 901 states, 900 states have (on average 1.23) internal successors, (1107), 900 states have internal predecessors, (1107), 0 states have call successors, (0), 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 965 states. [2022-02-20 14:39:52,992 INFO L87 Difference]: Start difference. First operand has 901 states, 900 states have (on average 1.23) internal successors, (1107), 900 states have internal predecessors, (1107), 0 states have call successors, (0), 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 965 states. [2022-02-20 14:39:53,025 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:53,025 INFO L93 Difference]: Finished difference Result 965 states and 1171 transitions. [2022-02-20 14:39:53,025 INFO L276 IsEmpty]: Start isEmpty. Operand 965 states and 1171 transitions. [2022-02-20 14:39:53,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:53,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:53,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:53,026 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:53,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 901 states, 900 states have (on average 1.23) internal successors, (1107), 900 states have internal predecessors, (1107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:39:53,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 901 states to 901 states and 1107 transitions. [2022-02-20 14:39:53,058 INFO L78 Accepts]: Start accepts. Automaton has 901 states and 1107 transitions. Word has length 18 [2022-02-20 14:39:53,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:53,058 INFO L470 AbstractCegarLoop]: Abstraction has 901 states and 1107 transitions. [2022-02-20 14:39:53,059 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:53,059 INFO L276 IsEmpty]: Start isEmpty. Operand 901 states and 1107 transitions. [2022-02-20 14:39:53,060 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:39:53,061 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:39:53,061 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:53,061 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 14:39:53,061 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:39:53,061 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:39:53,061 INFO L85 PathProgramCache]: Analyzing trace with hash 1731754847, now seen corresponding path program 1 times [2022-02-20 14:39:53,062 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:39:53,062 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1870367541] [2022-02-20 14:39:53,062 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:39:53,062 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:39:53,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:39:53,086 INFO L290 TraceCheckUtils]: 0: Hoare triple {18907#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); {18907#true} is VALID [2022-02-20 14:39:53,086 INFO L290 TraceCheckUtils]: 1: Hoare triple {18907#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_~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_~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;havoc main_~cond~0#1; {18907#true} is VALID [2022-02-20 14:39:53,086 INFO L290 TraceCheckUtils]: 2: Hoare triple {18907#true} assume !false;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1; {18907#true} is VALID [2022-02-20 14:39:53,087 INFO L290 TraceCheckUtils]: 3: Hoare triple {18907#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; {18907#true} is VALID [2022-02-20 14:39:53,087 INFO L290 TraceCheckUtils]: 4: Hoare triple {18907#true} assume !(0 != main_~p1~0#1); {18907#true} is VALID [2022-02-20 14:39:53,087 INFO L290 TraceCheckUtils]: 5: Hoare triple {18907#true} assume !(0 != main_~p2~0#1); {18907#true} is VALID [2022-02-20 14:39:53,087 INFO L290 TraceCheckUtils]: 6: Hoare triple {18907#true} assume !(0 != main_~p3~0#1); {18907#true} is VALID [2022-02-20 14:39:53,087 INFO L290 TraceCheckUtils]: 7: Hoare triple {18907#true} assume !(0 != main_~p4~0#1); {18907#true} is VALID [2022-02-20 14:39:53,087 INFO L290 TraceCheckUtils]: 8: Hoare triple {18907#true} assume !(0 != main_~p5~0#1); {18907#true} is VALID [2022-02-20 14:39:53,088 INFO L290 TraceCheckUtils]: 9: Hoare triple {18907#true} assume !(0 != main_~p6~0#1); {18909#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:53,089 INFO L290 TraceCheckUtils]: 10: Hoare triple {18909#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p1~0#1); {18909#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:53,090 INFO L290 TraceCheckUtils]: 11: Hoare triple {18909#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p2~0#1); {18909#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:53,090 INFO L290 TraceCheckUtils]: 12: Hoare triple {18909#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p3~0#1); {18909#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:53,091 INFO L290 TraceCheckUtils]: 13: Hoare triple {18909#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p4~0#1); {18909#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:53,094 INFO L290 TraceCheckUtils]: 14: Hoare triple {18909#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p5~0#1); {18909#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-20 14:39:53,095 INFO L290 TraceCheckUtils]: 15: Hoare triple {18909#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p6~0#1; {18908#false} is VALID [2022-02-20 14:39:53,099 INFO L290 TraceCheckUtils]: 16: Hoare triple {18908#false} assume 1 != main_~lk6~0#1; {18908#false} is VALID [2022-02-20 14:39:53,100 INFO L290 TraceCheckUtils]: 17: Hoare triple {18908#false} assume !false; {18908#false} is VALID [2022-02-20 14:39:53,101 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:39:53,101 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:39:53,101 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1870367541] [2022-02-20 14:39:53,102 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1870367541] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:39:53,102 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:39:53,102 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 14:39:53,102 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [518414129] [2022-02-20 14:39:53,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:39:53,103 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:53,103 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:39:53,103 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:53,112 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:53,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 14:39:53,112 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:39:53,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 14:39:53,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 14:39:53,113 INFO L87 Difference]: Start difference. First operand 901 states and 1107 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:53,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:53,297 INFO L93 Difference]: Finished difference Result 1989 states and 2387 transitions. [2022-02-20 14:39:53,297 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 14:39:53,297 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:53,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:39:53,298 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:53,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2022-02-20 14:39:53,299 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:53,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2022-02-20 14:39:53,299 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 99 transitions. [2022-02-20 14:39:53,344 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:39:53,344 INFO L225 Difference]: With dead ends: 1989 [2022-02-20 14:39:53,345 INFO L226 Difference]: Without dead ends: 0 [2022-02-20 14:39:53,347 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:53,347 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 22 mSDsluCounter, 29 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 90 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:53,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 90 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:53,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2022-02-20 14:39:53,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2022-02-20 14:39:53,349 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:39:53,349 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:39:53,349 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:39:53,349 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:39:53,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:53,350 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 14:39:53,350 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 14:39:53,350 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:53,350 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:53,350 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:39:53,350 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:39:53,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:39:53,350 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2022-02-20 14:39:53,351 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 14:39:53,351 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:53,351 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:39:53,351 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:39:53,351 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:39:53,351 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:39:53,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2022-02-20 14:39:53,351 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 18 [2022-02-20 14:39:53,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:39:53,352 INFO L470 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2022-02-20 14:39:53,352 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:53,352 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2022-02-20 14:39:53,352 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:39:53,354 INFO L764 garLoopResultBuilder]: Registering result SAFE for location ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 14:39:53,355 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 14:39:53,356 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2022-02-20 14:39:53,363 INFO L858 garLoopResultBuilder]: For program point L60-1(lines 29 104) no Hoare annotation was computed. [2022-02-20 14:39:53,363 INFO L858 garLoopResultBuilder]: For program point L85(line 85) no Hoare annotation was computed. [2022-02-20 14:39:53,363 INFO L858 garLoopResultBuilder]: For program point L52-1(lines 29 104) no Hoare annotation was computed. [2022-02-20 14:39:53,363 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2022-02-20 14:39:53,363 INFO L858 garLoopResultBuilder]: For program point L94-1(lines 29 104) no Hoare annotation was computed. [2022-02-20 14:39:53,363 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2022-02-20 14:39:53,363 INFO L858 garLoopResultBuilder]: For program point L95(line 95) no Hoare annotation was computed. [2022-02-20 14:39:53,364 INFO L858 garLoopResultBuilder]: For program point L79-1(lines 29 104) no Hoare annotation was computed. [2022-02-20 14:39:53,364 INFO L858 garLoopResultBuilder]: For program point L80(line 80) no Hoare annotation was computed. [2022-02-20 14:39:53,364 INFO L861 garLoopResultBuilder]: At program point L105(lines 7 109) the Hoare annotation is: true [2022-02-20 14:39:53,364 INFO L858 garLoopResultBuilder]: For program point L31(lines 31 33) no Hoare annotation was computed. [2022-02-20 14:39:53,364 INFO L858 garLoopResultBuilder]: For program point L64-1(lines 29 104) no Hoare annotation was computed. [2022-02-20 14:39:53,364 INFO L858 garLoopResultBuilder]: For program point L89-1(lines 29 104) no Hoare annotation was computed. [2022-02-20 14:39:53,364 INFO L858 garLoopResultBuilder]: For program point L56-1(lines 29 104) no Hoare annotation was computed. [2022-02-20 14:39:53,364 INFO L858 garLoopResultBuilder]: For program point L48(lines 48 50) no Hoare annotation was computed. [2022-02-20 14:39:53,365 INFO L858 garLoopResultBuilder]: For program point L48-2(lines 29 104) no Hoare annotation was computed. [2022-02-20 14:39:53,365 INFO L858 garLoopResultBuilder]: For program point L-1(line -1) no Hoare annotation was computed. [2022-02-20 14:39:53,365 INFO L858 garLoopResultBuilder]: For program point L90(line 90) no Hoare annotation was computed. [2022-02-20 14:39:53,365 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 107) no Hoare annotation was computed. [2022-02-20 14:39:53,365 INFO L858 garLoopResultBuilder]: For program point L74-1(lines 29 104) no Hoare annotation was computed. [2022-02-20 14:39:53,365 INFO L861 garLoopResultBuilder]: At program point L99-1(lines 29 104) the Hoare annotation is: true [2022-02-20 14:39:53,365 INFO L858 garLoopResultBuilder]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2022-02-20 14:39:53,365 INFO L861 garLoopResultBuilder]: At program point L108(lines 6 109) the Hoare annotation is: true [2022-02-20 14:39:53,366 INFO L858 garLoopResultBuilder]: For program point L75(line 75) no Hoare annotation was computed. [2022-02-20 14:39:53,366 INFO L858 garLoopResultBuilder]: For program point L100(line 100) no Hoare annotation was computed. [2022-02-20 14:39:53,366 INFO L854 garLoopResultBuilder]: At program point L100-1(lines 7 109) the Hoare annotation is: false [2022-02-20 14:39:53,366 INFO L858 garLoopResultBuilder]: For program point L84-1(lines 29 104) no Hoare annotation was computed. [2022-02-20 14:39:53,367 INFO L858 garLoopResultBuilder]: For program point L68-1(lines 29 104) no Hoare annotation was computed. [2022-02-20 14:39:53,370 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:39:53,371 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 14:39:53,373 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2022-02-20 14:39:53,374 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2022-02-20 14:39:53,374 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 14:39:53,374 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 14:39:53,374 WARN L170 areAnnotationChecker]: L31 has no Hoare annotation [2022-02-20 14:39:53,374 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 14:39:53,374 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 14:39:53,374 WARN L170 areAnnotationChecker]: L48 has no Hoare annotation [2022-02-20 14:39:53,374 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2022-02-20 14:39:53,374 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2022-02-20 14:39:53,374 WARN L170 areAnnotationChecker]: L48-2 has no Hoare annotation [2022-02-20 14:39:53,374 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2022-02-20 14:39:53,375 WARN L170 areAnnotationChecker]: L52-1 has no Hoare annotation [2022-02-20 14:39:53,375 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2022-02-20 14:39:53,375 WARN L170 areAnnotationChecker]: L56-1 has no Hoare annotation [2022-02-20 14:39:53,375 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-02-20 14:39:53,375 WARN L170 areAnnotationChecker]: L60-1 has no Hoare annotation [2022-02-20 14:39:53,375 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2022-02-20 14:39:53,375 WARN L170 areAnnotationChecker]: L64-1 has no Hoare annotation [2022-02-20 14:39:53,375 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2022-02-20 14:39:53,375 WARN L170 areAnnotationChecker]: L68-1 has no Hoare annotation [2022-02-20 14:39:53,375 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2022-02-20 14:39:53,375 WARN L170 areAnnotationChecker]: L75 has no Hoare annotation [2022-02-20 14:39:53,376 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2022-02-20 14:39:53,376 WARN L170 areAnnotationChecker]: L74-1 has no Hoare annotation [2022-02-20 14:39:53,376 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2022-02-20 14:39:53,376 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 14:39:53,376 WARN L170 areAnnotationChecker]: L80 has no Hoare annotation [2022-02-20 14:39:53,376 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2022-02-20 14:39:53,376 WARN L170 areAnnotationChecker]: L79-1 has no Hoare annotation [2022-02-20 14:39:53,376 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-02-20 14:39:53,376 WARN L170 areAnnotationChecker]: L85 has no Hoare annotation [2022-02-20 14:39:53,376 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2022-02-20 14:39:53,377 WARN L170 areAnnotationChecker]: L84-1 has no Hoare annotation [2022-02-20 14:39:53,377 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-02-20 14:39:53,377 WARN L170 areAnnotationChecker]: L90 has no Hoare annotation [2022-02-20 14:39:53,377 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2022-02-20 14:39:53,377 WARN L170 areAnnotationChecker]: L89-1 has no Hoare annotation [2022-02-20 14:39:53,377 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-02-20 14:39:53,377 WARN L170 areAnnotationChecker]: L95 has no Hoare annotation [2022-02-20 14:39:53,377 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2022-02-20 14:39:53,377 WARN L170 areAnnotationChecker]: L94-1 has no Hoare annotation [2022-02-20 14:39:53,377 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2022-02-20 14:39:53,377 WARN L170 areAnnotationChecker]: L100 has no Hoare annotation [2022-02-20 14:39:53,378 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:39:53,382 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 20.02 02:39:53 BoogieIcfgContainer [2022-02-20 14:39:53,382 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2022-02-20 14:39:53,383 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2022-02-20 14:39:53,383 INFO L271 PluginConnector]: Initializing Witness Printer... [2022-02-20 14:39:53,383 INFO L275 PluginConnector]: Witness Printer initialized [2022-02-20 14:39:53,383 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:49" (3/4) ... [2022-02-20 14:39:53,385 INFO L137 WitnessPrinter]: Generating witness for correct program [2022-02-20 14:39:53,394 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2022-02-20 14:39:53,394 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2022-02-20 14:39:53,394 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2022-02-20 14:39:53,394 INFO L910 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2022-02-20 14:39:53,436 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2022-02-20 14:39:53,436 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2022-02-20 14:39:53,437 INFO L158 Benchmark]: Toolchain (without parser) took 4702.06ms. Allocated memory was 102.8MB in the beginning and 148.9MB in the end (delta: 46.1MB). Free memory was 62.9MB in the beginning and 92.4MB in the end (delta: -29.5MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2022-02-20 14:39:53,437 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 102.8MB. Free memory is still 79.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:39:53,438 INFO L158 Benchmark]: CACSL2BoogieTranslator took 199.69ms. Allocated memory is still 102.8MB. Free memory was 62.7MB in the beginning and 76.3MB in the end (delta: -13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 14:39:53,438 INFO L158 Benchmark]: Boogie Procedure Inliner took 23.22ms. Allocated memory is still 102.8MB. Free memory was 76.3MB in the beginning and 74.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:39:53,439 INFO L158 Benchmark]: Boogie Preprocessor took 35.42ms. Allocated memory is still 102.8MB. Free memory was 74.6MB in the beginning and 73.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:39:53,439 INFO L158 Benchmark]: RCFGBuilder took 338.91ms. Allocated memory is still 102.8MB. Free memory was 73.2MB in the beginning and 60.0MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 14:39:53,439 INFO L158 Benchmark]: TraceAbstraction took 4043.76ms. Allocated memory was 102.8MB in the beginning and 148.9MB in the end (delta: 46.1MB). Free memory was 59.3MB in the beginning and 95.5MB in the end (delta: -36.2MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. [2022-02-20 14:39:53,439 INFO L158 Benchmark]: Witness Printer took 53.66ms. Allocated memory is still 148.9MB. Free memory was 95.5MB in the beginning and 92.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 14:39:53,442 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.16ms. Allocated memory is still 102.8MB. Free memory is still 79.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 199.69ms. Allocated memory is still 102.8MB. Free memory was 62.7MB in the beginning and 76.3MB in the end (delta: -13.7MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 23.22ms. Allocated memory is still 102.8MB. Free memory was 76.3MB in the beginning and 74.6MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 35.42ms. Allocated memory is still 102.8MB. Free memory was 74.6MB in the beginning and 73.2MB in the end (delta: 1.4MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 338.91ms. Allocated memory is still 102.8MB. Free memory was 73.2MB in the beginning and 60.0MB in the end (delta: 13.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 4043.76ms. Allocated memory was 102.8MB in the beginning and 148.9MB in the end (delta: 46.1MB). Free memory was 59.3MB in the beginning and 95.5MB in the end (delta: -36.2MB). Peak memory consumption was 8.8MB. Max. memory is 16.1GB. * Witness Printer took 53.66ms. Allocated memory is still 148.9MB. Free memory was 95.5MB in the beginning and 92.4MB in the end (delta: 3.1MB). Peak memory consumption was 4.2MB. 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: 107]: 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, 28 locations, 1 error locations. Started 1 CEGAR loops. OverallTime: 4.0s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 1, EmptinessCheckTime: 0.0s, AutomataDifference: 2.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, PartialOrderReductionTime: 0.0s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 391 SdHoareTripleChecker+Valid, 0.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 391 mSDsluCounter, 1355 SdHoareTripleChecker+Invalid, 0.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 527 mSDsCounter, 16 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 85 IncrementalHoareTripleChecker+Invalid, 101 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 16 mSolverCounterUnsat, 828 mSDtfsCounter, 85 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 48 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=901occurred in iteration=15, InterpolantAutomatonStates: 48, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.6s AutomataMinimizationTime, 16 MinimizatonAttempts, 268 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 4 LocationsWithAnnotation, 4 PreInvPairs, 73 NumberOfFragments, 4 HoareAnnotationTreeSize, 4 FomulaSimplifications, 0 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 4 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.4s InterpolantComputationTime, 250 NumberOfCodeBlocks, 250 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 234 ConstructedInterpolants, 0 QuantifiedInterpolants, 462 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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: 7]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 29]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 6]: 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:39:53,477 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: TRUE