./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_cb5b2489-8663-4bfb-907e-2f8752c322a7/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_cb5b2489-8663-4bfb-907e-2f8752c322a7/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_cb5b2489-8663-4bfb-907e-2f8752c322a7/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_cb5b2489-8663-4bfb-907e-2f8752c322a7/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/kundu1.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_cb5b2489-8663-4bfb-907e-2f8752c322a7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_cb5b2489-8663-4bfb-907e-2f8752c322a7/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-30 00:58:40,972 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-11-30 00:58:40,977 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-11-30 00:58:41,061 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-11-30 00:58:41,062 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-11-30 00:58:41,069 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-11-30 00:58:41,073 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-11-30 00:58:41,085 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-11-30 00:58:41,088 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-11-30 00:58:41,099 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-11-30 00:58:41,101 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-11-30 00:58:41,103 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-11-30 00:58:41,105 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-11-30 00:58:41,108 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-11-30 00:58:41,111 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-11-30 00:58:41,114 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-11-30 00:58:41,116 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-11-30 00:58:41,118 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-11-30 00:58:41,120 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-11-30 00:58:41,128 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-11-30 00:58:41,130 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-11-30 00:58:41,132 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-11-30 00:58:41,134 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-11-30 00:58:41,135 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-11-30 00:58:41,139 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-11-30 00:58:41,140 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-11-30 00:58:41,140 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-11-30 00:58:41,142 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-11-30 00:58:41,143 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-11-30 00:58:41,144 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-11-30 00:58:41,145 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-11-30 00:58:41,146 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-11-30 00:58:41,147 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-11-30 00:58:41,148 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-11-30 00:58:41,150 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-11-30 00:58:41,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-11-30 00:58:41,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-11-30 00:58:41,153 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-11-30 00:58:41,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-11-30 00:58:41,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-11-30 00:58:41,156 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-11-30 00:58:41,159 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_cb5b2489-8663-4bfb-907e-2f8752c322a7/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-11-30 00:58:41,203 INFO L113 SettingsManager]: Loading preferences was successful [2020-11-30 00:58:41,205 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-11-30 00:58:41,208 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-11-30 00:58:41,209 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-11-30 00:58:41,209 INFO L138 SettingsManager]: * Use SBE=true [2020-11-30 00:58:41,209 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-11-30 00:58:41,210 INFO L138 SettingsManager]: * sizeof long=4 [2020-11-30 00:58:41,210 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-11-30 00:58:41,210 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-11-30 00:58:41,210 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-11-30 00:58:41,212 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-11-30 00:58:41,212 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-11-30 00:58:41,213 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-11-30 00:58:41,213 INFO L138 SettingsManager]: * sizeof long double=12 [2020-11-30 00:58:41,213 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-11-30 00:58:41,213 INFO L138 SettingsManager]: * Use constant arrays=true [2020-11-30 00:58:41,214 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-11-30 00:58:41,214 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-11-30 00:58:41,214 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-11-30 00:58:41,214 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-11-30 00:58:41,215 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-11-30 00:58:41,215 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-11-30 00:58:41,215 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-11-30 00:58:41,216 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-11-30 00:58:41,216 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-11-30 00:58:41,216 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-11-30 00:58:41,216 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-11-30 00:58:41,217 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-11-30 00:58:41,217 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-11-30 00:58:41,217 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_cb5b2489-8663-4bfb-907e-2f8752c322a7/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_cb5b2489-8663-4bfb-907e-2f8752c322a7/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-30 00:58:41,593 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-11-30 00:58:41,643 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-11-30 00:58:41,647 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-11-30 00:58:41,649 INFO L271 PluginConnector]: Initializing CDTParser... [2020-11-30 00:58:41,652 INFO L275 PluginConnector]: CDTParser initialized [2020-11-30 00:58:41,654 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_cb5b2489-8663-4bfb-907e-2f8752c322a7/bin/uautomizer/../../sv-benchmarks/c/systemc/kundu1.cil.c [2020-11-30 00:58:41,766 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cb5b2489-8663-4bfb-907e-2f8752c322a7/bin/uautomizer/data/670c4b162/45f22ebba79c411bab2e2d460634304e/FLAGb3e78d42a [2020-11-30 00:58:42,411 INFO L306 CDTParser]: Found 1 translation units. [2020-11-30 00:58:42,416 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_cb5b2489-8663-4bfb-907e-2f8752c322a7/sv-benchmarks/c/systemc/kundu1.cil.c [2020-11-30 00:58:42,429 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_cb5b2489-8663-4bfb-907e-2f8752c322a7/bin/uautomizer/data/670c4b162/45f22ebba79c411bab2e2d460634304e/FLAGb3e78d42a [2020-11-30 00:58:42,720 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_cb5b2489-8663-4bfb-907e-2f8752c322a7/bin/uautomizer/data/670c4b162/45f22ebba79c411bab2e2d460634304e [2020-11-30 00:58:42,725 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-11-30 00:58:42,728 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-11-30 00:58:42,730 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-11-30 00:58:42,731 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-11-30 00:58:42,737 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-11-30 00:58:42,738 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:58:42" (1/1) ... [2020-11-30 00:58:42,745 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@98c91a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:58:42, skipping insertion in model container [2020-11-30 00:58:42,746 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 30.11 12:58:42" (1/1) ... [2020-11-30 00:58:42,756 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-11-30 00:58:42,836 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-11-30 00:58:43,281 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:58:43,308 INFO L203 MainTranslator]: Completed pre-run [2020-11-30 00:58:43,419 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-11-30 00:58:43,450 INFO L208 MainTranslator]: Completed translation [2020-11-30 00:58:43,453 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:58:43 WrapperNode [2020-11-30 00:58:43,454 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-11-30 00:58:43,455 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-11-30 00:58:43,456 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-11-30 00:58:43,456 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-11-30 00:58:43,467 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:58:43" (1/1) ... [2020-11-30 00:58:43,496 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:58:43" (1/1) ... [2020-11-30 00:58:43,565 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-11-30 00:58:43,567 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-11-30 00:58:43,568 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-11-30 00:58:43,568 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-11-30 00:58:43,578 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:58:43" (1/1) ... [2020-11-30 00:58:43,578 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:58:43" (1/1) ... [2020-11-30 00:58:43,585 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:58:43" (1/1) ... [2020-11-30 00:58:43,594 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:58:43" (1/1) ... [2020-11-30 00:58:43,603 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:58:43" (1/1) ... [2020-11-30 00:58:43,624 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:58:43" (1/1) ... [2020-11-30 00:58:43,627 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:58:43" (1/1) ... [2020-11-30 00:58:43,631 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-11-30 00:58:43,632 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-11-30 00:58:43,632 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-11-30 00:58:43,633 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-11-30 00:58:43,634 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:58:43" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cb5b2489-8663-4bfb-907e-2f8752c322a7/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-30 00:58:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-11-30 00:58:43,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-11-30 00:58:43,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-11-30 00:58:43,715 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-11-30 00:58:44,614 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-11-30 00:58:44,615 INFO L298 CfgBuilder]: Removed 78 assume(true) statements. [2020-11-30 00:58:44,619 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:58:44 BoogieIcfgContainer [2020-11-30 00:58:44,620 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-11-30 00:58:44,623 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-11-30 00:58:44,624 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-11-30 00:58:44,629 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-11-30 00:58:44,629 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 30.11 12:58:42" (1/3) ... [2020-11-30 00:58:44,630 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56df4b00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:58:44, skipping insertion in model container [2020-11-30 00:58:44,631 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 30.11 12:58:43" (2/3) ... [2020-11-30 00:58:44,631 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@56df4b00 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 30.11 12:58:44, skipping insertion in model container [2020-11-30 00:58:44,632 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:58:44" (3/3) ... [2020-11-30 00:58:44,634 INFO L111 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2020-11-30 00:58:44,649 INFO L164 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-11-30 00:58:44,656 INFO L176 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2020-11-30 00:58:44,672 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-11-30 00:58:44,718 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-11-30 00:58:44,721 INFO L378 AbstractCegarLoop]: Hoare is true [2020-11-30 00:58:44,722 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-11-30 00:58:44,722 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-11-30 00:58:44,722 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-11-30 00:58:44,723 INFO L382 AbstractCegarLoop]: Difference is false [2020-11-30 00:58:44,723 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-11-30 00:58:44,723 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-11-30 00:58:44,754 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2020-11-30 00:58:44,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-30 00:58:44,767 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:58:44,768 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-30 00:58:44,769 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:58:44,777 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:58:44,777 INFO L82 PathProgramCache]: Analyzing trace with hash -1357048476, now seen corresponding path program 1 times [2020-11-30 00:58:44,789 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:58:44,791 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967082814] [2020-11-30 00:58:44,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:58:44,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:58:45,028 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-30 00:58:45,029 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967082814] [2020-11-30 00:58:45,030 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:58:45,031 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:58:45,032 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [123355663] [2020-11-30 00:58:45,038 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:58:45,038 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:58:45,056 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:58:45,057 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:58:45,060 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 3 states. [2020-11-30 00:58:45,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:58:45,167 INFO L93 Difference]: Finished difference Result 231 states and 349 transitions. [2020-11-30 00:58:45,167 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:58:45,169 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-11-30 00:58:45,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:58:45,224 INFO L225 Difference]: With dead ends: 231 [2020-11-30 00:58:45,225 INFO L226 Difference]: Without dead ends: 112 [2020-11-30 00:58:45,264 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-30 00:58:45,299 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-11-30 00:58:45,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-11-30 00:58:45,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-11-30 00:58:45,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 162 transitions. [2020-11-30 00:58:45,377 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 162 transitions. Word has length 33 [2020-11-30 00:58:45,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:58:45,378 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 162 transitions. [2020-11-30 00:58:45,378 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:58:45,379 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 162 transitions. [2020-11-30 00:58:45,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-30 00:58:45,382 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:58:45,383 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-30 00:58:45,383 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-11-30 00:58:45,384 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:58:45,385 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:58:45,385 INFO L82 PathProgramCache]: Analyzing trace with hash 1551715426, now seen corresponding path program 1 times [2020-11-30 00:58:45,386 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:58:45,386 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967129696] [2020-11-30 00:58:45,386 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:58:45,430 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:58:45,509 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-30 00:58:45,509 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967129696] [2020-11-30 00:58:45,510 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:58:45,510 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:58:45,510 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1032751775] [2020-11-30 00:58:45,512 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:58:45,512 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:58:45,513 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:58:45,517 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:58:45,518 INFO L87 Difference]: Start difference. First operand 112 states and 162 transitions. Second operand 3 states. [2020-11-30 00:58:45,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:58:45,635 INFO L93 Difference]: Finished difference Result 304 states and 439 transitions. [2020-11-30 00:58:45,635 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:58:45,636 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-11-30 00:58:45,636 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:58:45,639 INFO L225 Difference]: With dead ends: 304 [2020-11-30 00:58:45,640 INFO L226 Difference]: Without dead ends: 199 [2020-11-30 00:58:45,642 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-30 00:58:45,643 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-11-30 00:58:45,681 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 189. [2020-11-30 00:58:45,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-11-30 00:58:45,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 273 transitions. [2020-11-30 00:58:45,685 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 273 transitions. Word has length 33 [2020-11-30 00:58:45,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:58:45,686 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 273 transitions. [2020-11-30 00:58:45,686 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:58:45,686 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 273 transitions. [2020-11-30 00:58:45,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-30 00:58:45,688 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:58:45,689 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-30 00:58:45,689 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-11-30 00:58:45,689 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:58:45,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:58:45,693 INFO L82 PathProgramCache]: Analyzing trace with hash -120802205, now seen corresponding path program 1 times [2020-11-30 00:58:45,694 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:58:45,694 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1901302805] [2020-11-30 00:58:45,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:58:45,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:58:45,834 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-30 00:58:45,834 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1901302805] [2020-11-30 00:58:45,834 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:58:45,835 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:58:45,835 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [371854317] [2020-11-30 00:58:45,835 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:58:45,836 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:58:45,837 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:58:45,837 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:58:45,837 INFO L87 Difference]: Start difference. First operand 189 states and 273 transitions. Second operand 5 states. [2020-11-30 00:58:46,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:58:46,084 INFO L93 Difference]: Finished difference Result 591 states and 861 transitions. [2020-11-30 00:58:46,084 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:58:46,084 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-11-30 00:58:46,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:58:46,090 INFO L225 Difference]: With dead ends: 591 [2020-11-30 00:58:46,090 INFO L226 Difference]: Without dead ends: 413 [2020-11-30 00:58:46,093 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-30 00:58:46,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2020-11-30 00:58:46,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 195. [2020-11-30 00:58:46,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-11-30 00:58:46,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 276 transitions. [2020-11-30 00:58:46,140 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 276 transitions. Word has length 33 [2020-11-30 00:58:46,140 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:58:46,140 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 276 transitions. [2020-11-30 00:58:46,141 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:58:46,141 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 276 transitions. [2020-11-30 00:58:46,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-11-30 00:58:46,155 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:58:46,155 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-30 00:58:46,156 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-11-30 00:58:46,156 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:58:46,160 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:58:46,161 INFO L82 PathProgramCache]: Analyzing trace with hash -1926240539, now seen corresponding path program 1 times [2020-11-30 00:58:46,161 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:58:46,162 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [487176428] [2020-11-30 00:58:46,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:58:46,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:58:46,260 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-30 00:58:46,261 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [487176428] [2020-11-30 00:58:46,261 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:58:46,261 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:58:46,262 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2126686754] [2020-11-30 00:58:46,262 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:58:46,263 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:58:46,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:58:46,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:58:46,264 INFO L87 Difference]: Start difference. First operand 195 states and 276 transitions. Second operand 4 states. [2020-11-30 00:58:46,506 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:58:46,506 INFO L93 Difference]: Finished difference Result 621 states and 872 transitions. [2020-11-30 00:58:46,507 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:58:46,507 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-11-30 00:58:46,507 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:58:46,511 INFO L225 Difference]: With dead ends: 621 [2020-11-30 00:58:46,511 INFO L226 Difference]: Without dead ends: 439 [2020-11-30 00:58:46,518 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-30 00:58:46,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-11-30 00:58:46,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 333. [2020-11-30 00:58:46,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2020-11-30 00:58:46,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 464 transitions. [2020-11-30 00:58:46,590 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 464 transitions. Word has length 33 [2020-11-30 00:58:46,590 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:58:46,590 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 464 transitions. [2020-11-30 00:58:46,590 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:58:46,590 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 464 transitions. [2020-11-30 00:58:46,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-30 00:58:46,592 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:58:46,592 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-30 00:58:46,592 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-11-30 00:58:46,593 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:58:46,593 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:58:46,594 INFO L82 PathProgramCache]: Analyzing trace with hash -1179728243, now seen corresponding path program 1 times [2020-11-30 00:58:46,594 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:58:46,595 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1662465604] [2020-11-30 00:58:46,595 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:58:46,645 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:58:46,728 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-30 00:58:46,728 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1662465604] [2020-11-30 00:58:46,729 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:58:46,729 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:58:46,729 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1601456868] [2020-11-30 00:58:46,730 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:58:46,730 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:58:46,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:58:46,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:58:46,731 INFO L87 Difference]: Start difference. First operand 333 states and 464 transitions. Second operand 5 states. [2020-11-30 00:58:46,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:58:46,952 INFO L93 Difference]: Finished difference Result 1126 states and 1579 transitions. [2020-11-30 00:58:46,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-11-30 00:58:46,953 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-11-30 00:58:46,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:58:46,961 INFO L225 Difference]: With dead ends: 1126 [2020-11-30 00:58:46,961 INFO L226 Difference]: Without dead ends: 812 [2020-11-30 00:58:46,967 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-30 00:58:46,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-11-30 00:58:47,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 360. [2020-11-30 00:58:47,030 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2020-11-30 00:58:47,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 491 transitions. [2020-11-30 00:58:47,033 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 491 transitions. Word has length 34 [2020-11-30 00:58:47,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:58:47,034 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 491 transitions. [2020-11-30 00:58:47,034 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:58:47,034 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 491 transitions. [2020-11-30 00:58:47,045 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-11-30 00:58:47,045 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:58:47,045 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-30 00:58:47,046 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-11-30 00:58:47,046 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:58:47,047 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:58:47,047 INFO L82 PathProgramCache]: Analyzing trace with hash 1526891151, now seen corresponding path program 1 times [2020-11-30 00:58:47,047 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:58:47,048 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1280997126] [2020-11-30 00:58:47,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:58:47,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:58:47,182 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-30 00:58:47,182 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1280997126] [2020-11-30 00:58:47,183 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:58:47,183 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:58:47,183 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94422527] [2020-11-30 00:58:47,184 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:58:47,184 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:58:47,187 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:58:47,188 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:58:47,188 INFO L87 Difference]: Start difference. First operand 360 states and 491 transitions. Second operand 4 states. [2020-11-30 00:58:47,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:58:47,411 INFO L93 Difference]: Finished difference Result 1662 states and 2286 transitions. [2020-11-30 00:58:47,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:58:47,412 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2020-11-30 00:58:47,413 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:58:47,424 INFO L225 Difference]: With dead ends: 1662 [2020-11-30 00:58:47,424 INFO L226 Difference]: Without dead ends: 1324 [2020-11-30 00:58:47,426 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-30 00:58:47,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2020-11-30 00:58:47,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 674. [2020-11-30 00:58:47,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2020-11-30 00:58:47,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 923 transitions. [2020-11-30 00:58:47,555 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 923 transitions. Word has length 34 [2020-11-30 00:58:47,558 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:58:47,561 INFO L481 AbstractCegarLoop]: Abstraction has 674 states and 923 transitions. [2020-11-30 00:58:47,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:58:47,562 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 923 transitions. [2020-11-30 00:58:47,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-11-30 00:58:47,565 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:58:47,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, 1, 1, 1, 1, 1, 1, 1] [2020-11-30 00:58:47,566 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-11-30 00:58:47,567 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:58:47,568 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:58:47,568 INFO L82 PathProgramCache]: Analyzing trace with hash 678817943, now seen corresponding path program 1 times [2020-11-30 00:58:47,569 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:58:47,569 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [714100117] [2020-11-30 00:58:47,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:58:47,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:58:47,710 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-30 00:58:47,710 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [714100117] [2020-11-30 00:58:47,711 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:58:47,711 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:58:47,711 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991873932] [2020-11-30 00:58:47,712 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:58:47,712 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:58:47,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:58:47,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:58:47,713 INFO L87 Difference]: Start difference. First operand 674 states and 923 transitions. Second operand 5 states. [2020-11-30 00:58:47,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:58:47,893 INFO L93 Difference]: Finished difference Result 1497 states and 2054 transitions. [2020-11-30 00:58:47,894 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:58:47,894 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-11-30 00:58:47,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:58:47,901 INFO L225 Difference]: With dead ends: 1497 [2020-11-30 00:58:47,902 INFO L226 Difference]: Without dead ends: 845 [2020-11-30 00:58:47,904 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-30 00:58:47,906 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2020-11-30 00:58:47,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 837. [2020-11-30 00:58:47,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2020-11-30 00:58:47,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1144 transitions. [2020-11-30 00:58:47,998 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1144 transitions. Word has length 41 [2020-11-30 00:58:47,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:58:47,999 INFO L481 AbstractCegarLoop]: Abstraction has 837 states and 1144 transitions. [2020-11-30 00:58:47,999 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:58:47,999 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1144 transitions. [2020-11-30 00:58:48,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-11-30 00:58:48,002 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:58:48,002 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-30 00:58:48,002 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-11-30 00:58:48,003 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:58:48,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:58:48,003 INFO L82 PathProgramCache]: Analyzing trace with hash 1967171351, now seen corresponding path program 1 times [2020-11-30 00:58:48,003 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:58:48,004 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1860016176] [2020-11-30 00:58:48,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:58:48,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:58:48,171 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-30 00:58:48,171 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1860016176] [2020-11-30 00:58:48,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:58:48,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-11-30 00:58:48,172 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603951863] [2020-11-30 00:58:48,173 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-11-30 00:58:48,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:58:48,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-11-30 00:58:48,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-11-30 00:58:48,174 INFO L87 Difference]: Start difference. First operand 837 states and 1144 transitions. Second operand 6 states. [2020-11-30 00:58:48,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:58:48,630 INFO L93 Difference]: Finished difference Result 3287 states and 4502 transitions. [2020-11-30 00:58:48,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 00:58:48,631 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2020-11-30 00:58:48,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:58:48,653 INFO L225 Difference]: With dead ends: 3287 [2020-11-30 00:58:48,654 INFO L226 Difference]: Without dead ends: 2472 [2020-11-30 00:58:48,657 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-30 00:58:48,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2020-11-30 00:58:48,833 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 1321. [2020-11-30 00:58:48,833 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2020-11-30 00:58:48,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1806 transitions. [2020-11-30 00:58:48,843 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1806 transitions. Word has length 44 [2020-11-30 00:58:48,844 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:58:48,844 INFO L481 AbstractCegarLoop]: Abstraction has 1321 states and 1806 transitions. [2020-11-30 00:58:48,844 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-11-30 00:58:48,844 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1806 transitions. [2020-11-30 00:58:48,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-11-30 00:58:48,846 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:58:48,846 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-30 00:58:48,846 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-11-30 00:58:48,848 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:58:48,848 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:58:48,849 INFO L82 PathProgramCache]: Analyzing trace with hash -477389262, now seen corresponding path program 1 times [2020-11-30 00:58:48,849 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:58:48,850 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [231976491] [2020-11-30 00:58:48,850 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:58:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:58:48,904 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-30 00:58:48,905 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [231976491] [2020-11-30 00:58:48,905 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:58:48,905 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:58:48,907 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1189312698] [2020-11-30 00:58:48,907 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:58:48,910 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:58:48,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:58:48,913 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:58:48,914 INFO L87 Difference]: Start difference. First operand 1321 states and 1806 transitions. Second operand 3 states. [2020-11-30 00:58:49,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:58:49,262 INFO L93 Difference]: Finished difference Result 3798 states and 5147 transitions. [2020-11-30 00:58:49,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:58:49,263 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-11-30 00:58:49,264 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:58:49,283 INFO L225 Difference]: With dead ends: 3798 [2020-11-30 00:58:49,283 INFO L226 Difference]: Without dead ends: 2499 [2020-11-30 00:58:49,286 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-30 00:58:49,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2020-11-30 00:58:49,547 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2495. [2020-11-30 00:58:49,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2495 states. [2020-11-30 00:58:49,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 3301 transitions. [2020-11-30 00:58:49,561 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 3301 transitions. Word has length 46 [2020-11-30 00:58:49,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:58:49,562 INFO L481 AbstractCegarLoop]: Abstraction has 2495 states and 3301 transitions. [2020-11-30 00:58:49,562 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:58:49,562 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 3301 transitions. [2020-11-30 00:58:49,563 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-30 00:58:49,563 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:58:49,564 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-30 00:58:49,564 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-11-30 00:58:49,564 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:58:49,565 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:58:49,565 INFO L82 PathProgramCache]: Analyzing trace with hash -162601451, now seen corresponding path program 1 times [2020-11-30 00:58:49,565 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:58:49,565 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443950542] [2020-11-30 00:58:49,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:58:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:58:49,632 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-30 00:58:49,634 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443950542] [2020-11-30 00:58:49,634 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:58:49,635 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:58:49,635 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319757334] [2020-11-30 00:58:49,635 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:58:49,636 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:58:49,636 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:58:49,637 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:58:49,637 INFO L87 Difference]: Start difference. First operand 2495 states and 3301 transitions. Second operand 3 states. [2020-11-30 00:58:50,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:58:50,135 INFO L93 Difference]: Finished difference Result 7169 states and 9443 transitions. [2020-11-30 00:58:50,138 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:58:50,139 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-11-30 00:58:50,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:58:50,175 INFO L225 Difference]: With dead ends: 7169 [2020-11-30 00:58:50,175 INFO L226 Difference]: Without dead ends: 4714 [2020-11-30 00:58:50,182 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-30 00:58:50,192 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4714 states. [2020-11-30 00:58:50,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4714 to 4712. [2020-11-30 00:58:50,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4712 states. [2020-11-30 00:58:50,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4712 states to 4712 states and 6108 transitions. [2020-11-30 00:58:50,752 INFO L78 Accepts]: Start accepts. Automaton has 4712 states and 6108 transitions. Word has length 48 [2020-11-30 00:58:50,752 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:58:50,752 INFO L481 AbstractCegarLoop]: Abstraction has 4712 states and 6108 transitions. [2020-11-30 00:58:50,753 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:58:50,753 INFO L276 IsEmpty]: Start isEmpty. Operand 4712 states and 6108 transitions. [2020-11-30 00:58:50,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-11-30 00:58:50,755 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:58:50,755 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-30 00:58:50,756 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-11-30 00:58:50,756 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:58:50,758 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:58:50,758 INFO L82 PathProgramCache]: Analyzing trace with hash 297274720, now seen corresponding path program 1 times [2020-11-30 00:58:50,759 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:58:50,759 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2145534472] [2020-11-30 00:58:50,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:58:50,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:58:50,855 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-30 00:58:50,856 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2145534472] [2020-11-30 00:58:50,856 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:58:50,857 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:58:50,857 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1132174873] [2020-11-30 00:58:50,858 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:58:50,859 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:58:50,861 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:58:50,862 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:58:50,863 INFO L87 Difference]: Start difference. First operand 4712 states and 6108 transitions. Second operand 4 states. [2020-11-30 00:58:51,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:58:51,708 INFO L93 Difference]: Finished difference Result 11359 states and 14646 transitions. [2020-11-30 00:58:51,709 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:58:51,709 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2020-11-30 00:58:51,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:58:51,756 INFO L225 Difference]: With dead ends: 11359 [2020-11-30 00:58:51,756 INFO L226 Difference]: Without dead ends: 6671 [2020-11-30 00:58:51,766 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-30 00:58:51,778 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6671 states. [2020-11-30 00:58:52,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6671 to 5850. [2020-11-30 00:58:52,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5850 states. [2020-11-30 00:58:52,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 7394 transitions. [2020-11-30 00:58:52,397 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 7394 transitions. Word has length 48 [2020-11-30 00:58:52,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:58:52,399 INFO L481 AbstractCegarLoop]: Abstraction has 5850 states and 7394 transitions. [2020-11-30 00:58:52,400 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:58:52,400 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 7394 transitions. [2020-11-30 00:58:52,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-11-30 00:58:52,401 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:58:52,402 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-30 00:58:52,402 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-11-30 00:58:52,402 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:58:52,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:58:52,403 INFO L82 PathProgramCache]: Analyzing trace with hash -2096931086, now seen corresponding path program 1 times [2020-11-30 00:58:52,404 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:58:52,404 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1429706416] [2020-11-30 00:58:52,405 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:58:52,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:58:52,472 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-30 00:58:52,472 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1429706416] [2020-11-30 00:58:52,473 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:58:52,478 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:58:52,479 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [776267626] [2020-11-30 00:58:52,479 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-11-30 00:58:52,480 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:58:52,481 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-11-30 00:58:52,481 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-11-30 00:58:52,481 INFO L87 Difference]: Start difference. First operand 5850 states and 7394 transitions. Second operand 4 states. [2020-11-30 00:58:53,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:58:53,297 INFO L93 Difference]: Finished difference Result 10947 states and 13872 transitions. [2020-11-30 00:58:53,298 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:58:53,298 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2020-11-30 00:58:53,298 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:58:53,334 INFO L225 Difference]: With dead ends: 10947 [2020-11-30 00:58:53,335 INFO L226 Difference]: Without dead ends: 5013 [2020-11-30 00:58:53,348 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-30 00:58:53,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5013 states. [2020-11-30 00:58:53,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5013 to 4814. [2020-11-30 00:58:53,911 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4814 states. [2020-11-30 00:58:53,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4814 states to 4814 states and 5985 transitions. [2020-11-30 00:58:53,934 INFO L78 Accepts]: Start accepts. Automaton has 4814 states and 5985 transitions. Word has length 49 [2020-11-30 00:58:53,935 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:58:53,935 INFO L481 AbstractCegarLoop]: Abstraction has 4814 states and 5985 transitions. [2020-11-30 00:58:53,935 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-11-30 00:58:53,935 INFO L276 IsEmpty]: Start isEmpty. Operand 4814 states and 5985 transitions. [2020-11-30 00:58:53,940 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-11-30 00:58:53,940 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:58:53,940 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-30 00:58:53,941 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-11-30 00:58:53,941 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:58:53,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:58:53,942 INFO L82 PathProgramCache]: Analyzing trace with hash 358168785, now seen corresponding path program 1 times [2020-11-30 00:58:53,942 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:58:53,943 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545628674] [2020-11-30 00:58:53,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:58:53,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:58:54,026 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-30 00:58:54,027 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545628674] [2020-11-30 00:58:54,027 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:58:54,027 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:58:54,028 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [570682881] [2020-11-30 00:58:54,028 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:58:54,028 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:58:54,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:58:54,030 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:58:54,030 INFO L87 Difference]: Start difference. First operand 4814 states and 5985 transitions. Second operand 5 states. [2020-11-30 00:58:54,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:58:54,438 INFO L93 Difference]: Finished difference Result 8526 states and 10629 transitions. [2020-11-30 00:58:54,439 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:58:54,439 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2020-11-30 00:58:54,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:58:54,464 INFO L225 Difference]: With dead ends: 8526 [2020-11-30 00:58:54,465 INFO L226 Difference]: Without dead ends: 3744 [2020-11-30 00:58:54,474 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-30 00:58:54,481 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3744 states. [2020-11-30 00:58:54,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3744 to 3233. [2020-11-30 00:58:54,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3233 states. [2020-11-30 00:58:54,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3233 states to 3233 states and 4035 transitions. [2020-11-30 00:58:54,823 INFO L78 Accepts]: Start accepts. Automaton has 3233 states and 4035 transitions. Word has length 83 [2020-11-30 00:58:54,823 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:58:54,824 INFO L481 AbstractCegarLoop]: Abstraction has 3233 states and 4035 transitions. [2020-11-30 00:58:54,825 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:58:54,825 INFO L276 IsEmpty]: Start isEmpty. Operand 3233 states and 4035 transitions. [2020-11-30 00:58:54,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-11-30 00:58:54,837 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:58:54,837 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-30 00:58:54,837 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-11-30 00:58:54,838 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:58:54,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:58:54,838 INFO L82 PathProgramCache]: Analyzing trace with hash -1417804680, now seen corresponding path program 1 times [2020-11-30 00:58:54,839 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:58:54,843 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [738176679] [2020-11-30 00:58:54,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:58:54,856 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:58:54,883 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-30 00:58:54,883 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [738176679] [2020-11-30 00:58:54,884 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:58:54,884 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:58:54,885 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1753719391] [2020-11-30 00:58:54,886 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:58:54,886 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:58:54,887 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:58:54,887 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:58:54,887 INFO L87 Difference]: Start difference. First operand 3233 states and 4035 transitions. Second operand 3 states. [2020-11-30 00:58:55,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:58:55,076 INFO L93 Difference]: Finished difference Result 3481 states and 4330 transitions. [2020-11-30 00:58:55,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:58:55,077 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-11-30 00:58:55,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:58:55,088 INFO L225 Difference]: With dead ends: 3481 [2020-11-30 00:58:55,088 INFO L226 Difference]: Without dead ends: 3217 [2020-11-30 00:58:55,091 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-30 00:58:55,097 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3217 states. [2020-11-30 00:58:55,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3217 to 3217. [2020-11-30 00:58:55,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3217 states. [2020-11-30 00:58:55,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 4018 transitions. [2020-11-30 00:58:55,385 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 4018 transitions. Word has length 86 [2020-11-30 00:58:55,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:58:55,385 INFO L481 AbstractCegarLoop]: Abstraction has 3217 states and 4018 transitions. [2020-11-30 00:58:55,385 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:58:55,386 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 4018 transitions. [2020-11-30 00:58:55,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-11-30 00:58:55,389 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:58:55,390 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-30 00:58:55,390 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-11-30 00:58:55,390 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:58:55,391 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:58:55,391 INFO L82 PathProgramCache]: Analyzing trace with hash -402537650, now seen corresponding path program 1 times [2020-11-30 00:58:55,392 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:58:55,392 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [564993475] [2020-11-30 00:58:55,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:58:55,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:58:55,466 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-30 00:58:55,466 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [564993475] [2020-11-30 00:58:55,467 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:58:55,467 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:58:55,467 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [112061901] [2020-11-30 00:58:55,468 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:58:55,468 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:58:55,468 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:58:55,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:58:55,469 INFO L87 Difference]: Start difference. First operand 3217 states and 4018 transitions. Second operand 3 states. [2020-11-30 00:58:55,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:58:55,717 INFO L93 Difference]: Finished difference Result 3591 states and 4462 transitions. [2020-11-30 00:58:55,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:58:55,718 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2020-11-30 00:58:55,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:58:55,726 INFO L225 Difference]: With dead ends: 3591 [2020-11-30 00:58:55,727 INFO L226 Difference]: Without dead ends: 3202 [2020-11-30 00:58:55,729 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-30 00:58:55,735 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3202 states. [2020-11-30 00:58:56,048 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3202 to 3195. [2020-11-30 00:58:56,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3195 states. [2020-11-30 00:58:56,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3195 states to 3195 states and 3992 transitions. [2020-11-30 00:58:56,058 INFO L78 Accepts]: Start accepts. Automaton has 3195 states and 3992 transitions. Word has length 89 [2020-11-30 00:58:56,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:58:56,059 INFO L481 AbstractCegarLoop]: Abstraction has 3195 states and 3992 transitions. [2020-11-30 00:58:56,059 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:58:56,059 INFO L276 IsEmpty]: Start isEmpty. Operand 3195 states and 3992 transitions. [2020-11-30 00:58:56,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-11-30 00:58:56,064 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:58:56,064 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-30 00:58:56,064 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-11-30 00:58:56,065 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:58:56,065 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:58:56,065 INFO L82 PathProgramCache]: Analyzing trace with hash 1336538508, now seen corresponding path program 1 times [2020-11-30 00:58:56,066 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:58:56,066 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [26255483] [2020-11-30 00:58:56,066 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:58:56,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:58:56,163 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-30 00:58:56,163 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [26255483] [2020-11-30 00:58:56,166 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:58:56,167 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:58:56,167 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472838345] [2020-11-30 00:58:56,167 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:58:56,168 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:58:56,169 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:58:56,169 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:58:56,169 INFO L87 Difference]: Start difference. First operand 3195 states and 3992 transitions. Second operand 5 states. [2020-11-30 00:58:56,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:58:56,681 INFO L93 Difference]: Finished difference Result 6859 states and 8520 transitions. [2020-11-30 00:58:56,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:58:56,681 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2020-11-30 00:58:56,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:58:56,693 INFO L225 Difference]: With dead ends: 6859 [2020-11-30 00:58:56,693 INFO L226 Difference]: Without dead ends: 3724 [2020-11-30 00:58:56,700 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-30 00:58:56,706 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2020-11-30 00:58:57,064 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3073. [2020-11-30 00:58:57,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2020-11-30 00:58:57,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 3805 transitions. [2020-11-30 00:58:57,073 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 3805 transitions. Word has length 95 [2020-11-30 00:58:57,073 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:58:57,074 INFO L481 AbstractCegarLoop]: Abstraction has 3073 states and 3805 transitions. [2020-11-30 00:58:57,074 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:58:57,074 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 3805 transitions. [2020-11-30 00:58:57,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-11-30 00:58:57,078 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:58:57,078 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-30 00:58:57,079 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-11-30 00:58:57,079 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:58:57,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:58:57,080 INFO L82 PathProgramCache]: Analyzing trace with hash 126172792, now seen corresponding path program 1 times [2020-11-30 00:58:57,080 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:58:57,080 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [271902435] [2020-11-30 00:58:57,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:58:57,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:58:57,171 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-30 00:58:57,172 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [271902435] [2020-11-30 00:58:57,172 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:58:57,172 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:58:57,173 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1464949885] [2020-11-30 00:58:57,173 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:58:57,173 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:58:57,174 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:58:57,174 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:58:57,175 INFO L87 Difference]: Start difference. First operand 3073 states and 3805 transitions. Second operand 5 states. [2020-11-30 00:58:57,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:58:57,564 INFO L93 Difference]: Finished difference Result 5583 states and 6899 transitions. [2020-11-30 00:58:57,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-11-30 00:58:57,565 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2020-11-30 00:58:57,565 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:58:57,571 INFO L225 Difference]: With dead ends: 5583 [2020-11-30 00:58:57,571 INFO L226 Difference]: Without dead ends: 2208 [2020-11-30 00:58:57,578 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-30 00:58:57,582 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2020-11-30 00:58:57,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 2050. [2020-11-30 00:58:57,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2050 states. [2020-11-30 00:58:57,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 2515 transitions. [2020-11-30 00:58:57,777 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 2515 transitions. Word has length 98 [2020-11-30 00:58:57,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:58:57,778 INFO L481 AbstractCegarLoop]: Abstraction has 2050 states and 2515 transitions. [2020-11-30 00:58:57,778 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:58:57,778 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 2515 transitions. [2020-11-30 00:58:57,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-11-30 00:58:57,781 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:58:57,781 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-30 00:58:57,782 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-11-30 00:58:57,782 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:58:57,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:58:57,783 INFO L82 PathProgramCache]: Analyzing trace with hash -1098481666, now seen corresponding path program 1 times [2020-11-30 00:58:57,783 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:58:57,783 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1712226350] [2020-11-30 00:58:57,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:58:57,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:58:57,836 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-30 00:58:57,837 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1712226350] [2020-11-30 00:58:57,837 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:58:57,838 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:58:57,838 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1148969813] [2020-11-30 00:58:57,840 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:58:57,841 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:58:57,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:58:57,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:58:57,842 INFO L87 Difference]: Start difference. First operand 2050 states and 2515 transitions. Second operand 3 states. [2020-11-30 00:58:58,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:58:58,032 INFO L93 Difference]: Finished difference Result 3786 states and 4676 transitions. [2020-11-30 00:58:58,033 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:58:58,033 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2020-11-30 00:58:58,034 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:58:58,038 INFO L225 Difference]: With dead ends: 3786 [2020-11-30 00:58:58,038 INFO L226 Difference]: Without dead ends: 1796 [2020-11-30 00:58:58,042 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-30 00:58:58,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2020-11-30 00:58:58,208 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1793. [2020-11-30 00:58:58,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1793 states. [2020-11-30 00:58:58,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2167 transitions. [2020-11-30 00:58:58,213 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2167 transitions. Word has length 111 [2020-11-30 00:58:58,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:58:58,213 INFO L481 AbstractCegarLoop]: Abstraction has 1793 states and 2167 transitions. [2020-11-30 00:58:58,214 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:58:58,214 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2167 transitions. [2020-11-30 00:58:58,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-11-30 00:58:58,217 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:58:58,217 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-30 00:58:58,217 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-11-30 00:58:58,218 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:58:58,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:58:58,218 INFO L82 PathProgramCache]: Analyzing trace with hash -1656411785, now seen corresponding path program 1 times [2020-11-30 00:58:58,219 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:58:58,221 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1603735263] [2020-11-30 00:58:58,221 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:58:58,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:58:58,313 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-30 00:58:58,313 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1603735263] [2020-11-30 00:58:58,314 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:58:58,314 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-11-30 00:58:58,314 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1614516200] [2020-11-30 00:58:58,316 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:58:58,316 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:58:58,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:58:58,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:58:58,318 INFO L87 Difference]: Start difference. First operand 1793 states and 2167 transitions. Second operand 5 states. [2020-11-30 00:58:58,551 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:58:58,551 INFO L93 Difference]: Finished difference Result 3489 states and 4203 transitions. [2020-11-30 00:58:58,552 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-11-30 00:58:58,552 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2020-11-30 00:58:58,552 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:58:58,557 INFO L225 Difference]: With dead ends: 3489 [2020-11-30 00:58:58,557 INFO L226 Difference]: Without dead ends: 1757 [2020-11-30 00:58:58,561 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-30 00:58:58,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2020-11-30 00:58:58,738 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1618. [2020-11-30 00:58:58,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2020-11-30 00:58:58,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 1932 transitions. [2020-11-30 00:58:58,742 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 1932 transitions. Word has length 113 [2020-11-30 00:58:58,743 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:58:58,743 INFO L481 AbstractCegarLoop]: Abstraction has 1618 states and 1932 transitions. [2020-11-30 00:58:58,743 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:58:58,743 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 1932 transitions. [2020-11-30 00:58:58,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-11-30 00:58:58,746 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:58:58,746 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-30 00:58:58,747 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-11-30 00:58:58,747 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:58:58,747 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:58:58,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1864761928, now seen corresponding path program 1 times [2020-11-30 00:58:58,748 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:58:58,748 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [254543290] [2020-11-30 00:58:58,748 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:58:58,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:58:58,801 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-30 00:58:58,802 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [254543290] [2020-11-30 00:58:58,802 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:58:58,802 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:58:58,803 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49794940] [2020-11-30 00:58:58,803 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:58:58,803 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:58:58,804 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:58:58,804 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:58:58,804 INFO L87 Difference]: Start difference. First operand 1618 states and 1932 transitions. Second operand 3 states. [2020-11-30 00:58:59,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:58:59,058 INFO L93 Difference]: Finished difference Result 3212 states and 3849 transitions. [2020-11-30 00:58:59,059 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:58:59,059 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2020-11-30 00:58:59,060 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:58:59,063 INFO L225 Difference]: With dead ends: 3212 [2020-11-30 00:58:59,064 INFO L226 Difference]: Without dead ends: 1655 [2020-11-30 00:58:59,066 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-30 00:58:59,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2020-11-30 00:58:59,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1646. [2020-11-30 00:58:59,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2020-11-30 00:58:59,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 1934 transitions. [2020-11-30 00:58:59,236 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 1934 transitions. Word has length 113 [2020-11-30 00:58:59,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:58:59,237 INFO L481 AbstractCegarLoop]: Abstraction has 1646 states and 1934 transitions. [2020-11-30 00:58:59,237 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:58:59,237 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 1934 transitions. [2020-11-30 00:58:59,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-11-30 00:58:59,240 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:58:59,241 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-30 00:58:59,241 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-11-30 00:58:59,241 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:58:59,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:58:59,242 INFO L82 PathProgramCache]: Analyzing trace with hash -1931636839, now seen corresponding path program 1 times [2020-11-30 00:58:59,242 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:58:59,242 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [290343792] [2020-11-30 00:58:59,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:58:59,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:58:59,357 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-30 00:58:59,357 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [290343792] [2020-11-30 00:58:59,358 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:58:59,358 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-11-30 00:58:59,358 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873485369] [2020-11-30 00:58:59,359 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:58:59,360 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:58:59,360 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:58:59,360 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:58:59,361 INFO L87 Difference]: Start difference. First operand 1646 states and 1934 transitions. Second operand 5 states. [2020-11-30 00:58:59,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:58:59,810 INFO L93 Difference]: Finished difference Result 4611 states and 5427 transitions. [2020-11-30 00:58:59,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-11-30 00:58:59,811 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2020-11-30 00:58:59,811 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:58:59,818 INFO L225 Difference]: With dead ends: 4611 [2020-11-30 00:58:59,819 INFO L226 Difference]: Without dead ends: 3026 [2020-11-30 00:58:59,823 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-30 00:58:59,828 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3026 states. [2020-11-30 00:59:00,012 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3026 to 1648. [2020-11-30 00:59:00,012 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1648 states. [2020-11-30 00:59:00,015 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 1932 transitions. [2020-11-30 00:59:00,016 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 1932 transitions. Word has length 114 [2020-11-30 00:59:00,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:59:00,017 INFO L481 AbstractCegarLoop]: Abstraction has 1648 states and 1932 transitions. [2020-11-30 00:59:00,017 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:59:00,017 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 1932 transitions. [2020-11-30 00:59:00,020 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-11-30 00:59:00,020 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:59:00,020 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-30 00:59:00,021 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-11-30 00:59:00,021 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:59:00,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:59:00,022 INFO L82 PathProgramCache]: Analyzing trace with hash 163305011, now seen corresponding path program 1 times [2020-11-30 00:59:00,022 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:59:00,022 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1277422852] [2020-11-30 00:59:00,022 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:59:00,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:59:00,089 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-30 00:59:00,089 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1277422852] [2020-11-30 00:59:00,090 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-11-30 00:59:00,090 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-11-30 00:59:00,090 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752618529] [2020-11-30 00:59:00,091 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-11-30 00:59:00,091 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:59:00,091 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-11-30 00:59:00,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-11-30 00:59:00,092 INFO L87 Difference]: Start difference. First operand 1648 states and 1932 transitions. Second operand 3 states. [2020-11-30 00:59:00,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:59:00,289 INFO L93 Difference]: Finished difference Result 2927 states and 3440 transitions. [2020-11-30 00:59:00,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-11-30 00:59:00,293 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2020-11-30 00:59:00,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:59:00,297 INFO L225 Difference]: With dead ends: 2927 [2020-11-30 00:59:00,297 INFO L226 Difference]: Without dead ends: 1340 [2020-11-30 00:59:00,300 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-30 00:59:00,302 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2020-11-30 00:59:00,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1232. [2020-11-30 00:59:00,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2020-11-30 00:59:00,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1430 transitions. [2020-11-30 00:59:00,445 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1430 transitions. Word has length 116 [2020-11-30 00:59:00,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:59:00,445 INFO L481 AbstractCegarLoop]: Abstraction has 1232 states and 1430 transitions. [2020-11-30 00:59:00,446 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-11-30 00:59:00,446 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1430 transitions. [2020-11-30 00:59:00,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-11-30 00:59:00,448 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:59:00,448 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-30 00:59:00,449 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-11-30 00:59:00,449 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:59:00,449 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:59:00,450 INFO L82 PathProgramCache]: Analyzing trace with hash -641278560, now seen corresponding path program 1 times [2020-11-30 00:59:00,450 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:59:00,450 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1917583344] [2020-11-30 00:59:00,450 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:59:00,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:59:00,623 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-30 00:59:00,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1917583344] [2020-11-30 00:59:00,624 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1457710832] [2020-11-30 00:59:00,624 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_cb5b2489-8663-4bfb-907e-2f8752c322a7/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-30 00:59:00,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-11-30 00:59:00,829 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 9 conjunts are in the unsatisfiable core [2020-11-30 00:59:00,855 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-11-30 00:59:01,042 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-30 00:59:01,045 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-11-30 00:59:01,045 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-11-30 00:59:01,047 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [722606793] [2020-11-30 00:59:01,049 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-11-30 00:59:01,049 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-11-30 00:59:01,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-11-30 00:59:01,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-11-30 00:59:01,050 INFO L87 Difference]: Start difference. First operand 1232 states and 1430 transitions. Second operand 5 states. [2020-11-30 00:59:01,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-11-30 00:59:01,559 INFO L93 Difference]: Finished difference Result 2927 states and 3398 transitions. [2020-11-30 00:59:01,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-11-30 00:59:01,560 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2020-11-30 00:59:01,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-11-30 00:59:01,566 INFO L225 Difference]: With dead ends: 2927 [2020-11-30 00:59:01,566 INFO L226 Difference]: Without dead ends: 2134 [2020-11-30 00:59:01,570 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-11-30 00:59:01,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2020-11-30 00:59:01,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 1347. [2020-11-30 00:59:01,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2020-11-30 00:59:01,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1557 transitions. [2020-11-30 00:59:01,779 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1557 transitions. Word has length 118 [2020-11-30 00:59:01,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-11-30 00:59:01,780 INFO L481 AbstractCegarLoop]: Abstraction has 1347 states and 1557 transitions. [2020-11-30 00:59:01,780 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-11-30 00:59:01,780 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1557 transitions. [2020-11-30 00:59:01,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-11-30 00:59:01,784 INFO L414 BasicCegarLoop]: Found error trace [2020-11-30 00:59:01,785 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-30 00:59:02,009 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-11-30 00:59:02,010 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-11-30 00:59:02,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-11-30 00:59:02,010 INFO L82 PathProgramCache]: Analyzing trace with hash -361097061, now seen corresponding path program 1 times [2020-11-30 00:59:02,010 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-11-30 00:59:02,011 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1423890626] [2020-11-30 00:59:02,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-11-30 00:59:02,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:59:02,067 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:59:02,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-11-30 00:59:02,112 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-11-30 00:59:02,238 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-11-30 00:59:02,238 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-11-30 00:59:02,238 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-11-30 00:59:02,546 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 30.11 12:59:02 BoogieIcfgContainer [2020-11-30 00:59:02,546 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-11-30 00:59:02,547 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-11-30 00:59:02,547 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-11-30 00:59:02,547 INFO L275 PluginConnector]: Witness Printer initialized [2020-11-30 00:59:02,548 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 30.11 12:58:44" (3/4) ... [2020-11-30 00:59:02,551 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-11-30 00:59:02,830 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_cb5b2489-8663-4bfb-907e-2f8752c322a7/bin/uautomizer/witness.graphml [2020-11-30 00:59:02,830 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-11-30 00:59:02,832 INFO L168 Benchmark]: Toolchain (without parser) took 20103.31 ms. Allocated memory was 94.4 MB in the beginning and 998.2 MB in the end (delta: 903.9 MB). Free memory was 58.1 MB in the beginning and 665.9 MB in the end (delta: -607.8 MB). Peak memory consumption was 295.5 MB. Max. memory is 16.1 GB. [2020-11-30 00:59:02,833 INFO L168 Benchmark]: CDTParser took 0.41 ms. Allocated memory is still 94.4 MB. Free memory is still 74.2 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:59:02,834 INFO L168 Benchmark]: CACSL2BoogieTranslator took 723.81 ms. Allocated memory is still 94.4 MB. Free memory was 57.9 MB in the beginning and 67.7 MB in the end (delta: -9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 16.1 GB. [2020-11-30 00:59:02,835 INFO L168 Benchmark]: Boogie Procedure Inliner took 111.26 ms. Allocated memory is still 94.4 MB. Free memory was 67.7 MB in the beginning and 65.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-11-30 00:59:02,835 INFO L168 Benchmark]: Boogie Preprocessor took 63.93 ms. Allocated memory is still 94.4 MB. Free memory was 65.3 MB in the beginning and 63.5 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-11-30 00:59:02,835 INFO L168 Benchmark]: RCFGBuilder took 987.55 ms. Allocated memory was 94.4 MB in the beginning and 119.5 MB in the end (delta: 25.2 MB). Free memory was 63.5 MB in the beginning and 77.0 MB in the end (delta: -13.5 MB). Peak memory consumption was 21.6 MB. Max. memory is 16.1 GB. [2020-11-30 00:59:02,836 INFO L168 Benchmark]: TraceAbstraction took 17923.83 ms. Allocated memory was 119.5 MB in the beginning and 998.2 MB in the end (delta: 878.7 MB). Free memory was 76.4 MB in the beginning and 695.5 MB in the end (delta: -619.1 MB). Peak memory consumption was 259.7 MB. Max. memory is 16.1 GB. [2020-11-30 00:59:02,837 INFO L168 Benchmark]: Witness Printer took 283.36 ms. Allocated memory is still 998.2 MB. Free memory was 695.5 MB in the beginning and 665.9 MB in the end (delta: 29.6 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2020-11-30 00:59:02,839 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.41 ms. Allocated memory is still 94.4 MB. Free memory is still 74.2 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 723.81 ms. Allocated memory is still 94.4 MB. Free memory was 57.9 MB in the beginning and 67.7 MB in the end (delta: -9.8 MB). Peak memory consumption was 9.8 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 111.26 ms. Allocated memory is still 94.4 MB. Free memory was 67.7 MB in the beginning and 65.3 MB in the end (delta: 2.4 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 63.93 ms. Allocated memory is still 94.4 MB. Free memory was 65.3 MB in the beginning and 63.5 MB in the end (delta: 1.8 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 987.55 ms. Allocated memory was 94.4 MB in the beginning and 119.5 MB in the end (delta: 25.2 MB). Free memory was 63.5 MB in the beginning and 77.0 MB in the end (delta: -13.5 MB). Peak memory consumption was 21.6 MB. Max. memory is 16.1 GB. * TraceAbstraction took 17923.83 ms. Allocated memory was 119.5 MB in the beginning and 998.2 MB in the end (delta: 878.7 MB). Free memory was 76.4 MB in the beginning and 695.5 MB in the end (delta: -619.1 MB). Peak memory consumption was 259.7 MB. Max. memory is 16.1 GB. * Witness Printer took 283.36 ms. Allocated memory is still 998.2 MB. Free memory was 695.5 MB in the beginning and 665.9 MB in the end (delta: 29.6 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: 17.5s, OverallIterations: 24, TraceHistogramMax: 6, AutomataDifference: 8.4s, 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.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 170 SyntacticMatches, 2 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.8s 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: 5.3s AutomataMinimizationTime, 23 MinimizatonAttempts, 7372 StatesRemovedByMinimization, 21 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 1.5s 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...