./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/kundu1.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version a4ecdabc Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_fe47e537-7c81-460b-bf9c-cfcc074070a0/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_fe47e537-7c81-460b-bf9c-cfcc074070a0/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_fe47e537-7c81-460b-bf9c-cfcc074070a0/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_fe47e537-7c81-460b-bf9c-cfcc074070a0/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/kundu1.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_fe47e537-7c81-460b-bf9c-cfcc074070a0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_fe47e537-7c81-460b-bf9c-cfcc074070a0/bin/uautomizer --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 296e273b1c19d017b7d3722a7c74d29ba546c812 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.2.0-a4ecdab [2020-11-28 03:01:00,474 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-28 03:01:00,476 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-28 03:01:00,566 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-28 03:01:00,567 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-28 03:01:00,568 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-28 03:01:00,571 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-28 03:01:00,589 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-28 03:01:00,591 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-28 03:01:00,593 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-28 03:01:00,594 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-28 03:01:00,596 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-28 03:01:00,597 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-28 03:01:00,598 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-28 03:01:00,600 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-28 03:01:00,602 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-28 03:01:00,603 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-28 03:01:00,604 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-28 03:01:00,607 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-28 03:01:00,610 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-28 03:01:00,612 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-28 03:01:00,618 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-28 03:01:00,620 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-28 03:01:00,621 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-28 03:01:00,631 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-28 03:01:00,632 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-28 03:01:00,632 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-28 03:01:00,634 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-28 03:01:00,635 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-28 03:01:00,636 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-28 03:01:00,637 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-28 03:01:00,638 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-28 03:01:00,639 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-28 03:01:00,640 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-28 03:01:00,642 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-28 03:01:00,642 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-28 03:01:00,643 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-28 03:01:00,643 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-28 03:01:00,644 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-28 03:01:00,645 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-28 03:01:00,646 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-28 03:01:00,647 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_fe47e537-7c81-460b-bf9c-cfcc074070a0/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-28 03:01:00,676 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-28 03:01:00,676 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-28 03:01:00,678 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-28 03:01:00,678 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-28 03:01:00,678 INFO L138 SettingsManager]: * Use SBE=true [2020-11-28 03:01:00,679 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-28 03:01:00,679 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-28 03:01:00,679 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-28 03:01:00,679 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-28 03:01:00,680 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-28 03:01:00,680 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-28 03:01:00,680 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-28 03:01:00,680 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-28 03:01:00,681 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-28 03:01:00,681 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-28 03:01:00,681 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-28 03:01:00,682 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-28 03:01:00,682 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-28 03:01:00,682 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-28 03:01:00,682 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-28 03:01:00,683 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-28 03:01:00,683 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 03:01:00,683 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-28 03:01:00,684 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-28 03:01:00,684 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-28 03:01:00,684 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-28 03:01:00,684 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-28 03:01:00,685 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-28 03:01:00,685 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-28 03:01:00,685 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:/tmp/vcloud-vcloud-master/worker/run_dir_fe47e537-7c81-460b-bf9c-cfcc074070a0/bin/uautomizer/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 -> /tmp/vcloud-vcloud-master/worker/run_dir_fe47e537-7c81-460b-bf9c-cfcc074070a0/bin/uautomizer 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 -> 296e273b1c19d017b7d3722a7c74d29ba546c812 [2020-11-28 03:01:00,974 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-28 03:01:01,015 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-28 03:01:01,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-28 03:01:01,020 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-28 03:01:01,026 INFO L275 PluginConnector]: CDTParser initialized [2020-11-28 03:01:01,028 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_fe47e537-7c81-460b-bf9c-cfcc074070a0/bin/uautomizer/../../sv-benchmarks/c/systemc/kundu1.cil.c [2020-11-28 03:01:01,144 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fe47e537-7c81-460b-bf9c-cfcc074070a0/bin/uautomizer/data/bddf1d074/739a465a9998497493432c2c6ce6e08b/FLAG86d156602 [2020-11-28 03:01:01,887 INFO L306 CDTParser]: Found 1 translation units. [2020-11-28 03:01:01,887 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_fe47e537-7c81-460b-bf9c-cfcc074070a0/sv-benchmarks/c/systemc/kundu1.cil.c [2020-11-28 03:01:01,907 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_fe47e537-7c81-460b-bf9c-cfcc074070a0/bin/uautomizer/data/bddf1d074/739a465a9998497493432c2c6ce6e08b/FLAG86d156602 [2020-11-28 03:01:02,226 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_fe47e537-7c81-460b-bf9c-cfcc074070a0/bin/uautomizer/data/bddf1d074/739a465a9998497493432c2c6ce6e08b [2020-11-28 03:01:02,229 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-28 03:01:02,239 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-28 03:01:02,242 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-28 03:01:02,242 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-28 03:01:02,245 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-28 03:01:02,246 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:01:02" (1/1) ... [2020-11-28 03:01:02,250 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26773935 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:02, skipping insertion in model container [2020-11-28 03:01:02,251 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 03:01:02" (1/1) ... [2020-11-28 03:01:02,259 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-28 03:01:02,315 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-28 03:01:02,574 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:01:02,583 INFO L203 MainTranslator]: Completed pre-run [2020-11-28 03:01:02,620 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-28 03:01:02,641 INFO L208 MainTranslator]: Completed translation [2020-11-28 03:01:02,641 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:02 WrapperNode [2020-11-28 03:01:02,641 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-28 03:01:02,643 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-28 03:01:02,643 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-28 03:01:02,643 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-28 03:01:02,650 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:02" (1/1) ... [2020-11-28 03:01:02,659 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:02" (1/1) ... [2020-11-28 03:01:02,689 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-28 03:01:02,689 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-28 03:01:02,690 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-28 03:01:02,690 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-28 03:01:02,698 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:02" (1/1) ... [2020-11-28 03:01:02,698 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:02" (1/1) ... [2020-11-28 03:01:02,701 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:02" (1/1) ... [2020-11-28 03:01:02,702 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:02" (1/1) ... [2020-11-28 03:01:02,709 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:02" (1/1) ... [2020-11-28 03:01:02,716 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:02" (1/1) ... [2020-11-28 03:01:02,718 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:02" (1/1) ... [2020-11-28 03:01:02,723 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-28 03:01:02,724 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-28 03:01:02,724 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-28 03:01:02,724 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-28 03:01:02,725 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fe47e537-7c81-460b-bf9c-cfcc074070a0/bin/uautomizer/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-28 03:01:02,828 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-28 03:01:02,829 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-28 03:01:02,829 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-28 03:01:02,830 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-28 03:01:03,732 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-28 03:01:03,733 INFO L298 CfgBuilder]: Removed 78 assume(true) statements. [2020-11-28 03:01:03,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:01:03 BoogieIcfgContainer [2020-11-28 03:01:03,735 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-28 03:01:03,737 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-28 03:01:03,737 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-28 03:01:03,740 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-28 03:01:03,741 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 03:01:02" (1/3) ... [2020-11-28 03:01:03,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d95634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:01:03, skipping insertion in model container [2020-11-28 03:01:03,742 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 03:01:02" (2/3) ... [2020-11-28 03:01:03,742 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43d95634 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 03:01:03, skipping insertion in model container [2020-11-28 03:01:03,743 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:01:03" (3/3) ... [2020-11-28 03:01:03,744 INFO L111 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2020-11-28 03:01:03,756 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-28 03:01:03,761 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2020-11-28 03:01:03,774 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-11-28 03:01:03,801 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-28 03:01:03,801 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-28 03:01:03,802 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-28 03:01:03,802 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-28 03:01:03,802 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-28 03:01:03,802 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-28 03:01:03,802 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-28 03:01:03,802 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-28 03:01:03,829 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2020-11-28 03:01:03,837 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-28 03:01:03,837 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:03,838 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:03,839 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:03,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:03,845 INFO L82 PathProgramCache]: Analyzing trace with hash -1357048476, now seen corresponding path program 1 times [2020-11-28 03:01:03,854 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:03,854 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616285867] [2020-11-28 03:01:03,855 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:03,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:04,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:04,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616285867] [2020-11-28 03:01:04,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:04,028 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:01:04,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [809406338] [2020-11-28 03:01:04,033 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:01:04,033 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:04,049 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:01:04,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:04,052 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 3 states. [2020-11-28 03:01:04,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:04,139 INFO L93 Difference]: Finished difference Result 231 states and 349 transitions. [2020-11-28 03:01:04,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:01:04,141 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-11-28 03:01:04,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:04,163 INFO L225 Difference]: With dead ends: 231 [2020-11-28 03:01:04,163 INFO L226 Difference]: Without dead ends: 112 [2020-11-28 03:01:04,171 INFO L677 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 [2020-11-28 03:01:04,191 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-28 03:01:04,237 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-11-28 03:01:04,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-11-28 03:01:04,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 162 transitions. [2020-11-28 03:01:04,251 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 162 transitions. Word has length 33 [2020-11-28 03:01:04,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:04,252 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 162 transitions. [2020-11-28 03:01:04,252 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:01:04,253 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 162 transitions. [2020-11-28 03:01:04,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-28 03:01:04,257 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:04,257 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:04,258 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-28 03:01:04,259 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:04,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:04,262 INFO L82 PathProgramCache]: Analyzing trace with hash 1551715426, now seen corresponding path program 1 times [2020-11-28 03:01:04,263 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:04,263 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [248708437] [2020-11-28 03:01:04,263 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:04,316 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:04,354 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:04,355 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [248708437] [2020-11-28 03:01:04,355 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:04,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:01:04,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [996735185] [2020-11-28 03:01:04,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:01:04,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:04,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:01:04,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:04,358 INFO L87 Difference]: Start difference. First operand 112 states and 162 transitions. Second operand 3 states. [2020-11-28 03:01:04,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:04,427 INFO L93 Difference]: Finished difference Result 304 states and 439 transitions. [2020-11-28 03:01:04,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:01:04,429 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-11-28 03:01:04,429 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:04,431 INFO L225 Difference]: With dead ends: 304 [2020-11-28 03:01:04,432 INFO L226 Difference]: Without dead ends: 199 [2020-11-28 03:01:04,433 INFO L677 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 [2020-11-28 03:01:04,434 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-11-28 03:01:04,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 189. [2020-11-28 03:01:04,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-11-28 03:01:04,486 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 273 transitions. [2020-11-28 03:01:04,486 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 273 transitions. Word has length 33 [2020-11-28 03:01:04,487 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:04,487 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 273 transitions. [2020-11-28 03:01:04,488 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:01:04,488 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 273 transitions. [2020-11-28 03:01:04,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-28 03:01:04,491 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:04,492 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:04,492 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-28 03:01:04,493 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:04,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:04,494 INFO L82 PathProgramCache]: Analyzing trace with hash -120802205, now seen corresponding path program 1 times [2020-11-28 03:01:04,495 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:04,496 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1748677448] [2020-11-28 03:01:04,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:04,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:04,712 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:04,712 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1748677448] [2020-11-28 03:01:04,712 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:04,712 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:01:04,713 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [969702283] [2020-11-28 03:01:04,713 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:01:04,713 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:04,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:01:04,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:01:04,714 INFO L87 Difference]: Start difference. First operand 189 states and 273 transitions. Second operand 5 states. [2020-11-28 03:01:04,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:04,873 INFO L93 Difference]: Finished difference Result 591 states and 861 transitions. [2020-11-28 03:01:04,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:01:04,874 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-11-28 03:01:04,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:04,880 INFO L225 Difference]: With dead ends: 591 [2020-11-28 03:01:04,880 INFO L226 Difference]: Without dead ends: 413 [2020-11-28 03:01:04,887 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:01:04,889 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2020-11-28 03:01:04,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 195. [2020-11-28 03:01:04,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-11-28 03:01:04,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 276 transitions. [2020-11-28 03:01:04,941 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 276 transitions. Word has length 33 [2020-11-28 03:01:04,942 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:04,942 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 276 transitions. [2020-11-28 03:01:04,942 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:01:04,942 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 276 transitions. [2020-11-28 03:01:04,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-28 03:01:04,948 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:04,948 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:04,949 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-28 03:01:04,949 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:04,951 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:04,951 INFO L82 PathProgramCache]: Analyzing trace with hash -1926240539, now seen corresponding path program 1 times [2020-11-28 03:01:04,951 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:04,952 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1000064823] [2020-11-28 03:01:04,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:04,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:05,026 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:05,026 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1000064823] [2020-11-28 03:01:05,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:05,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:01:05,027 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703666058] [2020-11-28 03:01:05,027 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:01:05,027 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:05,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:01:05,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:01:05,028 INFO L87 Difference]: Start difference. First operand 195 states and 276 transitions. Second operand 4 states. [2020-11-28 03:01:05,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:05,191 INFO L93 Difference]: Finished difference Result 621 states and 872 transitions. [2020-11-28 03:01:05,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:01:05,192 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-11-28 03:01:05,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:05,195 INFO L225 Difference]: With dead ends: 621 [2020-11-28 03:01:05,195 INFO L226 Difference]: Without dead ends: 439 [2020-11-28 03:01:05,196 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:01:05,197 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-11-28 03:01:05,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 333. [2020-11-28 03:01:05,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2020-11-28 03:01:05,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 464 transitions. [2020-11-28 03:01:05,228 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 464 transitions. Word has length 33 [2020-11-28 03:01:05,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:05,228 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 464 transitions. [2020-11-28 03:01:05,229 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:01:05,229 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 464 transitions. [2020-11-28 03:01:05,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-28 03:01:05,230 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:05,231 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:05,231 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-28 03:01:05,231 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:05,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:05,232 INFO L82 PathProgramCache]: Analyzing trace with hash -1179728243, now seen corresponding path program 1 times [2020-11-28 03:01:05,233 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:05,233 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2103871281] [2020-11-28 03:01:05,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:05,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:05,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:05,327 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2103871281] [2020-11-28 03:01:05,328 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:05,328 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:01:05,328 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1675951623] [2020-11-28 03:01:05,328 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:01:05,329 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:05,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:01:05,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:01:05,329 INFO L87 Difference]: Start difference. First operand 333 states and 464 transitions. Second operand 5 states. [2020-11-28 03:01:05,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:05,516 INFO L93 Difference]: Finished difference Result 1126 states and 1579 transitions. [2020-11-28 03:01:05,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-28 03:01:05,517 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-11-28 03:01:05,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:05,523 INFO L225 Difference]: With dead ends: 1126 [2020-11-28 03:01:05,523 INFO L226 Difference]: Without dead ends: 812 [2020-11-28 03:01:05,524 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:01:05,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-11-28 03:01:05,561 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 360. [2020-11-28 03:01:05,561 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2020-11-28 03:01:05,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 491 transitions. [2020-11-28 03:01:05,563 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 491 transitions. Word has length 34 [2020-11-28 03:01:05,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:05,564 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 491 transitions. [2020-11-28 03:01:05,564 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:01:05,564 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 491 transitions. [2020-11-28 03:01:05,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-28 03:01:05,565 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:05,565 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:05,565 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-28 03:01:05,566 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:05,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:05,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1526891151, now seen corresponding path program 1 times [2020-11-28 03:01:05,567 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:05,567 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403578153] [2020-11-28 03:01:05,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:05,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:05,634 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:05,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403578153] [2020-11-28 03:01:05,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:05,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:01:05,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [391218700] [2020-11-28 03:01:05,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:01:05,635 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:05,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:01:05,636 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:01:05,636 INFO L87 Difference]: Start difference. First operand 360 states and 491 transitions. Second operand 4 states. [2020-11-28 03:01:05,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:05,808 INFO L93 Difference]: Finished difference Result 1662 states and 2286 transitions. [2020-11-28 03:01:05,809 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:01:05,809 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2020-11-28 03:01:05,809 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:05,817 INFO L225 Difference]: With dead ends: 1662 [2020-11-28 03:01:05,817 INFO L226 Difference]: Without dead ends: 1324 [2020-11-28 03:01:05,818 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:01:05,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2020-11-28 03:01:05,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 674. [2020-11-28 03:01:05,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2020-11-28 03:01:05,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 923 transitions. [2020-11-28 03:01:05,923 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 923 transitions. Word has length 34 [2020-11-28 03:01:05,926 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:05,928 INFO L481 AbstractCegarLoop]: Abstraction has 674 states and 923 transitions. [2020-11-28 03:01:05,929 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:01:05,929 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 923 transitions. [2020-11-28 03:01:05,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-28 03:01:05,930 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:05,930 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:05,930 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-28 03:01:05,930 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:05,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:05,931 INFO L82 PathProgramCache]: Analyzing trace with hash 678817943, now seen corresponding path program 1 times [2020-11-28 03:01:05,931 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:05,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1344185052] [2020-11-28 03:01:05,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:05,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:06,033 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:06,034 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1344185052] [2020-11-28 03:01:06,034 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:06,034 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:01:06,034 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888218972] [2020-11-28 03:01:06,035 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:01:06,035 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:06,035 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:01:06,036 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:01:06,036 INFO L87 Difference]: Start difference. First operand 674 states and 923 transitions. Second operand 5 states. [2020-11-28 03:01:06,202 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:06,202 INFO L93 Difference]: Finished difference Result 1497 states and 2054 transitions. [2020-11-28 03:01:06,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:01:06,203 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-11-28 03:01:06,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:06,208 INFO L225 Difference]: With dead ends: 1497 [2020-11-28 03:01:06,209 INFO L226 Difference]: Without dead ends: 845 [2020-11-28 03:01:06,210 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:01:06,212 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2020-11-28 03:01:06,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 837. [2020-11-28 03:01:06,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2020-11-28 03:01:06,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1144 transitions. [2020-11-28 03:01:06,290 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1144 transitions. Word has length 41 [2020-11-28 03:01:06,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:06,290 INFO L481 AbstractCegarLoop]: Abstraction has 837 states and 1144 transitions. [2020-11-28 03:01:06,291 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:01:06,291 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1144 transitions. [2020-11-28 03:01:06,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-28 03:01:06,292 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:06,293 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:06,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-28 03:01:06,293 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:06,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:06,294 INFO L82 PathProgramCache]: Analyzing trace with hash 1967171351, now seen corresponding path program 1 times [2020-11-28 03:01:06,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:06,295 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091483113] [2020-11-28 03:01:06,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:06,430 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:06,431 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091483113] [2020-11-28 03:01:06,431 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:06,431 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-28 03:01:06,431 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610791703] [2020-11-28 03:01:06,433 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-28 03:01:06,434 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:06,434 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-28 03:01:06,435 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:01:06,436 INFO L87 Difference]: Start difference. First operand 837 states and 1144 transitions. Second operand 6 states. [2020-11-28 03:01:06,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:06,842 INFO L93 Difference]: Finished difference Result 3287 states and 4502 transitions. [2020-11-28 03:01:06,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-28 03:01:06,843 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2020-11-28 03:01:06,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:06,859 INFO L225 Difference]: With dead ends: 3287 [2020-11-28 03:01:06,860 INFO L226 Difference]: Without dead ends: 2472 [2020-11-28 03:01:06,862 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2020-11-28 03:01:06,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2020-11-28 03:01:07,057 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 1321. [2020-11-28 03:01:07,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2020-11-28 03:01:07,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1806 transitions. [2020-11-28 03:01:07,065 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1806 transitions. Word has length 44 [2020-11-28 03:01:07,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:07,065 INFO L481 AbstractCegarLoop]: Abstraction has 1321 states and 1806 transitions. [2020-11-28 03:01:07,065 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-28 03:01:07,065 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1806 transitions. [2020-11-28 03:01:07,066 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-28 03:01:07,066 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:07,067 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:07,067 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-28 03:01:07,067 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:07,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:07,068 INFO L82 PathProgramCache]: Analyzing trace with hash -477389262, now seen corresponding path program 1 times [2020-11-28 03:01:07,068 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:07,068 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194413086] [2020-11-28 03:01:07,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:07,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:07,114 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-28 03:01:07,115 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194413086] [2020-11-28 03:01:07,115 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:07,115 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:01:07,116 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701895291] [2020-11-28 03:01:07,117 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:01:07,118 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:07,118 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:01:07,118 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:07,119 INFO L87 Difference]: Start difference. First operand 1321 states and 1806 transitions. Second operand 3 states. [2020-11-28 03:01:07,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:07,460 INFO L93 Difference]: Finished difference Result 3798 states and 5147 transitions. [2020-11-28 03:01:07,460 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:01:07,461 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-11-28 03:01:07,461 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:07,476 INFO L225 Difference]: With dead ends: 3798 [2020-11-28 03:01:07,476 INFO L226 Difference]: Without dead ends: 2499 [2020-11-28 03:01:07,482 INFO L677 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 [2020-11-28 03:01:07,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2020-11-28 03:01:07,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2495. [2020-11-28 03:01:07,714 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2495 states. [2020-11-28 03:01:07,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 3301 transitions. [2020-11-28 03:01:07,725 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 3301 transitions. Word has length 46 [2020-11-28 03:01:07,726 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:07,726 INFO L481 AbstractCegarLoop]: Abstraction has 2495 states and 3301 transitions. [2020-11-28 03:01:07,726 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:01:07,726 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 3301 transitions. [2020-11-28 03:01:07,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-28 03:01:07,727 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:07,727 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:07,728 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-28 03:01:07,728 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:07,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:07,728 INFO L82 PathProgramCache]: Analyzing trace with hash -162601451, now seen corresponding path program 1 times [2020-11-28 03:01:07,729 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:07,729 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992673894] [2020-11-28 03:01:07,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:07,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:07,799 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:07,799 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992673894] [2020-11-28 03:01:07,799 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:07,799 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:01:07,800 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368638513] [2020-11-28 03:01:07,800 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:01:07,800 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:07,801 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:01:07,801 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:07,801 INFO L87 Difference]: Start difference. First operand 2495 states and 3301 transitions. Second operand 3 states. [2020-11-28 03:01:08,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:08,289 INFO L93 Difference]: Finished difference Result 7169 states and 9443 transitions. [2020-11-28 03:01:08,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:01:08,290 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-11-28 03:01:08,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:08,316 INFO L225 Difference]: With dead ends: 7169 [2020-11-28 03:01:08,316 INFO L226 Difference]: Without dead ends: 4714 [2020-11-28 03:01:08,321 INFO L677 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 [2020-11-28 03:01:08,329 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4714 states. [2020-11-28 03:01:08,819 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4714 to 4712. [2020-11-28 03:01:08,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4712 states. [2020-11-28 03:01:08,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4712 states to 4712 states and 6108 transitions. [2020-11-28 03:01:08,837 INFO L78 Accepts]: Start accepts. Automaton has 4712 states and 6108 transitions. Word has length 48 [2020-11-28 03:01:08,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:08,837 INFO L481 AbstractCegarLoop]: Abstraction has 4712 states and 6108 transitions. [2020-11-28 03:01:08,838 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:01:08,838 INFO L276 IsEmpty]: Start isEmpty. Operand 4712 states and 6108 transitions. [2020-11-28 03:01:08,839 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-28 03:01:08,839 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:08,839 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:08,839 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-28 03:01:08,840 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:08,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:08,841 INFO L82 PathProgramCache]: Analyzing trace with hash 297274720, now seen corresponding path program 1 times [2020-11-28 03:01:08,842 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:08,842 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88986563] [2020-11-28 03:01:08,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:08,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:08,914 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:08,914 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88986563] [2020-11-28 03:01:08,915 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:08,915 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:01:08,915 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [394446958] [2020-11-28 03:01:08,915 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:01:08,916 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:08,916 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:01:08,916 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:01:08,916 INFO L87 Difference]: Start difference. First operand 4712 states and 6108 transitions. Second operand 4 states. [2020-11-28 03:01:09,614 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:09,614 INFO L93 Difference]: Finished difference Result 11359 states and 14646 transitions. [2020-11-28 03:01:09,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:01:09,615 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2020-11-28 03:01:09,616 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:09,660 INFO L225 Difference]: With dead ends: 11359 [2020-11-28 03:01:09,660 INFO L226 Difference]: Without dead ends: 6671 [2020-11-28 03:01:09,667 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:01:09,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6671 states. [2020-11-28 03:01:10,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6671 to 5850. [2020-11-28 03:01:10,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5850 states. [2020-11-28 03:01:10,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 7394 transitions. [2020-11-28 03:01:10,261 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 7394 transitions. Word has length 48 [2020-11-28 03:01:10,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:10,261 INFO L481 AbstractCegarLoop]: Abstraction has 5850 states and 7394 transitions. [2020-11-28 03:01:10,262 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:01:10,262 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 7394 transitions. [2020-11-28 03:01:10,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-28 03:01:10,263 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:10,263 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:10,263 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-28 03:01:10,264 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:10,264 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:10,264 INFO L82 PathProgramCache]: Analyzing trace with hash -2096931086, now seen corresponding path program 1 times [2020-11-28 03:01:10,265 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:10,265 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1819167003] [2020-11-28 03:01:10,265 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:10,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:10,301 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:10,301 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1819167003] [2020-11-28 03:01:10,301 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:10,301 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:01:10,302 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572243663] [2020-11-28 03:01:10,302 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-28 03:01:10,302 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:10,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-28 03:01:10,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-28 03:01:10,303 INFO L87 Difference]: Start difference. First operand 5850 states and 7394 transitions. Second operand 4 states. [2020-11-28 03:01:10,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:10,835 INFO L93 Difference]: Finished difference Result 10947 states and 13872 transitions. [2020-11-28 03:01:10,836 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:01:10,836 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2020-11-28 03:01:10,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:10,863 INFO L225 Difference]: With dead ends: 10947 [2020-11-28 03:01:10,863 INFO L226 Difference]: Without dead ends: 5013 [2020-11-28 03:01:10,870 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:01:10,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5013 states. [2020-11-28 03:01:11,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5013 to 4814. [2020-11-28 03:01:11,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4814 states. [2020-11-28 03:01:11,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4814 states to 4814 states and 5985 transitions. [2020-11-28 03:01:11,288 INFO L78 Accepts]: Start accepts. Automaton has 4814 states and 5985 transitions. Word has length 49 [2020-11-28 03:01:11,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:11,288 INFO L481 AbstractCegarLoop]: Abstraction has 4814 states and 5985 transitions. [2020-11-28 03:01:11,288 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-28 03:01:11,288 INFO L276 IsEmpty]: Start isEmpty. Operand 4814 states and 5985 transitions. [2020-11-28 03:01:11,292 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-11-28 03:01:11,292 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:11,292 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:11,293 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-28 03:01:11,293 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:11,293 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:11,293 INFO L82 PathProgramCache]: Analyzing trace with hash 358168785, now seen corresponding path program 1 times [2020-11-28 03:01:11,294 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:11,294 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1215824798] [2020-11-28 03:01:11,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:11,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:11,340 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-11-28 03:01:11,340 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1215824798] [2020-11-28 03:01:11,340 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:11,340 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:01:11,341 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018052325] [2020-11-28 03:01:11,341 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:01:11,341 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:11,342 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:01:11,342 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:01:11,342 INFO L87 Difference]: Start difference. First operand 4814 states and 5985 transitions. Second operand 5 states. [2020-11-28 03:01:11,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:11,700 INFO L93 Difference]: Finished difference Result 8526 states and 10629 transitions. [2020-11-28 03:01:11,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:01:11,700 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2020-11-28 03:01:11,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:11,720 INFO L225 Difference]: With dead ends: 8526 [2020-11-28 03:01:11,721 INFO L226 Difference]: Without dead ends: 3744 [2020-11-28 03:01:11,726 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2020-11-28 03:01:11,731 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3744 states. [2020-11-28 03:01:12,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3744 to 3233. [2020-11-28 03:01:12,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3233 states. [2020-11-28 03:01:12,039 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3233 states to 3233 states and 4035 transitions. [2020-11-28 03:01:12,039 INFO L78 Accepts]: Start accepts. Automaton has 3233 states and 4035 transitions. Word has length 83 [2020-11-28 03:01:12,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:12,039 INFO L481 AbstractCegarLoop]: Abstraction has 3233 states and 4035 transitions. [2020-11-28 03:01:12,039 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:01:12,040 INFO L276 IsEmpty]: Start isEmpty. Operand 3233 states and 4035 transitions. [2020-11-28 03:01:12,048 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-11-28 03:01:12,048 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:12,048 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:12,048 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-28 03:01:12,048 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:12,049 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:12,049 INFO L82 PathProgramCache]: Analyzing trace with hash -1417804680, now seen corresponding path program 1 times [2020-11-28 03:01:12,049 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:12,051 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463467398] [2020-11-28 03:01:12,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:12,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:12,087 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-11-28 03:01:12,090 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463467398] [2020-11-28 03:01:12,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:12,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:01:12,091 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538622772] [2020-11-28 03:01:12,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:01:12,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:12,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:01:12,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:12,092 INFO L87 Difference]: Start difference. First operand 3233 states and 4035 transitions. Second operand 3 states. [2020-11-28 03:01:12,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:12,358 INFO L93 Difference]: Finished difference Result 3481 states and 4330 transitions. [2020-11-28 03:01:12,358 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:01:12,358 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-11-28 03:01:12,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:12,366 INFO L225 Difference]: With dead ends: 3481 [2020-11-28 03:01:12,366 INFO L226 Difference]: Without dead ends: 3217 [2020-11-28 03:01:12,368 INFO L677 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 [2020-11-28 03:01:12,372 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3217 states. [2020-11-28 03:01:12,653 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3217 to 3217. [2020-11-28 03:01:12,654 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3217 states. [2020-11-28 03:01:12,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 4018 transitions. [2020-11-28 03:01:12,659 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 4018 transitions. Word has length 86 [2020-11-28 03:01:12,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:12,660 INFO L481 AbstractCegarLoop]: Abstraction has 3217 states and 4018 transitions. [2020-11-28 03:01:12,660 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:01:12,660 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 4018 transitions. [2020-11-28 03:01:12,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-28 03:01:12,663 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:12,663 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:12,663 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-28 03:01:12,663 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:12,664 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:12,664 INFO L82 PathProgramCache]: Analyzing trace with hash -402537650, now seen corresponding path program 1 times [2020-11-28 03:01:12,664 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:12,664 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [252918816] [2020-11-28 03:01:12,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:12,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:12,731 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-28 03:01:12,732 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [252918816] [2020-11-28 03:01:12,732 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:12,732 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:01:12,732 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918913664] [2020-11-28 03:01:12,733 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:01:12,733 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:12,733 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:01:12,734 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:12,734 INFO L87 Difference]: Start difference. First operand 3217 states and 4018 transitions. Second operand 3 states. [2020-11-28 03:01:12,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:12,919 INFO L93 Difference]: Finished difference Result 3591 states and 4462 transitions. [2020-11-28 03:01:12,920 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:01:12,920 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2020-11-28 03:01:12,920 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:12,925 INFO L225 Difference]: With dead ends: 3591 [2020-11-28 03:01:12,925 INFO L226 Difference]: Without dead ends: 3202 [2020-11-28 03:01:12,927 INFO L677 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 [2020-11-28 03:01:12,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3202 states. [2020-11-28 03:01:13,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3202 to 3195. [2020-11-28 03:01:13,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3195 states. [2020-11-28 03:01:13,148 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3195 states to 3195 states and 3992 transitions. [2020-11-28 03:01:13,148 INFO L78 Accepts]: Start accepts. Automaton has 3195 states and 3992 transitions. Word has length 89 [2020-11-28 03:01:13,149 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:13,149 INFO L481 AbstractCegarLoop]: Abstraction has 3195 states and 3992 transitions. [2020-11-28 03:01:13,149 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:01:13,149 INFO L276 IsEmpty]: Start isEmpty. Operand 3195 states and 3992 transitions. [2020-11-28 03:01:13,152 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-11-28 03:01:13,152 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:13,152 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:13,152 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-28 03:01:13,152 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:13,152 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:13,153 INFO L82 PathProgramCache]: Analyzing trace with hash 1336538508, now seen corresponding path program 1 times [2020-11-28 03:01:13,153 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:13,153 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330996744] [2020-11-28 03:01:13,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:13,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:13,240 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-28 03:01:13,241 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330996744] [2020-11-28 03:01:13,243 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:13,243 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:01:13,243 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55186061] [2020-11-28 03:01:13,244 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:01:13,244 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:13,244 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:01:13,244 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:01:13,244 INFO L87 Difference]: Start difference. First operand 3195 states and 3992 transitions. Second operand 5 states. [2020-11-28 03:01:13,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:13,624 INFO L93 Difference]: Finished difference Result 6859 states and 8520 transitions. [2020-11-28 03:01:13,624 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:01:13,624 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2020-11-28 03:01:13,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:13,632 INFO L225 Difference]: With dead ends: 6859 [2020-11-28 03:01:13,632 INFO L226 Difference]: Without dead ends: 3724 [2020-11-28 03:01:13,637 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:01:13,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2020-11-28 03:01:13,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3073. [2020-11-28 03:01:13,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2020-11-28 03:01:13,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 3805 transitions. [2020-11-28 03:01:13,831 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 3805 transitions. Word has length 95 [2020-11-28 03:01:13,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:13,832 INFO L481 AbstractCegarLoop]: Abstraction has 3073 states and 3805 transitions. [2020-11-28 03:01:13,832 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:01:13,832 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 3805 transitions. [2020-11-28 03:01:13,835 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-11-28 03:01:13,835 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:13,835 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:13,836 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-28 03:01:13,836 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:13,836 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:13,836 INFO L82 PathProgramCache]: Analyzing trace with hash 126172792, now seen corresponding path program 1 times [2020-11-28 03:01:13,836 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:13,837 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1468577257] [2020-11-28 03:01:13,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:13,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:13,912 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-11-28 03:01:13,912 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1468577257] [2020-11-28 03:01:13,913 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:13,913 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:01:13,913 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [853082085] [2020-11-28 03:01:13,914 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:01:13,914 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:13,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:01:13,915 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:01:13,915 INFO L87 Difference]: Start difference. First operand 3073 states and 3805 transitions. Second operand 5 states. [2020-11-28 03:01:14,167 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:14,167 INFO L93 Difference]: Finished difference Result 5583 states and 6899 transitions. [2020-11-28 03:01:14,168 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-28 03:01:14,168 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2020-11-28 03:01:14,168 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:14,172 INFO L225 Difference]: With dead ends: 5583 [2020-11-28 03:01:14,172 INFO L226 Difference]: Without dead ends: 2208 [2020-11-28 03:01:14,177 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:01:14,180 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2020-11-28 03:01:14,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 2050. [2020-11-28 03:01:14,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2050 states. [2020-11-28 03:01:14,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 2515 transitions. [2020-11-28 03:01:14,368 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 2515 transitions. Word has length 98 [2020-11-28 03:01:14,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:14,368 INFO L481 AbstractCegarLoop]: Abstraction has 2050 states and 2515 transitions. [2020-11-28 03:01:14,369 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:01:14,369 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 2515 transitions. [2020-11-28 03:01:14,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-11-28 03:01:14,371 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:14,371 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:14,371 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-28 03:01:14,371 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:14,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:14,372 INFO L82 PathProgramCache]: Analyzing trace with hash -1098481666, now seen corresponding path program 1 times [2020-11-28 03:01:14,372 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:14,373 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1044427970] [2020-11-28 03:01:14,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:14,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:14,417 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:14,417 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1044427970] [2020-11-28 03:01:14,417 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:14,417 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:01:14,417 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1402878421] [2020-11-28 03:01:14,419 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:01:14,419 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:14,420 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:01:14,422 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:14,422 INFO L87 Difference]: Start difference. First operand 2050 states and 2515 transitions. Second operand 3 states. [2020-11-28 03:01:14,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:14,575 INFO L93 Difference]: Finished difference Result 3786 states and 4676 transitions. [2020-11-28 03:01:14,576 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:01:14,576 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2020-11-28 03:01:14,576 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:14,579 INFO L225 Difference]: With dead ends: 3786 [2020-11-28 03:01:14,579 INFO L226 Difference]: Without dead ends: 1796 [2020-11-28 03:01:14,582 INFO L677 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 [2020-11-28 03:01:14,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2020-11-28 03:01:14,721 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1793. [2020-11-28 03:01:14,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1793 states. [2020-11-28 03:01:14,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2167 transitions. [2020-11-28 03:01:14,724 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2167 transitions. Word has length 111 [2020-11-28 03:01:14,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:14,725 INFO L481 AbstractCegarLoop]: Abstraction has 1793 states and 2167 transitions. [2020-11-28 03:01:14,725 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:01:14,725 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2167 transitions. [2020-11-28 03:01:14,727 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-11-28 03:01:14,727 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:14,727 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:14,727 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-28 03:01:14,728 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:14,728 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:14,728 INFO L82 PathProgramCache]: Analyzing trace with hash -1656411785, now seen corresponding path program 1 times [2020-11-28 03:01:14,728 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:14,730 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [60934338] [2020-11-28 03:01:14,730 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:14,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:14,807 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-28 03:01:14,808 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [60934338] [2020-11-28 03:01:14,808 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:14,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-28 03:01:14,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038772194] [2020-11-28 03:01:14,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:01:14,810 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:14,812 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:01:14,812 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:01:14,812 INFO L87 Difference]: Start difference. First operand 1793 states and 2167 transitions. Second operand 5 states. [2020-11-28 03:01:14,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:14,997 INFO L93 Difference]: Finished difference Result 3489 states and 4203 transitions. [2020-11-28 03:01:14,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-28 03:01:14,997 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2020-11-28 03:01:14,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:15,001 INFO L225 Difference]: With dead ends: 3489 [2020-11-28 03:01:15,001 INFO L226 Difference]: Without dead ends: 1757 [2020-11-28 03:01:15,004 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2020-11-28 03:01:15,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2020-11-28 03:01:15,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1618. [2020-11-28 03:01:15,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2020-11-28 03:01:15,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 1932 transitions. [2020-11-28 03:01:15,199 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 1932 transitions. Word has length 113 [2020-11-28 03:01:15,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:15,200 INFO L481 AbstractCegarLoop]: Abstraction has 1618 states and 1932 transitions. [2020-11-28 03:01:15,200 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:01:15,200 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 1932 transitions. [2020-11-28 03:01:15,202 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-11-28 03:01:15,203 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:15,203 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:15,203 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-28 03:01:15,203 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:15,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:15,204 INFO L82 PathProgramCache]: Analyzing trace with hash -1864761928, now seen corresponding path program 1 times [2020-11-28 03:01:15,204 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:15,204 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [488929345] [2020-11-28 03:01:15,205 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:15,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:15,292 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-11-28 03:01:15,292 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [488929345] [2020-11-28 03:01:15,292 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:15,292 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:01:15,293 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1528637423] [2020-11-28 03:01:15,293 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:01:15,293 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:15,294 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:01:15,294 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:15,294 INFO L87 Difference]: Start difference. First operand 1618 states and 1932 transitions. Second operand 3 states. [2020-11-28 03:01:15,519 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:15,519 INFO L93 Difference]: Finished difference Result 3212 states and 3849 transitions. [2020-11-28 03:01:15,520 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:01:15,520 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2020-11-28 03:01:15,520 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:15,524 INFO L225 Difference]: With dead ends: 3212 [2020-11-28 03:01:15,524 INFO L226 Difference]: Without dead ends: 1655 [2020-11-28 03:01:15,527 INFO L677 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 [2020-11-28 03:01:15,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2020-11-28 03:01:15,703 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1646. [2020-11-28 03:01:15,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2020-11-28 03:01:15,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 1934 transitions. [2020-11-28 03:01:15,707 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 1934 transitions. Word has length 113 [2020-11-28 03:01:15,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:15,708 INFO L481 AbstractCegarLoop]: Abstraction has 1646 states and 1934 transitions. [2020-11-28 03:01:15,708 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:01:15,708 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 1934 transitions. [2020-11-28 03:01:15,710 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-11-28 03:01:15,711 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:15,711 INFO L422 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:15,711 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-28 03:01:15,711 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:15,712 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:15,712 INFO L82 PathProgramCache]: Analyzing trace with hash -1931636839, now seen corresponding path program 1 times [2020-11-28 03:01:15,712 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:15,712 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463619548] [2020-11-28 03:01:15,713 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:15,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-28 03:01:15,807 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463619548] [2020-11-28 03:01:15,807 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:15,808 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-28 03:01:15,808 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1424690899] [2020-11-28 03:01:15,809 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:01:15,809 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:15,809 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:01:15,809 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:01:15,810 INFO L87 Difference]: Start difference. First operand 1646 states and 1934 transitions. Second operand 5 states. [2020-11-28 03:01:16,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:16,207 INFO L93 Difference]: Finished difference Result 4611 states and 5427 transitions. [2020-11-28 03:01:16,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-28 03:01:16,208 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2020-11-28 03:01:16,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:16,216 INFO L225 Difference]: With dead ends: 4611 [2020-11-28 03:01:16,216 INFO L226 Difference]: Without dead ends: 3026 [2020-11-28 03:01:16,219 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2020-11-28 03:01:16,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3026 states. [2020-11-28 03:01:16,381 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3026 to 1648. [2020-11-28 03:01:16,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1648 states. [2020-11-28 03:01:16,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 1932 transitions. [2020-11-28 03:01:16,383 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 1932 transitions. Word has length 114 [2020-11-28 03:01:16,384 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:16,384 INFO L481 AbstractCegarLoop]: Abstraction has 1648 states and 1932 transitions. [2020-11-28 03:01:16,384 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:01:16,384 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 1932 transitions. [2020-11-28 03:01:16,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-11-28 03:01:16,386 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:16,387 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:16,387 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-28 03:01:16,387 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:16,387 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:16,387 INFO L82 PathProgramCache]: Analyzing trace with hash 163305011, now seen corresponding path program 1 times [2020-11-28 03:01:16,388 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:16,388 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2122887822] [2020-11-28 03:01:16,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:16,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:16,443 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-11-28 03:01:16,444 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2122887822] [2020-11-28 03:01:16,444 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-28 03:01:16,444 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-28 03:01:16,444 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182906493] [2020-11-28 03:01:16,444 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-28 03:01:16,445 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:16,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-28 03:01:16,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-28 03:01:16,445 INFO L87 Difference]: Start difference. First operand 1648 states and 1932 transitions. Second operand 3 states. [2020-11-28 03:01:16,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:16,622 INFO L93 Difference]: Finished difference Result 2927 states and 3440 transitions. [2020-11-28 03:01:16,623 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-28 03:01:16,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2020-11-28 03:01:16,624 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:16,626 INFO L225 Difference]: With dead ends: 2927 [2020-11-28 03:01:16,626 INFO L226 Difference]: Without dead ends: 1340 [2020-11-28 03:01:16,628 INFO L677 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 [2020-11-28 03:01:16,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2020-11-28 03:01:16,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1232. [2020-11-28 03:01:16,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2020-11-28 03:01:16,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1430 transitions. [2020-11-28 03:01:16,750 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1430 transitions. Word has length 116 [2020-11-28 03:01:16,750 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:16,751 INFO L481 AbstractCegarLoop]: Abstraction has 1232 states and 1430 transitions. [2020-11-28 03:01:16,751 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-28 03:01:16,751 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1430 transitions. [2020-11-28 03:01:16,753 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-11-28 03:01:16,753 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:16,753 INFO L422 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:16,753 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-28 03:01:16,754 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:16,754 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:16,754 INFO L82 PathProgramCache]: Analyzing trace with hash -641278560, now seen corresponding path program 1 times [2020-11-28 03:01:16,754 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:16,755 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [924001815] [2020-11-28 03:01:16,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:16,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:16,893 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-28 03:01:16,893 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [924001815] [2020-11-28 03:01:16,894 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848607930] [2020-11-28 03:01:16,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_fe47e537-7c81-460b-bf9c-cfcc074070a0/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-11-28 03:01:17,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-28 03:01:17,046 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-28 03:01:17,065 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-28 03:01:17,185 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-11-28 03:01:17,185 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-28 03:01:17,185 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-11-28 03:01:17,187 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063872549] [2020-11-28 03:01:17,188 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-28 03:01:17,188 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-28 03:01:17,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-28 03:01:17,190 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-28 03:01:17,190 INFO L87 Difference]: Start difference. First operand 1232 states and 1430 transitions. Second operand 5 states. [2020-11-28 03:01:17,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-28 03:01:17,650 INFO L93 Difference]: Finished difference Result 2927 states and 3398 transitions. [2020-11-28 03:01:17,650 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-28 03:01:17,650 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2020-11-28 03:01:17,651 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-28 03:01:17,654 INFO L225 Difference]: With dead ends: 2927 [2020-11-28 03:01:17,655 INFO L226 Difference]: Without dead ends: 2134 [2020-11-28 03:01:17,664 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-28 03:01:17,667 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2020-11-28 03:01:17,835 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 1347. [2020-11-28 03:01:17,835 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2020-11-28 03:01:17,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1557 transitions. [2020-11-28 03:01:17,838 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1557 transitions. Word has length 118 [2020-11-28 03:01:17,838 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-28 03:01:17,838 INFO L481 AbstractCegarLoop]: Abstraction has 1347 states and 1557 transitions. [2020-11-28 03:01:17,839 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-28 03:01:17,839 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1557 transitions. [2020-11-28 03:01:17,842 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-11-28 03:01:17,842 INFO L414 BasicCegarLoop]: Found error trace [2020-11-28 03:01:17,843 INFO L422 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 4, 4, 4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-11-28 03:01:18,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-11-28 03:01:18,064 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-28 03:01:18,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-28 03:01:18,065 INFO L82 PathProgramCache]: Analyzing trace with hash -361097061, now seen corresponding path program 1 times [2020-11-28 03:01:18,065 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-28 03:01:18,065 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190818540] [2020-11-28 03:01:18,065 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-28 03:01:18,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:01:18,096 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:01:18,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-28 03:01:18,121 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-28 03:01:18,207 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-28 03:01:18,208 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-28 03:01:18,208 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-28 03:01:18,410 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 03:01:18 BoogieIcfgContainer [2020-11-28 03:01:18,410 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-28 03:01:18,410 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-28 03:01:18,411 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-28 03:01:18,411 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-28 03:01:18,411 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 03:01:03" (3/4) ... [2020-11-28 03:01:18,413 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-28 03:01:18,641 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_fe47e537-7c81-460b-bf9c-cfcc074070a0/bin/uautomizer/witness.graphml [2020-11-28 03:01:18,641 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-28 03:01:18,643 INFO L168 Benchmark]: Toolchain (without parser) took 16411.73 ms. Allocated memory was 90.2 MB in the beginning and 1.1 GB in the end (delta: 968.9 MB). Free memory was 58.1 MB in the beginning and 560.4 MB in the end (delta: -502.3 MB). Peak memory consumption was 468.3 MB. Max. memory is 16.1 GB. [2020-11-28 03:01:18,644 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 90.2 MB. Free memory was 48.0 MB in the beginning and 48.0 MB in the end (delta: 35.0 kB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-28 03:01:18,645 INFO L168 Benchmark]: CACSL2BoogieTranslator took 400.17 ms. Allocated memory was 90.2 MB in the beginning and 144.7 MB in the end (delta: 54.5 MB). Free memory was 58.1 MB in the beginning and 118.5 MB in the end (delta: -60.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-11-28 03:01:18,645 INFO L168 Benchmark]: Boogie Procedure Inliner took 46.28 ms. Allocated memory is still 144.7 MB. Free memory was 118.5 MB in the beginning and 116.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:01:18,645 INFO L168 Benchmark]: Boogie Preprocessor took 33.62 ms. Allocated memory is still 144.7 MB. Free memory was 116.4 MB in the beginning and 114.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. [2020-11-28 03:01:18,646 INFO L168 Benchmark]: RCFGBuilder took 1011.20 ms. Allocated memory is still 144.7 MB. Free memory was 114.3 MB in the beginning and 80.8 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.1 GB. [2020-11-28 03:01:18,646 INFO L168 Benchmark]: TraceAbstraction took 14673.48 ms. Allocated memory was 144.7 MB in the beginning and 1.1 GB in the end (delta: 914.4 MB). Free memory was 79.9 MB in the beginning and 588.8 MB in the end (delta: -508.9 MB). Peak memory consumption was 408.2 MB. Max. memory is 16.1 GB. [2020-11-28 03:01:18,647 INFO L168 Benchmark]: Witness Printer took 231.11 ms. Allocated memory is still 1.1 GB. Free memory was 588.8 MB in the beginning and 560.4 MB in the end (delta: 28.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2020-11-28 03:01:18,649 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.33 ms. Allocated memory is still 90.2 MB. Free memory was 48.0 MB in the beginning and 48.0 MB in the end (delta: 35.0 kB). There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 400.17 ms. Allocated memory was 90.2 MB in the beginning and 144.7 MB in the end (delta: 54.5 MB). Free memory was 58.1 MB in the beginning and 118.5 MB in the end (delta: -60.5 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 46.28 ms. Allocated memory is still 144.7 MB. Free memory was 118.5 MB in the beginning and 116.4 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 33.62 ms. Allocated memory is still 144.7 MB. Free memory was 116.4 MB in the beginning and 114.3 MB in the end (delta: 2.1 MB). Peak memory consumption was 2.1 MB. Max. memory is 16.1 GB. * RCFGBuilder took 1011.20 ms. Allocated memory is still 144.7 MB. Free memory was 114.3 MB in the beginning and 80.8 MB in the end (delta: 33.6 MB). Peak memory consumption was 33.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 14673.48 ms. Allocated memory was 144.7 MB in the beginning and 1.1 GB in the end (delta: 914.4 MB). Free memory was 79.9 MB in the beginning and 588.8 MB in the end (delta: -508.9 MB). Peak memory consumption was 408.2 MB. Max. memory is 16.1 GB. * Witness Printer took 231.11 ms. Allocated memory is still 1.1 GB. Free memory was 588.8 MB in the beginning and 560.4 MB in the end (delta: 28.4 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int max_loop ; [L18] int num ; [L19] int i ; [L20] int e ; [L21] int timer ; [L22] char data_0 ; [L23] char data_1 ; [L66] int P_1_pc; [L67] int P_1_st ; [L68] int P_1_i ; [L69] int P_1_ev ; [L124] int C_1_pc ; [L125] int C_1_st ; [L126] int C_1_i ; [L127] int C_1_ev ; [L128] int C_1_pr ; VAL [C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=0, num=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, timer=0] [L492] int count ; [L493] int __retres2 ; [L497] num = 0 [L498] i = 0 [L499] max_loop = 2 [L501] timer = 0 [L502] P_1_pc = 0 [L503] C_1_pc = 0 [L505] count = 0 [L485] P_1_i = 1 [L486] C_1_i = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L423] int kernel_st ; [L424] int tmp ; [L425] int tmp___0 ; [L429] kernel_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L228] COND TRUE (int )P_1_i == 1 [L229] P_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L233] COND TRUE (int )C_1_i == 1 [L234] C_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L367] int tmp ; [L368] int tmp___0 ; [L369] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L109] COND FALSE !((int )P_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L119] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L121] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L373] tmp = is_P_1_triggered() [L375] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L188] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L191] COND FALSE !((int )C_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L201] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L211] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L213] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L381] tmp___1 = is_C_1_triggered() [L383] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L437] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L440] kernel_st = 1 [L264] int tmp ; [L265] int tmp___0 ; [L266] int tmp___1 ; [L267] int tmp___2 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L271] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L243] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L260] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L274] tmp___2 = exists_runnable_thread() [L276] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L281] COND TRUE (int )P_1_st == 0 [L283] tmp = __VERIFIER_nondet_int() [L285] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L296] COND TRUE (int )C_1_st == 0 [L298] tmp___1 = __VERIFIER_nondet_int() [L300] COND TRUE \read(tmp___1) [L302] C_1_st = 1 [L130] char c ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L133] COND TRUE (int )C_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L148] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L150] COND TRUE num == 0 [L151] timer = 1 [L152] i += 1 [L153] C_1_pc = 1 [L154] C_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L271] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L243] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L260] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L274] tmp___2 = exists_runnable_thread() [L276] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L281] COND TRUE (int )P_1_st == 0 [L283] tmp = __VERIFIER_nondet_int() [L285] COND TRUE \read(tmp) [L287] P_1_st = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L74] COND TRUE (int )P_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L85] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L51] COND TRUE i___0 == 0 [L52] data_0 = c VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L89] num += 1 [L90] P_1_pc = 1 [L91] P_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L296] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L271] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L243] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L246] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L250] COND FALSE !((int )C_1_st == 0) [L258] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L260] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L274] tmp___2 = exists_runnable_thread() [L276] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L444] kernel_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L448] kernel_st = 3 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L367] int tmp ; [L368] int tmp___0 ; [L369] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L109] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L110] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L119] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L121] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L373] tmp = is_P_1_triggered() [L375] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L188] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L191] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L192] COND FALSE !((int )e == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L201] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L211] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L213] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] tmp___1 = is_C_1_triggered() [L383] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L243] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L246] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L250] COND FALSE !((int )C_1_st == 0) [L258] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L260] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L454] tmp = exists_runnable_thread() [L456] COND TRUE tmp == 0 [L458] kernel_st = 4 [L338] C_1_ev = 1 [L340] P_1_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L367] int tmp ; [L368] int tmp___0 ; [L369] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L109] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L110] COND TRUE (int )P_1_ev == 1 [L111] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L121] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L373] tmp = is_P_1_triggered() [L375] COND TRUE \read(tmp) [L376] P_1_st = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L188] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L191] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L192] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L201] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L211] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L213] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L381] tmp___1 = is_C_1_triggered() [L383] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L352] COND TRUE (int )P_1_ev == 1 [L353] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L357] COND TRUE (int )C_1_ev == 1 [L358] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L404] int tmp ; [L405] int __retres2 ; [L243] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L260] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L409] tmp = exists_runnable_thread() [L411] COND TRUE \read(tmp) [L412] __retres2 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L419] return (__retres2); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L467] tmp___0 = stop_simulation() [L469] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L437] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L440] kernel_st = 1 [L264] int tmp ; [L265] int tmp___0 ; [L266] int tmp___1 ; [L267] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L271] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L243] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L260] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L274] tmp___2 = exists_runnable_thread() [L276] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L281] COND TRUE (int )P_1_st == 0 [L283] tmp = __VERIFIER_nondet_int() [L285] COND TRUE \read(tmp) [L287] P_1_st = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L74] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L77] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L85] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L51] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L54] COND TRUE i___0 == 1 [L55] data_1 = c VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L89] num += 1 [L90] P_1_pc = 1 [L91] P_1_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L296] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L271] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L243] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L246] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L250] COND FALSE !((int )C_1_st == 0) [L258] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L260] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L274] tmp___2 = exists_runnable_thread() [L276] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L444] kernel_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L448] kernel_st = 3 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L367] int tmp ; [L368] int tmp___0 ; [L369] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L109] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L110] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L119] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L121] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L373] tmp = is_P_1_triggered() [L375] COND FALSE !(\read(tmp)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L188] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L191] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L192] COND FALSE !((int )e == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L201] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L211] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L213] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] tmp___1 = is_C_1_triggered() [L383] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L243] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L246] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L250] COND FALSE !((int )C_1_st == 0) [L258] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L260] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L454] tmp = exists_runnable_thread() [L456] COND TRUE tmp == 0 [L458] kernel_st = 4 [L338] C_1_ev = 1 [L340] P_1_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L367] int tmp ; [L368] int tmp___0 ; [L369] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L109] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L110] COND TRUE (int )P_1_ev == 1 [L111] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L121] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L373] tmp = is_P_1_triggered() [L375] COND TRUE \read(tmp) [L376] P_1_st = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L188] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L191] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L192] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L201] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L211] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L213] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L381] tmp___1 = is_C_1_triggered() [L383] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L352] COND TRUE (int )P_1_ev == 1 [L353] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L357] COND TRUE (int )C_1_ev == 1 [L358] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L404] int tmp ; [L405] int __retres2 ; [L243] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L260] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L409] tmp = exists_runnable_thread() [L411] COND TRUE \read(tmp) [L412] __retres2 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L419] return (__retres2); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L467] tmp___0 = stop_simulation() [L469] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L437] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L440] kernel_st = 1 [L264] int tmp ; [L265] int tmp___0 ; [L266] int tmp___1 ; [L267] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L271] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L243] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L260] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L274] tmp___2 = exists_runnable_thread() [L276] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L281] COND TRUE (int )P_1_st == 0 [L283] tmp = __VERIFIER_nondet_int() [L285] COND TRUE \read(tmp) [L287] P_1_st = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L74] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L77] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L85] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L51] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L54] COND FALSE !(i___0 == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L3] __assert_fail("0", "kundu1.cil.c", 3, "reach_error") VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 120 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.4s, OverallIterations: 24, TraceHistogramMax: 6, AutomataDifference: 6.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 4666 SDtfs, 6038 SDslu, 6497 SDs, 0 SdLazy, 689 SolverSat, 176 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 170 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.6s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5850occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.5s AutomataMinimizationTime, 23 MinimizatonAttempts, 7372 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 1.2s InterpolantComputationTime, 1920 NumberOfCodeBlocks, 1920 NumberOfCodeBlocksAsserted, 25 NumberOfCheckSat, 1706 ConstructedInterpolants, 0 QuantifiedInterpolants, 393283 SizeOfPredicates, 3 NumberOfNonLiveVariables, 373 ConjunctsInSsa, 9 ConjunctsInUnsatCore, 24 InterpolantComputations, 22 PerfectInterpolantSequences, 378/448 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 RESULT: Ultimate proved your program to be incorrect! Received shutdown request...