./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 69874e26 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_c35ce62f-e821-4107-8ecc-c33aca067cab/bin/uautomizer/data/config -Xmx15G -Xms4m -jar /tmp/vcloud-vcloud-master/worker/run_dir_c35ce62f-e821-4107-8ecc-c33aca067cab/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_c35ce62f-e821-4107-8ecc-c33aca067cab/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_c35ce62f-e821-4107-8ecc-c33aca067cab/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/kundu1.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_c35ce62f-e821-4107-8ecc-c33aca067cab/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_c35ce62f-e821-4107-8ecc-c33aca067cab/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-69874e2 [2020-12-01 16:01:08,637 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-12-01 16:01:08,640 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-12-01 16:01:08,702 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-12-01 16:01:08,703 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-12-01 16:01:08,704 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-12-01 16:01:08,728 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-12-01 16:01:08,744 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-12-01 16:01:08,747 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-12-01 16:01:08,749 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-12-01 16:01:08,750 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-12-01 16:01:08,752 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-12-01 16:01:08,753 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-12-01 16:01:08,754 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-12-01 16:01:08,756 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-12-01 16:01:08,758 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-12-01 16:01:08,759 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-12-01 16:01:08,761 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-12-01 16:01:08,764 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-12-01 16:01:08,767 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-12-01 16:01:08,769 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-12-01 16:01:08,771 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-12-01 16:01:08,773 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-12-01 16:01:08,775 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-12-01 16:01:08,779 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-12-01 16:01:08,780 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-12-01 16:01:08,780 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-12-01 16:01:08,782 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-12-01 16:01:08,783 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-12-01 16:01:08,784 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-12-01 16:01:08,785 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-12-01 16:01:08,786 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-12-01 16:01:08,788 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-12-01 16:01:08,789 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-12-01 16:01:08,791 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-12-01 16:01:08,791 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-12-01 16:01:08,792 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-12-01 16:01:08,793 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-12-01 16:01:08,793 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-12-01 16:01:08,795 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-12-01 16:01:08,796 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-12-01 16:01:08,797 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_c35ce62f-e821-4107-8ecc-c33aca067cab/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-12-01 16:01:08,826 INFO L113 SettingsManager]: Loading preferences was successful [2020-12-01 16:01:08,826 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-12-01 16:01:08,828 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-12-01 16:01:08,828 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-12-01 16:01:08,828 INFO L138 SettingsManager]: * Use SBE=true [2020-12-01 16:01:08,829 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-12-01 16:01:08,829 INFO L138 SettingsManager]: * sizeof long=4 [2020-12-01 16:01:08,829 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-12-01 16:01:08,830 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-12-01 16:01:08,830 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-12-01 16:01:08,831 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-12-01 16:01:08,831 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-12-01 16:01:08,831 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-12-01 16:01:08,832 INFO L138 SettingsManager]: * sizeof long double=12 [2020-12-01 16:01:08,832 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-12-01 16:01:08,832 INFO L138 SettingsManager]: * Use constant arrays=true [2020-12-01 16:01:08,833 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-12-01 16:01:08,833 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-12-01 16:01:08,833 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-12-01 16:01:08,834 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-12-01 16:01:08,834 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-12-01 16:01:08,834 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-12-01 16:01:08,835 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-12-01 16:01:08,835 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-12-01 16:01:08,835 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-12-01 16:01:08,836 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-12-01 16:01:08,836 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-12-01 16:01:08,837 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-12-01 16:01:08,837 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-12-01 16:01:08,837 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_c35ce62f-e821-4107-8ecc-c33aca067cab/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_c35ce62f-e821-4107-8ecc-c33aca067cab/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-12-01 16:01:09,128 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-12-01 16:01:09,180 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-12-01 16:01:09,185 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-12-01 16:01:09,187 INFO L271 PluginConnector]: Initializing CDTParser... [2020-12-01 16:01:09,189 INFO L275 PluginConnector]: CDTParser initialized [2020-12-01 16:01:09,190 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_c35ce62f-e821-4107-8ecc-c33aca067cab/bin/uautomizer/../../sv-benchmarks/c/systemc/kundu1.cil.c [2020-12-01 16:01:09,293 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c35ce62f-e821-4107-8ecc-c33aca067cab/bin/uautomizer/data/818140c62/dead88e6cd50435b8bd105bdbcec6f1b/FLAGd43d9e0af [2020-12-01 16:01:09,909 INFO L306 CDTParser]: Found 1 translation units. [2020-12-01 16:01:09,909 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_c35ce62f-e821-4107-8ecc-c33aca067cab/sv-benchmarks/c/systemc/kundu1.cil.c [2020-12-01 16:01:09,920 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_c35ce62f-e821-4107-8ecc-c33aca067cab/bin/uautomizer/data/818140c62/dead88e6cd50435b8bd105bdbcec6f1b/FLAGd43d9e0af [2020-12-01 16:01:10,203 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_c35ce62f-e821-4107-8ecc-c33aca067cab/bin/uautomizer/data/818140c62/dead88e6cd50435b8bd105bdbcec6f1b [2020-12-01 16:01:10,206 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-12-01 16:01:10,208 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-12-01 16:01:10,215 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-12-01 16:01:10,215 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-12-01 16:01:10,219 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-12-01 16:01:10,220 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:01:10" (1/1) ... [2020-12-01 16:01:10,223 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@669a4f9d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:01:10, skipping insertion in model container [2020-12-01 16:01:10,223 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 01.12 04:01:10" (1/1) ... [2020-12-01 16:01:10,232 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-12-01 16:01:10,288 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-12-01 16:01:10,542 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 16:01:10,554 INFO L203 MainTranslator]: Completed pre-run [2020-12-01 16:01:10,600 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-12-01 16:01:10,626 INFO L208 MainTranslator]: Completed translation [2020-12-01 16:01:10,627 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:01:10 WrapperNode [2020-12-01 16:01:10,627 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-12-01 16:01:10,629 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-12-01 16:01:10,629 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-12-01 16:01:10,629 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-12-01 16:01:10,644 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:01:10" (1/1) ... [2020-12-01 16:01:10,667 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:01:10" (1/1) ... [2020-12-01 16:01:10,709 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-12-01 16:01:10,710 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-12-01 16:01:10,711 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-12-01 16:01:10,711 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-12-01 16:01:10,722 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:01:10" (1/1) ... [2020-12-01 16:01:10,722 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:01:10" (1/1) ... [2020-12-01 16:01:10,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:01:10" (1/1) ... [2020-12-01 16:01:10,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:01:10" (1/1) ... [2020-12-01 16:01:10,735 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:01:10" (1/1) ... [2020-12-01 16:01:10,744 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:01:10" (1/1) ... [2020-12-01 16:01:10,748 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:01:10" (1/1) ... [2020-12-01 16:01:10,753 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-12-01 16:01:10,754 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-12-01 16:01:10,755 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-12-01 16:01:10,755 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-12-01 16:01:10,767 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:01:10" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c35ce62f-e821-4107-8ecc-c33aca067cab/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-12-01 16:01:10,851 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-12-01 16:01:10,851 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2020-12-01 16:01:10,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-12-01 16:01:10,853 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-12-01 16:01:11,572 INFO L293 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-12-01 16:01:11,580 INFO L298 CfgBuilder]: Removed 78 assume(true) statements. [2020-12-01 16:01:11,582 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:01:11 BoogieIcfgContainer [2020-12-01 16:01:11,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-12-01 16:01:11,584 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-12-01 16:01:11,584 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-12-01 16:01:11,601 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-12-01 16:01:11,602 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 01.12 04:01:10" (1/3) ... [2020-12-01 16:01:11,603 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5ed4eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 04:01:11, skipping insertion in model container [2020-12-01 16:01:11,603 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 01.12 04:01:10" (2/3) ... [2020-12-01 16:01:11,604 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6b5ed4eb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 01.12 04:01:11, skipping insertion in model container [2020-12-01 16:01:11,604 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:01:11" (3/3) ... [2020-12-01 16:01:11,606 INFO L111 eAbstractionObserver]: Analyzing ICFG kundu1.cil.c [2020-12-01 16:01:11,641 INFO L180 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-12-01 16:01:11,646 INFO L192 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2020-12-01 16:01:11,675 INFO L253 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2020-12-01 16:01:11,702 INFO L377 AbstractCegarLoop]: Interprodecural is true [2020-12-01 16:01:11,702 INFO L378 AbstractCegarLoop]: Hoare is true [2020-12-01 16:01:11,702 INFO L379 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-12-01 16:01:11,703 INFO L380 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-12-01 16:01:11,703 INFO L381 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-12-01 16:01:11,703 INFO L382 AbstractCegarLoop]: Difference is false [2020-12-01 16:01:11,703 INFO L383 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-12-01 16:01:11,704 INFO L387 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-12-01 16:01:11,724 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states. [2020-12-01 16:01:11,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-01 16:01:11,736 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 16:01:11,738 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-12-01 16:01:11,738 INFO L429 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 16:01:11,745 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:01:11,746 INFO L82 PathProgramCache]: Analyzing trace with hash -1357048476, now seen corresponding path program 1 times [2020-12-01 16:01:11,763 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 16:01:11,765 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [23648405] [2020-12-01 16:01:11,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 16:01:11,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:01:11,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:01:11,996 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [23648405] [2020-12-01 16:01:11,997 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 16:01:11,997 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 16:01:11,998 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [343381067] [2020-12-01 16:01:12,007 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 16:01:12,008 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 16:01:12,030 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 16:01:12,031 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 16:01:12,032 INFO L87 Difference]: Start difference. First operand 120 states. Second operand 3 states. [2020-12-01 16:01:12,100 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 16:01:12,100 INFO L93 Difference]: Finished difference Result 231 states and 349 transitions. [2020-12-01 16:01:12,101 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 16:01:12,103 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-12-01 16:01:12,103 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 16:01:12,115 INFO L225 Difference]: With dead ends: 231 [2020-12-01 16:01:12,116 INFO L226 Difference]: Without dead ends: 112 [2020-12-01 16:01:12,120 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-12-01 16:01:12,140 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2020-12-01 16:01:12,169 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2020-12-01 16:01:12,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 112 states. [2020-12-01 16:01:12,174 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 162 transitions. [2020-12-01 16:01:12,176 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 162 transitions. Word has length 33 [2020-12-01 16:01:12,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 16:01:12,176 INFO L481 AbstractCegarLoop]: Abstraction has 112 states and 162 transitions. [2020-12-01 16:01:12,176 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 16:01:12,177 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 162 transitions. [2020-12-01 16:01:12,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-01 16:01:12,178 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 16:01:12,179 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-12-01 16:01:12,179 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-12-01 16:01:12,179 INFO L429 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 16:01:12,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:01:12,180 INFO L82 PathProgramCache]: Analyzing trace with hash 1551715426, now seen corresponding path program 1 times [2020-12-01 16:01:12,181 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 16:01:12,181 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1067028688] [2020-12-01 16:01:12,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 16:01:12,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:01:12,256 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:01:12,257 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1067028688] [2020-12-01 16:01:12,257 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 16:01:12,258 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 16:01:12,258 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2118591559] [2020-12-01 16:01:12,260 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 16:01:12,260 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 16:01:12,261 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 16:01:12,262 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 16:01:12,262 INFO L87 Difference]: Start difference. First operand 112 states and 162 transitions. Second operand 3 states. [2020-12-01 16:01:12,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 16:01:12,359 INFO L93 Difference]: Finished difference Result 304 states and 439 transitions. [2020-12-01 16:01:12,359 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 16:01:12,360 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 33 [2020-12-01 16:01:12,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 16:01:12,363 INFO L225 Difference]: With dead ends: 304 [2020-12-01 16:01:12,363 INFO L226 Difference]: Without dead ends: 199 [2020-12-01 16:01:12,365 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-12-01 16:01:12,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2020-12-01 16:01:12,406 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 189. [2020-12-01 16:01:12,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 189 states. [2020-12-01 16:01:12,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 189 states to 189 states and 273 transitions. [2020-12-01 16:01:12,426 INFO L78 Accepts]: Start accepts. Automaton has 189 states and 273 transitions. Word has length 33 [2020-12-01 16:01:12,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 16:01:12,426 INFO L481 AbstractCegarLoop]: Abstraction has 189 states and 273 transitions. [2020-12-01 16:01:12,426 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 16:01:12,427 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 273 transitions. [2020-12-01 16:01:12,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-01 16:01:12,428 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 16:01:12,428 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-12-01 16:01:12,429 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-12-01 16:01:12,429 INFO L429 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 16:01:12,430 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:01:12,430 INFO L82 PathProgramCache]: Analyzing trace with hash -120802205, now seen corresponding path program 1 times [2020-12-01 16:01:12,430 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 16:01:12,437 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439560832] [2020-12-01 16:01:12,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 16:01:12,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:01:12,570 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:01:12,571 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439560832] [2020-12-01 16:01:12,572 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 16:01:12,572 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 16:01:12,573 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108688676] [2020-12-01 16:01:12,575 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 16:01:12,577 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 16:01:12,579 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 16:01:12,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-01 16:01:12,585 INFO L87 Difference]: Start difference. First operand 189 states and 273 transitions. Second operand 5 states. [2020-12-01 16:01:12,784 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 16:01:12,784 INFO L93 Difference]: Finished difference Result 591 states and 861 transitions. [2020-12-01 16:01:12,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-01 16:01:12,785 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 33 [2020-12-01 16:01:12,785 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 16:01:12,789 INFO L225 Difference]: With dead ends: 591 [2020-12-01 16:01:12,790 INFO L226 Difference]: Without dead ends: 413 [2020-12-01 16:01:12,792 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-12-01 16:01:12,794 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 413 states. [2020-12-01 16:01:12,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 413 to 195. [2020-12-01 16:01:12,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 195 states. [2020-12-01 16:01:12,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 276 transitions. [2020-12-01 16:01:12,870 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 276 transitions. Word has length 33 [2020-12-01 16:01:12,870 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 16:01:12,870 INFO L481 AbstractCegarLoop]: Abstraction has 195 states and 276 transitions. [2020-12-01 16:01:12,871 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 16:01:12,871 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 276 transitions. [2020-12-01 16:01:12,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2020-12-01 16:01:12,874 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 16:01:12,874 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-12-01 16:01:12,875 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-12-01 16:01:12,875 INFO L429 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 16:01:12,876 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:01:12,878 INFO L82 PathProgramCache]: Analyzing trace with hash -1926240539, now seen corresponding path program 1 times [2020-12-01 16:01:12,878 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 16:01:12,879 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769647160] [2020-12-01 16:01:12,879 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 16:01:12,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:01:12,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:01:12,985 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769647160] [2020-12-01 16:01:12,985 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 16:01:12,985 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 16:01:12,985 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289692714] [2020-12-01 16:01:12,986 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 16:01:12,986 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 16:01:12,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 16:01:12,987 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 16:01:12,987 INFO L87 Difference]: Start difference. First operand 195 states and 276 transitions. Second operand 4 states. [2020-12-01 16:01:13,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 16:01:13,193 INFO L93 Difference]: Finished difference Result 621 states and 872 transitions. [2020-12-01 16:01:13,193 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 16:01:13,194 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 33 [2020-12-01 16:01:13,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 16:01:13,198 INFO L225 Difference]: With dead ends: 621 [2020-12-01 16:01:13,198 INFO L226 Difference]: Without dead ends: 439 [2020-12-01 16:01:13,202 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-12-01 16:01:13,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2020-12-01 16:01:13,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 333. [2020-12-01 16:01:13,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 333 states. [2020-12-01 16:01:13,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 464 transitions. [2020-12-01 16:01:13,274 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 464 transitions. Word has length 33 [2020-12-01 16:01:13,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 16:01:13,274 INFO L481 AbstractCegarLoop]: Abstraction has 333 states and 464 transitions. [2020-12-01 16:01:13,274 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 16:01:13,275 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 464 transitions. [2020-12-01 16:01:13,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-01 16:01:13,277 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 16:01:13,277 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-12-01 16:01:13,277 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-12-01 16:01:13,278 INFO L429 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 16:01:13,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:01:13,279 INFO L82 PathProgramCache]: Analyzing trace with hash -1179728243, now seen corresponding path program 1 times [2020-12-01 16:01:13,280 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 16:01:13,280 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1630268091] [2020-12-01 16:01:13,280 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 16:01:13,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:01:13,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:01:13,408 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1630268091] [2020-12-01 16:01:13,409 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 16:01:13,409 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 16:01:13,409 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1331851725] [2020-12-01 16:01:13,410 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 16:01:13,410 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 16:01:13,411 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 16:01:13,411 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-01 16:01:13,412 INFO L87 Difference]: Start difference. First operand 333 states and 464 transitions. Second operand 5 states. [2020-12-01 16:01:13,584 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 16:01:13,584 INFO L93 Difference]: Finished difference Result 1126 states and 1579 transitions. [2020-12-01 16:01:13,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-12-01 16:01:13,585 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 34 [2020-12-01 16:01:13,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 16:01:13,592 INFO L225 Difference]: With dead ends: 1126 [2020-12-01 16:01:13,593 INFO L226 Difference]: Without dead ends: 812 [2020-12-01 16:01:13,597 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-12-01 16:01:13,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 812 states. [2020-12-01 16:01:13,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 812 to 360. [2020-12-01 16:01:13,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2020-12-01 16:01:13,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 491 transitions. [2020-12-01 16:01:13,675 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 491 transitions. Word has length 34 [2020-12-01 16:01:13,676 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 16:01:13,676 INFO L481 AbstractCegarLoop]: Abstraction has 360 states and 491 transitions. [2020-12-01 16:01:13,677 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 16:01:13,677 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 491 transitions. [2020-12-01 16:01:13,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2020-12-01 16:01:13,678 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 16:01:13,679 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-12-01 16:01:13,679 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-12-01 16:01:13,679 INFO L429 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 16:01:13,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:01:13,680 INFO L82 PathProgramCache]: Analyzing trace with hash 1526891151, now seen corresponding path program 1 times [2020-12-01 16:01:13,680 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 16:01:13,680 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615199415] [2020-12-01 16:01:13,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 16:01:13,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:01:13,760 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:01:13,761 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615199415] [2020-12-01 16:01:13,761 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 16:01:13,761 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 16:01:13,762 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981746143] [2020-12-01 16:01:13,762 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 16:01:13,763 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 16:01:13,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 16:01:13,764 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 16:01:13,764 INFO L87 Difference]: Start difference. First operand 360 states and 491 transitions. Second operand 4 states. [2020-12-01 16:01:13,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 16:01:13,947 INFO L93 Difference]: Finished difference Result 1662 states and 2286 transitions. [2020-12-01 16:01:13,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 16:01:13,948 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 34 [2020-12-01 16:01:13,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 16:01:13,958 INFO L225 Difference]: With dead ends: 1662 [2020-12-01 16:01:13,958 INFO L226 Difference]: Without dead ends: 1324 [2020-12-01 16:01:13,960 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-12-01 16:01:13,963 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1324 states. [2020-12-01 16:01:14,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1324 to 674. [2020-12-01 16:01:14,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 674 states. [2020-12-01 16:01:14,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 674 states to 674 states and 923 transitions. [2020-12-01 16:01:14,048 INFO L78 Accepts]: Start accepts. Automaton has 674 states and 923 transitions. Word has length 34 [2020-12-01 16:01:14,051 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 16:01:14,054 INFO L481 AbstractCegarLoop]: Abstraction has 674 states and 923 transitions. [2020-12-01 16:01:14,054 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 16:01:14,055 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 923 transitions. [2020-12-01 16:01:14,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2020-12-01 16:01:14,058 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 16:01:14,058 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-12-01 16:01:14,059 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-12-01 16:01:14,059 INFO L429 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 16:01:14,060 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:01:14,061 INFO L82 PathProgramCache]: Analyzing trace with hash 678817943, now seen corresponding path program 1 times [2020-12-01 16:01:14,061 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 16:01:14,061 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835001374] [2020-12-01 16:01:14,069 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 16:01:14,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:01:14,195 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:01:14,196 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835001374] [2020-12-01 16:01:14,196 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 16:01:14,197 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 16:01:14,197 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [914714820] [2020-12-01 16:01:14,198 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 16:01:14,198 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 16:01:14,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 16:01:14,200 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-12-01 16:01:14,200 INFO L87 Difference]: Start difference. First operand 674 states and 923 transitions. Second operand 5 states. [2020-12-01 16:01:14,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 16:01:14,393 INFO L93 Difference]: Finished difference Result 1497 states and 2054 transitions. [2020-12-01 16:01:14,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 16:01:14,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 41 [2020-12-01 16:01:14,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 16:01:14,401 INFO L225 Difference]: With dead ends: 1497 [2020-12-01 16:01:14,401 INFO L226 Difference]: Without dead ends: 845 [2020-12-01 16:01:14,403 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-12-01 16:01:14,405 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 845 states. [2020-12-01 16:01:14,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 845 to 837. [2020-12-01 16:01:14,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 837 states. [2020-12-01 16:01:14,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 837 states to 837 states and 1144 transitions. [2020-12-01 16:01:14,495 INFO L78 Accepts]: Start accepts. Automaton has 837 states and 1144 transitions. Word has length 41 [2020-12-01 16:01:14,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 16:01:14,496 INFO L481 AbstractCegarLoop]: Abstraction has 837 states and 1144 transitions. [2020-12-01 16:01:14,496 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 16:01:14,496 INFO L276 IsEmpty]: Start isEmpty. Operand 837 states and 1144 transitions. [2020-12-01 16:01:14,505 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2020-12-01 16:01:14,505 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 16:01:14,505 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-12-01 16:01:14,506 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-12-01 16:01:14,506 INFO L429 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 16:01:14,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:01:14,507 INFO L82 PathProgramCache]: Analyzing trace with hash 1967171351, now seen corresponding path program 1 times [2020-12-01 16:01:14,507 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 16:01:14,508 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [614080064] [2020-12-01 16:01:14,508 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 16:01:14,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:01:14,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:01:14,613 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [614080064] [2020-12-01 16:01:14,613 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 16:01:14,613 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2020-12-01 16:01:14,614 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272584507] [2020-12-01 16:01:14,614 INFO L461 AbstractCegarLoop]: Interpolant automaton has 6 states [2020-12-01 16:01:14,615 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 16:01:14,615 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2020-12-01 16:01:14,616 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2020-12-01 16:01:14,616 INFO L87 Difference]: Start difference. First operand 837 states and 1144 transitions. Second operand 6 states. [2020-12-01 16:01:14,986 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 16:01:14,986 INFO L93 Difference]: Finished difference Result 3287 states and 4502 transitions. [2020-12-01 16:01:14,987 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-01 16:01:14,987 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 44 [2020-12-01 16:01:14,990 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 16:01:15,006 INFO L225 Difference]: With dead ends: 3287 [2020-12-01 16:01:15,007 INFO L226 Difference]: Without dead ends: 2472 [2020-12-01 16:01:15,010 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-12-01 16:01:15,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2472 states. [2020-12-01 16:01:15,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2472 to 1321. [2020-12-01 16:01:15,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1321 states. [2020-12-01 16:01:15,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1321 states to 1321 states and 1806 transitions. [2020-12-01 16:01:15,177 INFO L78 Accepts]: Start accepts. Automaton has 1321 states and 1806 transitions. Word has length 44 [2020-12-01 16:01:15,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 16:01:15,179 INFO L481 AbstractCegarLoop]: Abstraction has 1321 states and 1806 transitions. [2020-12-01 16:01:15,179 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2020-12-01 16:01:15,180 INFO L276 IsEmpty]: Start isEmpty. Operand 1321 states and 1806 transitions. [2020-12-01 16:01:15,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2020-12-01 16:01:15,181 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 16:01:15,181 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-12-01 16:01:15,181 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-12-01 16:01:15,183 INFO L429 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 16:01:15,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:01:15,184 INFO L82 PathProgramCache]: Analyzing trace with hash -477389262, now seen corresponding path program 1 times [2020-12-01 16:01:15,184 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 16:01:15,185 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119329670] [2020-12-01 16:01:15,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 16:01:15,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:01:15,249 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 16:01:15,249 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119329670] [2020-12-01 16:01:15,250 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 16:01:15,250 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 16:01:15,251 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103340191] [2020-12-01 16:01:15,252 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 16:01:15,256 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 16:01:15,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 16:01:15,259 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 16:01:15,260 INFO L87 Difference]: Start difference. First operand 1321 states and 1806 transitions. Second operand 3 states. [2020-12-01 16:01:15,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 16:01:15,536 INFO L93 Difference]: Finished difference Result 3798 states and 5147 transitions. [2020-12-01 16:01:15,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 16:01:15,536 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 46 [2020-12-01 16:01:15,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 16:01:15,551 INFO L225 Difference]: With dead ends: 3798 [2020-12-01 16:01:15,552 INFO L226 Difference]: Without dead ends: 2499 [2020-12-01 16:01:15,554 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-12-01 16:01:15,558 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2499 states. [2020-12-01 16:01:15,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2499 to 2495. [2020-12-01 16:01:15,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2495 states. [2020-12-01 16:01:15,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2495 states to 2495 states and 3301 transitions. [2020-12-01 16:01:15,774 INFO L78 Accepts]: Start accepts. Automaton has 2495 states and 3301 transitions. Word has length 46 [2020-12-01 16:01:15,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 16:01:15,775 INFO L481 AbstractCegarLoop]: Abstraction has 2495 states and 3301 transitions. [2020-12-01 16:01:15,775 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 16:01:15,775 INFO L276 IsEmpty]: Start isEmpty. Operand 2495 states and 3301 transitions. [2020-12-01 16:01:15,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-01 16:01:15,777 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 16:01:15,777 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-12-01 16:01:15,777 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2020-12-01 16:01:15,778 INFO L429 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 16:01:15,778 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:01:15,778 INFO L82 PathProgramCache]: Analyzing trace with hash -162601451, now seen corresponding path program 1 times [2020-12-01 16:01:15,778 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 16:01:15,779 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [732376140] [2020-12-01 16:01:15,779 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 16:01:15,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:01:15,840 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:01:15,840 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [732376140] [2020-12-01 16:01:15,840 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 16:01:15,841 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 16:01:15,841 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718412933] [2020-12-01 16:01:15,841 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 16:01:15,842 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 16:01:15,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 16:01:15,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 16:01:15,843 INFO L87 Difference]: Start difference. First operand 2495 states and 3301 transitions. Second operand 3 states. [2020-12-01 16:01:16,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 16:01:16,250 INFO L93 Difference]: Finished difference Result 7169 states and 9443 transitions. [2020-12-01 16:01:16,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 16:01:16,251 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 48 [2020-12-01 16:01:16,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 16:01:16,276 INFO L225 Difference]: With dead ends: 7169 [2020-12-01 16:01:16,276 INFO L226 Difference]: Without dead ends: 4714 [2020-12-01 16:01:16,280 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-12-01 16:01:16,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4714 states. [2020-12-01 16:01:16,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4714 to 4712. [2020-12-01 16:01:16,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4712 states. [2020-12-01 16:01:16,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4712 states to 4712 states and 6108 transitions. [2020-12-01 16:01:16,647 INFO L78 Accepts]: Start accepts. Automaton has 4712 states and 6108 transitions. Word has length 48 [2020-12-01 16:01:16,647 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 16:01:16,647 INFO L481 AbstractCegarLoop]: Abstraction has 4712 states and 6108 transitions. [2020-12-01 16:01:16,648 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 16:01:16,648 INFO L276 IsEmpty]: Start isEmpty. Operand 4712 states and 6108 transitions. [2020-12-01 16:01:16,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2020-12-01 16:01:16,649 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 16:01:16,649 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-12-01 16:01:16,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2020-12-01 16:01:16,650 INFO L429 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 16:01:16,651 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:01:16,651 INFO L82 PathProgramCache]: Analyzing trace with hash 297274720, now seen corresponding path program 1 times [2020-12-01 16:01:16,651 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 16:01:16,652 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1104111620] [2020-12-01 16:01:16,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 16:01:16,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:01:16,714 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 11 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:01:16,715 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1104111620] [2020-12-01 16:01:16,715 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 16:01:16,715 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 16:01:16,715 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1489998128] [2020-12-01 16:01:16,717 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 16:01:16,717 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 16:01:16,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 16:01:16,719 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 16:01:16,720 INFO L87 Difference]: Start difference. First operand 4712 states and 6108 transitions. Second operand 4 states. [2020-12-01 16:01:17,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 16:01:17,380 INFO L93 Difference]: Finished difference Result 11359 states and 14646 transitions. [2020-12-01 16:01:17,380 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 16:01:17,380 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 48 [2020-12-01 16:01:17,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 16:01:17,415 INFO L225 Difference]: With dead ends: 11359 [2020-12-01 16:01:17,415 INFO L226 Difference]: Without dead ends: 6671 [2020-12-01 16:01:17,422 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-12-01 16:01:17,431 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6671 states. [2020-12-01 16:01:17,899 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6671 to 5850. [2020-12-01 16:01:17,899 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5850 states. [2020-12-01 16:01:17,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5850 states to 5850 states and 7394 transitions. [2020-12-01 16:01:17,922 INFO L78 Accepts]: Start accepts. Automaton has 5850 states and 7394 transitions. Word has length 48 [2020-12-01 16:01:17,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 16:01:17,923 INFO L481 AbstractCegarLoop]: Abstraction has 5850 states and 7394 transitions. [2020-12-01 16:01:17,923 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 16:01:17,924 INFO L276 IsEmpty]: Start isEmpty. Operand 5850 states and 7394 transitions. [2020-12-01 16:01:17,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2020-12-01 16:01:17,925 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 16:01:17,925 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-12-01 16:01:17,925 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2020-12-01 16:01:17,926 INFO L429 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 16:01:17,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:01:17,926 INFO L82 PathProgramCache]: Analyzing trace with hash -2096931086, now seen corresponding path program 1 times [2020-12-01 16:01:17,927 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 16:01:17,927 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1997266003] [2020-12-01 16:01:17,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 16:01:17,970 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:01:17,992 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 12 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:01:17,993 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1997266003] [2020-12-01 16:01:17,993 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 16:01:17,993 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 16:01:17,993 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1359123311] [2020-12-01 16:01:17,994 INFO L461 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-12-01 16:01:17,994 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 16:01:17,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-12-01 16:01:17,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-12-01 16:01:17,995 INFO L87 Difference]: Start difference. First operand 5850 states and 7394 transitions. Second operand 4 states. [2020-12-01 16:01:18,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 16:01:18,461 INFO L93 Difference]: Finished difference Result 10947 states and 13872 transitions. [2020-12-01 16:01:18,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 16:01:18,462 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 49 [2020-12-01 16:01:18,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 16:01:18,489 INFO L225 Difference]: With dead ends: 10947 [2020-12-01 16:01:18,489 INFO L226 Difference]: Without dead ends: 5013 [2020-12-01 16:01:18,497 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-12-01 16:01:18,504 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5013 states. [2020-12-01 16:01:18,906 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5013 to 4814. [2020-12-01 16:01:18,906 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4814 states. [2020-12-01 16:01:18,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4814 states to 4814 states and 5985 transitions. [2020-12-01 16:01:18,927 INFO L78 Accepts]: Start accepts. Automaton has 4814 states and 5985 transitions. Word has length 49 [2020-12-01 16:01:18,927 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 16:01:18,927 INFO L481 AbstractCegarLoop]: Abstraction has 4814 states and 5985 transitions. [2020-12-01 16:01:18,927 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-12-01 16:01:18,927 INFO L276 IsEmpty]: Start isEmpty. Operand 4814 states and 5985 transitions. [2020-12-01 16:01:18,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 84 [2020-12-01 16:01:18,932 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 16:01:18,932 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-12-01 16:01:18,932 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2020-12-01 16:01:18,932 INFO L429 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 16:01:18,933 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:01:18,933 INFO L82 PathProgramCache]: Analyzing trace with hash 358168785, now seen corresponding path program 1 times [2020-12-01 16:01:18,933 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 16:01:18,933 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638307109] [2020-12-01 16:01:18,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 16:01:18,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:01:19,004 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 22 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2020-12-01 16:01:19,004 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638307109] [2020-12-01 16:01:19,004 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 16:01:19,004 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 16:01:19,005 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [793500526] [2020-12-01 16:01:19,006 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 16:01:19,006 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 16:01:19,007 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 16:01:19,007 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-01 16:01:19,007 INFO L87 Difference]: Start difference. First operand 4814 states and 5985 transitions. Second operand 5 states. [2020-12-01 16:01:19,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 16:01:19,392 INFO L93 Difference]: Finished difference Result 8526 states and 10629 transitions. [2020-12-01 16:01:19,392 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 16:01:19,393 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 83 [2020-12-01 16:01:19,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 16:01:19,411 INFO L225 Difference]: With dead ends: 8526 [2020-12-01 16:01:19,412 INFO L226 Difference]: Without dead ends: 3744 [2020-12-01 16:01:19,419 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-12-01 16:01:19,424 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3744 states. [2020-12-01 16:01:19,691 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3744 to 3233. [2020-12-01 16:01:19,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3233 states. [2020-12-01 16:01:19,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3233 states to 3233 states and 4035 transitions. [2020-12-01 16:01:19,699 INFO L78 Accepts]: Start accepts. Automaton has 3233 states and 4035 transitions. Word has length 83 [2020-12-01 16:01:19,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 16:01:19,699 INFO L481 AbstractCegarLoop]: Abstraction has 3233 states and 4035 transitions. [2020-12-01 16:01:19,699 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 16:01:19,699 INFO L276 IsEmpty]: Start isEmpty. Operand 3233 states and 4035 transitions. [2020-12-01 16:01:19,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2020-12-01 16:01:19,708 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 16:01:19,708 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-12-01 16:01:19,708 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2020-12-01 16:01:19,708 INFO L429 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 16:01:19,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:01:19,709 INFO L82 PathProgramCache]: Analyzing trace with hash -1417804680, now seen corresponding path program 1 times [2020-12-01 16:01:19,709 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 16:01:19,714 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1872237762] [2020-12-01 16:01:19,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 16:01:19,726 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:01:19,743 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2020-12-01 16:01:19,744 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1872237762] [2020-12-01 16:01:19,744 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 16:01:19,744 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 16:01:19,744 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621872670] [2020-12-01 16:01:19,745 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 16:01:19,745 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 16:01:19,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 16:01:19,746 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 16:01:19,746 INFO L87 Difference]: Start difference. First operand 3233 states and 4035 transitions. Second operand 3 states. [2020-12-01 16:01:19,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 16:01:19,910 INFO L93 Difference]: Finished difference Result 3481 states and 4330 transitions. [2020-12-01 16:01:19,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 16:01:19,910 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 86 [2020-12-01 16:01:19,910 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 16:01:19,917 INFO L225 Difference]: With dead ends: 3481 [2020-12-01 16:01:19,917 INFO L226 Difference]: Without dead ends: 3217 [2020-12-01 16:01:19,919 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-12-01 16:01:19,923 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3217 states. [2020-12-01 16:01:20,152 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3217 to 3217. [2020-12-01 16:01:20,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3217 states. [2020-12-01 16:01:20,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3217 states to 3217 states and 4018 transitions. [2020-12-01 16:01:20,159 INFO L78 Accepts]: Start accepts. Automaton has 3217 states and 4018 transitions. Word has length 86 [2020-12-01 16:01:20,159 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 16:01:20,159 INFO L481 AbstractCegarLoop]: Abstraction has 3217 states and 4018 transitions. [2020-12-01 16:01:20,160 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 16:01:20,160 INFO L276 IsEmpty]: Start isEmpty. Operand 3217 states and 4018 transitions. [2020-12-01 16:01:20,162 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2020-12-01 16:01:20,162 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 16:01:20,163 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-12-01 16:01:20,163 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2020-12-01 16:01:20,163 INFO L429 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 16:01:20,163 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:01:20,164 INFO L82 PathProgramCache]: Analyzing trace with hash -402537650, now seen corresponding path program 1 times [2020-12-01 16:01:20,164 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 16:01:20,164 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537706980] [2020-12-01 16:01:20,164 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 16:01:20,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:01:20,233 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-01 16:01:20,234 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537706980] [2020-12-01 16:01:20,234 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 16:01:20,234 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 16:01:20,234 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [319109221] [2020-12-01 16:01:20,235 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 16:01:20,235 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 16:01:20,235 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 16:01:20,236 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 16:01:20,236 INFO L87 Difference]: Start difference. First operand 3217 states and 4018 transitions. Second operand 3 states. [2020-12-01 16:01:20,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 16:01:20,456 INFO L93 Difference]: Finished difference Result 3591 states and 4462 transitions. [2020-12-01 16:01:20,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 16:01:20,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2020-12-01 16:01:20,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 16:01:20,462 INFO L225 Difference]: With dead ends: 3591 [2020-12-01 16:01:20,462 INFO L226 Difference]: Without dead ends: 3202 [2020-12-01 16:01:20,464 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 16:01:20,468 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3202 states. [2020-12-01 16:01:20,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3202 to 3195. [2020-12-01 16:01:20,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3195 states. [2020-12-01 16:01:20,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3195 states to 3195 states and 3992 transitions. [2020-12-01 16:01:20,645 INFO L78 Accepts]: Start accepts. Automaton has 3195 states and 3992 transitions. Word has length 89 [2020-12-01 16:01:20,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 16:01:20,645 INFO L481 AbstractCegarLoop]: Abstraction has 3195 states and 3992 transitions. [2020-12-01 16:01:20,646 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 16:01:20,646 INFO L276 IsEmpty]: Start isEmpty. Operand 3195 states and 3992 transitions. [2020-12-01 16:01:20,648 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2020-12-01 16:01:20,649 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 16:01:20,649 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-12-01 16:01:20,649 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2020-12-01 16:01:20,649 INFO L429 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 16:01:20,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:01:20,650 INFO L82 PathProgramCache]: Analyzing trace with hash 1336538508, now seen corresponding path program 1 times [2020-12-01 16:01:20,650 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 16:01:20,650 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926630468] [2020-12-01 16:01:20,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 16:01:20,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:01:20,724 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-01 16:01:20,725 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926630468] [2020-12-01 16:01:20,725 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 16:01:20,725 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 16:01:20,725 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2049904358] [2020-12-01 16:01:20,726 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 16:01:20,726 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 16:01:20,726 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 16:01:20,727 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-01 16:01:20,727 INFO L87 Difference]: Start difference. First operand 3195 states and 3992 transitions. Second operand 5 states. [2020-12-01 16:01:21,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 16:01:21,056 INFO L93 Difference]: Finished difference Result 6859 states and 8520 transitions. [2020-12-01 16:01:21,056 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 16:01:21,057 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 95 [2020-12-01 16:01:21,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 16:01:21,065 INFO L225 Difference]: With dead ends: 6859 [2020-12-01 16:01:21,065 INFO L226 Difference]: Without dead ends: 3724 [2020-12-01 16:01:21,070 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-12-01 16:01:21,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3724 states. [2020-12-01 16:01:21,321 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3724 to 3073. [2020-12-01 16:01:21,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3073 states. [2020-12-01 16:01:21,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3073 states to 3073 states and 3805 transitions. [2020-12-01 16:01:21,325 INFO L78 Accepts]: Start accepts. Automaton has 3073 states and 3805 transitions. Word has length 95 [2020-12-01 16:01:21,326 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 16:01:21,326 INFO L481 AbstractCegarLoop]: Abstraction has 3073 states and 3805 transitions. [2020-12-01 16:01:21,326 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 16:01:21,326 INFO L276 IsEmpty]: Start isEmpty. Operand 3073 states and 3805 transitions. [2020-12-01 16:01:21,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 99 [2020-12-01 16:01:21,329 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 16:01:21,329 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-12-01 16:01:21,330 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2020-12-01 16:01:21,330 INFO L429 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 16:01:21,330 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:01:21,331 INFO L82 PathProgramCache]: Analyzing trace with hash 126172792, now seen corresponding path program 1 times [2020-12-01 16:01:21,331 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 16:01:21,331 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [986096408] [2020-12-01 16:01:21,331 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 16:01:21,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:01:21,396 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 27 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2020-12-01 16:01:21,396 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [986096408] [2020-12-01 16:01:21,397 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 16:01:21,397 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 16:01:21,397 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [384060062] [2020-12-01 16:01:21,398 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 16:01:21,398 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 16:01:21,399 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 16:01:21,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-01 16:01:21,399 INFO L87 Difference]: Start difference. First operand 3073 states and 3805 transitions. Second operand 5 states. [2020-12-01 16:01:21,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 16:01:21,718 INFO L93 Difference]: Finished difference Result 5583 states and 6899 transitions. [2020-12-01 16:01:21,718 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-12-01 16:01:21,718 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 98 [2020-12-01 16:01:21,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 16:01:21,722 INFO L225 Difference]: With dead ends: 5583 [2020-12-01 16:01:21,722 INFO L226 Difference]: Without dead ends: 2208 [2020-12-01 16:01:21,728 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-12-01 16:01:21,732 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2208 states. [2020-12-01 16:01:21,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2208 to 2050. [2020-12-01 16:01:21,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2050 states. [2020-12-01 16:01:21,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2050 states to 2050 states and 2515 transitions. [2020-12-01 16:01:21,980 INFO L78 Accepts]: Start accepts. Automaton has 2050 states and 2515 transitions. Word has length 98 [2020-12-01 16:01:21,981 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 16:01:21,981 INFO L481 AbstractCegarLoop]: Abstraction has 2050 states and 2515 transitions. [2020-12-01 16:01:21,981 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 16:01:21,981 INFO L276 IsEmpty]: Start isEmpty. Operand 2050 states and 2515 transitions. [2020-12-01 16:01:21,984 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 112 [2020-12-01 16:01:21,985 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 16:01:21,985 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-12-01 16:01:21,985 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2020-12-01 16:01:21,986 INFO L429 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 16:01:21,986 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:01:21,986 INFO L82 PathProgramCache]: Analyzing trace with hash -1098481666, now seen corresponding path program 1 times [2020-12-01 16:01:21,987 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 16:01:21,987 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2061705634] [2020-12-01 16:01:21,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 16:01:22,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:01:22,048 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:01:22,049 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2061705634] [2020-12-01 16:01:22,049 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 16:01:22,049 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 16:01:22,050 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [590864174] [2020-12-01 16:01:22,052 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 16:01:22,052 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 16:01:22,053 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 16:01:22,053 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 16:01:22,054 INFO L87 Difference]: Start difference. First operand 2050 states and 2515 transitions. Second operand 3 states. [2020-12-01 16:01:22,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 16:01:22,283 INFO L93 Difference]: Finished difference Result 3786 states and 4676 transitions. [2020-12-01 16:01:22,283 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 16:01:22,284 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 111 [2020-12-01 16:01:22,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 16:01:22,288 INFO L225 Difference]: With dead ends: 3786 [2020-12-01 16:01:22,289 INFO L226 Difference]: Without dead ends: 1796 [2020-12-01 16:01:22,292 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-12-01 16:01:22,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1796 states. [2020-12-01 16:01:22,504 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1796 to 1793. [2020-12-01 16:01:22,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1793 states. [2020-12-01 16:01:22,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1793 states to 1793 states and 2167 transitions. [2020-12-01 16:01:22,509 INFO L78 Accepts]: Start accepts. Automaton has 1793 states and 2167 transitions. Word has length 111 [2020-12-01 16:01:22,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 16:01:22,509 INFO L481 AbstractCegarLoop]: Abstraction has 1793 states and 2167 transitions. [2020-12-01 16:01:22,510 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 16:01:22,510 INFO L276 IsEmpty]: Start isEmpty. Operand 1793 states and 2167 transitions. [2020-12-01 16:01:22,513 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-12-01 16:01:22,513 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 16:01:22,514 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-12-01 16:01:22,514 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2020-12-01 16:01:22,514 INFO L429 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 16:01:22,515 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:01:22,515 INFO L82 PathProgramCache]: Analyzing trace with hash -1656411785, now seen corresponding path program 1 times [2020-12-01 16:01:22,515 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 16:01:22,517 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295550682] [2020-12-01 16:01:22,517 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 16:01:22,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:01:22,642 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-01 16:01:22,642 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295550682] [2020-12-01 16:01:22,643 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 16:01:22,643 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-12-01 16:01:22,643 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1387326920] [2020-12-01 16:01:22,645 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 16:01:22,645 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 16:01:22,646 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 16:01:22,646 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2020-12-01 16:01:22,647 INFO L87 Difference]: Start difference. First operand 1793 states and 2167 transitions. Second operand 5 states. [2020-12-01 16:01:22,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 16:01:22,895 INFO L93 Difference]: Finished difference Result 3489 states and 4203 transitions. [2020-12-01 16:01:22,896 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-12-01 16:01:22,896 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 113 [2020-12-01 16:01:22,896 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 16:01:22,900 INFO L225 Difference]: With dead ends: 3489 [2020-12-01 16:01:22,900 INFO L226 Difference]: Without dead ends: 1757 [2020-12-01 16:01:22,903 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-12-01 16:01:22,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1757 states. [2020-12-01 16:01:23,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1757 to 1618. [2020-12-01 16:01:23,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1618 states. [2020-12-01 16:01:23,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1618 states to 1618 states and 1932 transitions. [2020-12-01 16:01:23,054 INFO L78 Accepts]: Start accepts. Automaton has 1618 states and 1932 transitions. Word has length 113 [2020-12-01 16:01:23,055 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 16:01:23,055 INFO L481 AbstractCegarLoop]: Abstraction has 1618 states and 1932 transitions. [2020-12-01 16:01:23,055 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 16:01:23,055 INFO L276 IsEmpty]: Start isEmpty. Operand 1618 states and 1932 transitions. [2020-12-01 16:01:23,058 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2020-12-01 16:01:23,058 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 16:01:23,058 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-12-01 16:01:23,058 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2020-12-01 16:01:23,059 INFO L429 AbstractCegarLoop]: === Iteration 20 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 16:01:23,059 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:01:23,059 INFO L82 PathProgramCache]: Analyzing trace with hash -1864761928, now seen corresponding path program 1 times [2020-12-01 16:01:23,060 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 16:01:23,060 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1843117493] [2020-12-01 16:01:23,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 16:01:23,084 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:01:23,121 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 26 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-12-01 16:01:23,121 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1843117493] [2020-12-01 16:01:23,122 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 16:01:23,122 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 16:01:23,122 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176735965] [2020-12-01 16:01:23,123 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 16:01:23,123 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 16:01:23,124 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 16:01:23,124 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 16:01:23,124 INFO L87 Difference]: Start difference. First operand 1618 states and 1932 transitions. Second operand 3 states. [2020-12-01 16:01:23,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 16:01:23,332 INFO L93 Difference]: Finished difference Result 3212 states and 3849 transitions. [2020-12-01 16:01:23,332 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 16:01:23,333 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 113 [2020-12-01 16:01:23,333 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 16:01:23,336 INFO L225 Difference]: With dead ends: 3212 [2020-12-01 16:01:23,337 INFO L226 Difference]: Without dead ends: 1655 [2020-12-01 16:01:23,339 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-12-01 16:01:23,342 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1655 states. [2020-12-01 16:01:23,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1655 to 1646. [2020-12-01 16:01:23,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1646 states. [2020-12-01 16:01:23,496 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1646 states to 1646 states and 1934 transitions. [2020-12-01 16:01:23,497 INFO L78 Accepts]: Start accepts. Automaton has 1646 states and 1934 transitions. Word has length 113 [2020-12-01 16:01:23,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 16:01:23,497 INFO L481 AbstractCegarLoop]: Abstraction has 1646 states and 1934 transitions. [2020-12-01 16:01:23,497 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 16:01:23,498 INFO L276 IsEmpty]: Start isEmpty. Operand 1646 states and 1934 transitions. [2020-12-01 16:01:23,500 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 115 [2020-12-01 16:01:23,500 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 16:01:23,501 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-12-01 16:01:23,501 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2020-12-01 16:01:23,501 INFO L429 AbstractCegarLoop]: === Iteration 21 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 16:01:23,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:01:23,502 INFO L82 PathProgramCache]: Analyzing trace with hash -1931636839, now seen corresponding path program 1 times [2020-12-01 16:01:23,502 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 16:01:23,502 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777487763] [2020-12-01 16:01:23,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 16:01:23,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:01:23,581 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-01 16:01:23,581 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777487763] [2020-12-01 16:01:23,582 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 16:01:23,582 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-12-01 16:01:23,582 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1644775058] [2020-12-01 16:01:23,583 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 16:01:23,583 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 16:01:23,584 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 16:01:23,584 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-01 16:01:23,584 INFO L87 Difference]: Start difference. First operand 1646 states and 1934 transitions. Second operand 5 states. [2020-12-01 16:01:23,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 16:01:23,969 INFO L93 Difference]: Finished difference Result 4611 states and 5427 transitions. [2020-12-01 16:01:23,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2020-12-01 16:01:23,970 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 114 [2020-12-01 16:01:23,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 16:01:23,977 INFO L225 Difference]: With dead ends: 4611 [2020-12-01 16:01:23,977 INFO L226 Difference]: Without dead ends: 3026 [2020-12-01 16:01:23,980 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-12-01 16:01:23,985 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3026 states. [2020-12-01 16:01:24,162 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3026 to 1648. [2020-12-01 16:01:24,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1648 states. [2020-12-01 16:01:24,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1648 states to 1648 states and 1932 transitions. [2020-12-01 16:01:24,166 INFO L78 Accepts]: Start accepts. Automaton has 1648 states and 1932 transitions. Word has length 114 [2020-12-01 16:01:24,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 16:01:24,167 INFO L481 AbstractCegarLoop]: Abstraction has 1648 states and 1932 transitions. [2020-12-01 16:01:24,167 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 16:01:24,167 INFO L276 IsEmpty]: Start isEmpty. Operand 1648 states and 1932 transitions. [2020-12-01 16:01:24,170 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2020-12-01 16:01:24,170 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 16:01:24,171 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-12-01 16:01:24,171 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2020-12-01 16:01:24,171 INFO L429 AbstractCegarLoop]: === Iteration 22 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 16:01:24,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:01:24,172 INFO L82 PathProgramCache]: Analyzing trace with hash 163305011, now seen corresponding path program 1 times [2020-12-01 16:01:24,172 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 16:01:24,172 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240895532] [2020-12-01 16:01:24,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 16:01:24,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:01:24,238 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 43 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2020-12-01 16:01:24,238 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240895532] [2020-12-01 16:01:24,239 INFO L219 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-12-01 16:01:24,239 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-12-01 16:01:24,239 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777434259] [2020-12-01 16:01:24,240 INFO L461 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-12-01 16:01:24,240 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 16:01:24,240 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-12-01 16:01:24,241 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-12-01 16:01:24,241 INFO L87 Difference]: Start difference. First operand 1648 states and 1932 transitions. Second operand 3 states. [2020-12-01 16:01:24,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 16:01:24,407 INFO L93 Difference]: Finished difference Result 2927 states and 3440 transitions. [2020-12-01 16:01:24,408 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-12-01 16:01:24,408 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2020-12-01 16:01:24,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 16:01:24,411 INFO L225 Difference]: With dead ends: 2927 [2020-12-01 16:01:24,412 INFO L226 Difference]: Without dead ends: 1340 [2020-12-01 16:01:24,414 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-12-01 16:01:24,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1340 states. [2020-12-01 16:01:24,545 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1340 to 1232. [2020-12-01 16:01:24,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1232 states. [2020-12-01 16:01:24,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1232 states to 1232 states and 1430 transitions. [2020-12-01 16:01:24,548 INFO L78 Accepts]: Start accepts. Automaton has 1232 states and 1430 transitions. Word has length 116 [2020-12-01 16:01:24,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 16:01:24,548 INFO L481 AbstractCegarLoop]: Abstraction has 1232 states and 1430 transitions. [2020-12-01 16:01:24,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-12-01 16:01:24,549 INFO L276 IsEmpty]: Start isEmpty. Operand 1232 states and 1430 transitions. [2020-12-01 16:01:24,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2020-12-01 16:01:24,551 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 16:01:24,551 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-12-01 16:01:24,552 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2020-12-01 16:01:24,552 INFO L429 AbstractCegarLoop]: === Iteration 23 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 16:01:24,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:01:24,553 INFO L82 PathProgramCache]: Analyzing trace with hash -641278560, now seen corresponding path program 1 times [2020-12-01 16:01:24,553 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 16:01:24,553 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [586416861] [2020-12-01 16:01:24,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 16:01:24,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:01:24,690 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-01 16:01:24,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [586416861] [2020-12-01 16:01:24,691 INFO L353 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [658169829] [2020-12-01 16:01:24,691 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_c35ce62f-e821-4107-8ecc-c33aca067cab/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-12-01 16:01:24,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-12-01 16:01:24,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 373 conjuncts, 9 conjunts are in the unsatisfiable core [2020-12-01 16:01:24,888 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-12-01 16:01:25,354 INFO L134 CoverageAnalysis]: Checked inductivity of 49 backedges. 0 proven. 35 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2020-12-01 16:01:25,354 INFO L219 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-12-01 16:01:25,355 INFO L232 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2020-12-01 16:01:25,355 INFO L155 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5085357] [2020-12-01 16:01:25,357 INFO L461 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-12-01 16:01:25,357 INFO L142 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-12-01 16:01:25,357 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-12-01 16:01:25,358 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-12-01 16:01:25,358 INFO L87 Difference]: Start difference. First operand 1232 states and 1430 transitions. Second operand 5 states. [2020-12-01 16:01:25,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-12-01 16:01:25,791 INFO L93 Difference]: Finished difference Result 2927 states and 3398 transitions. [2020-12-01 16:01:25,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-12-01 16:01:25,792 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 118 [2020-12-01 16:01:25,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-12-01 16:01:25,797 INFO L225 Difference]: With dead ends: 2927 [2020-12-01 16:01:25,797 INFO L226 Difference]: Without dead ends: 2134 [2020-12-01 16:01:25,800 INFO L677 BasicCegarLoop]: 0 DeclaredPredicates, 124 GetRequests, 117 SyntacticMatches, 2 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2020-12-01 16:01:25,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2134 states. [2020-12-01 16:01:26,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2134 to 1347. [2020-12-01 16:01:26,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1347 states. [2020-12-01 16:01:26,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1347 states to 1347 states and 1557 transitions. [2020-12-01 16:01:26,024 INFO L78 Accepts]: Start accepts. Automaton has 1347 states and 1557 transitions. Word has length 118 [2020-12-01 16:01:26,024 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-12-01 16:01:26,024 INFO L481 AbstractCegarLoop]: Abstraction has 1347 states and 1557 transitions. [2020-12-01 16:01:26,024 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-12-01 16:01:26,025 INFO L276 IsEmpty]: Start isEmpty. Operand 1347 states and 1557 transitions. [2020-12-01 16:01:26,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 191 [2020-12-01 16:01:26,029 INFO L414 BasicCegarLoop]: Found error trace [2020-12-01 16:01:26,029 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-12-01 16:01:26,254 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2020-12-01 16:01:26,255 INFO L429 AbstractCegarLoop]: === Iteration 24 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-12-01 16:01:26,255 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-12-01 16:01:26,255 INFO L82 PathProgramCache]: Analyzing trace with hash -361097061, now seen corresponding path program 1 times [2020-12-01 16:01:26,255 INFO L162 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-12-01 16:01:26,256 INFO L353 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1643611330] [2020-12-01 16:01:26,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-12-01 16:01:26,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 16:01:26,304 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 16:01:26,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-12-01 16:01:26,346 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-12-01 16:01:26,473 INFO L173 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-12-01 16:01:26,475 INFO L523 BasicCegarLoop]: Counterexample might be feasible [2020-12-01 16:01:26,476 WARN L518 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2020-12-01 16:01:26,727 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 01.12 04:01:26 BoogieIcfgContainer [2020-12-01 16:01:26,727 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-12-01 16:01:26,728 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-12-01 16:01:26,728 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-12-01 16:01:26,729 INFO L275 PluginConnector]: Witness Printer initialized [2020-12-01 16:01:26,729 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 01.12 04:01:11" (3/4) ... [2020-12-01 16:01:26,732 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-12-01 16:01:26,915 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_c35ce62f-e821-4107-8ecc-c33aca067cab/bin/uautomizer/witness.graphml [2020-12-01 16:01:26,915 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-12-01 16:01:26,917 INFO L168 Benchmark]: Toolchain (without parser) took 16707.73 ms. Allocated memory was 100.7 MB in the beginning and 1.0 GB in the end (delta: 916.5 MB). Free memory was 74.3 MB in the beginning and 621.2 MB in the end (delta: -547.0 MB). Peak memory consumption was 370.1 MB. Max. memory is 16.1 GB. [2020-12-01 16:01:26,918 INFO L168 Benchmark]: CDTParser took 2.08 ms. Allocated memory is still 100.7 MB. Free memory is still 57.4 MB. There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 16:01:26,918 INFO L168 Benchmark]: CACSL2BoogieTranslator took 413.03 ms. Allocated memory was 100.7 MB in the beginning and 140.5 MB in the end (delta: 39.8 MB). Free memory was 73.9 MB in the beginning and 115.3 MB in the end (delta: -41.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. [2020-12-01 16:01:26,919 INFO L168 Benchmark]: Boogie Procedure Inliner took 80.86 ms. Allocated memory is still 140.5 MB. Free memory was 115.3 MB in the beginning and 112.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. [2020-12-01 16:01:26,919 INFO L168 Benchmark]: Boogie Preprocessor took 43.17 ms. Allocated memory is still 140.5 MB. Free memory was 112.6 MB in the beginning and 111.1 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. [2020-12-01 16:01:26,920 INFO L168 Benchmark]: RCFGBuilder took 827.97 ms. Allocated memory is still 140.5 MB. Free memory was 111.0 MB in the beginning and 76.4 MB in the end (delta: 34.6 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.1 GB. [2020-12-01 16:01:26,920 INFO L168 Benchmark]: TraceAbstraction took 15143.36 ms. Allocated memory was 140.5 MB in the beginning and 1.0 GB in the end (delta: 876.6 MB). Free memory was 75.9 MB in the beginning and 649.5 MB in the end (delta: -573.6 MB). Peak memory consumption was 304.5 MB. Max. memory is 16.1 GB. [2020-12-01 16:01:26,921 INFO L168 Benchmark]: Witness Printer took 187.29 ms. Allocated memory is still 1.0 GB. Free memory was 649.5 MB in the beginning and 621.2 MB in the end (delta: 28.3 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. [2020-12-01 16:01:26,923 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 2.08 ms. Allocated memory is still 100.7 MB. Free memory is still 57.4 MB. There was no memory consumed. Max. memory is 16.1 GB. * CACSL2BoogieTranslator took 413.03 ms. Allocated memory was 100.7 MB in the beginning and 140.5 MB in the end (delta: 39.8 MB). Free memory was 73.9 MB in the beginning and 115.3 MB in the end (delta: -41.4 MB). Peak memory consumption was 10.5 MB. Max. memory is 16.1 GB. * Boogie Procedure Inliner took 80.86 ms. Allocated memory is still 140.5 MB. Free memory was 115.3 MB in the beginning and 112.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 4.2 MB. Max. memory is 16.1 GB. * Boogie Preprocessor took 43.17 ms. Allocated memory is still 140.5 MB. Free memory was 112.6 MB in the beginning and 111.1 MB in the end (delta: 1.5 MB). There was no memory consumed. Max. memory is 16.1 GB. * RCFGBuilder took 827.97 ms. Allocated memory is still 140.5 MB. Free memory was 111.0 MB in the beginning and 76.4 MB in the end (delta: 34.6 MB). Peak memory consumption was 35.7 MB. Max. memory is 16.1 GB. * TraceAbstraction took 15143.36 ms. Allocated memory was 140.5 MB in the beginning and 1.0 GB in the end (delta: 876.6 MB). Free memory was 75.9 MB in the beginning and 649.5 MB in the end (delta: -573.6 MB). Peak memory consumption was 304.5 MB. Max. memory is 16.1 GB. * Witness Printer took 187.29 ms. Allocated memory is still 1.0 GB. Free memory was 649.5 MB in the beginning and 621.2 MB in the end (delta: 28.3 MB). Peak memory consumption was 29.4 MB. Max. memory is 16.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 3]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L17] int max_loop ; [L18] int num ; [L19] int i ; [L20] int e ; [L21] int timer ; [L22] char data_0 ; [L23] char data_1 ; [L66] int P_1_pc; [L67] int P_1_st ; [L68] int P_1_i ; [L69] int P_1_ev ; [L124] int C_1_pc ; [L125] int C_1_st ; [L126] int C_1_i ; [L127] int C_1_ev ; [L128] int C_1_pr ; VAL [C_1_ev=0, C_1_i=0, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=0, num=0, P_1_ev=0, P_1_i=0, P_1_pc=0, P_1_st=0, timer=0] [L492] int count ; [L493] int __retres2 ; [L497] num = 0 [L498] i = 0 [L499] max_loop = 2 [L501] timer = 0 [L502] P_1_pc = 0 [L503] C_1_pc = 0 [L505] count = 0 [L485] P_1_i = 1 [L486] C_1_i = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L423] int kernel_st ; [L424] int tmp ; [L425] int tmp___0 ; [L429] kernel_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L228] COND TRUE (int )P_1_i == 1 [L229] P_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L233] COND TRUE (int )C_1_i == 1 [L234] C_1_st = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L367] int tmp ; [L368] int tmp___0 ; [L369] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L109] COND FALSE !((int )P_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L119] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L121] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L373] tmp = is_P_1_triggered() [L375] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L188] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L191] COND FALSE !((int )C_1_pc == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L201] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L211] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L213] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L381] tmp___1 = is_C_1_triggered() [L383] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L437] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L440] kernel_st = 1 [L264] int tmp ; [L265] int tmp___0 ; [L266] int tmp___1 ; [L267] int tmp___2 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L271] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L243] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L260] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L274] tmp___2 = exists_runnable_thread() [L276] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L281] COND TRUE (int )P_1_st == 0 [L283] tmp = __VERIFIER_nondet_int() [L285] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=0, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L296] COND TRUE (int )C_1_st == 0 [L298] tmp___1 = __VERIFIER_nondet_int() [L300] COND TRUE \read(tmp___1) [L302] C_1_st = 1 [L130] char c ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L133] COND TRUE (int )C_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L148] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=0, C_1_pr=0, C_1_st=1, data_0=0, data_1=0, e=0, i=0, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=0] [L150] COND TRUE num == 0 [L151] timer = 1 [L152] i += 1 [L153] C_1_pc = 1 [L154] C_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L271] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L243] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L260] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L274] tmp___2 = exists_runnable_thread() [L276] COND TRUE \read(tmp___2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=0, timer=1] [L281] COND TRUE (int )P_1_st == 0 [L283] tmp = __VERIFIER_nondet_int() [L285] COND TRUE \read(tmp) [L287] P_1_st = 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L74] COND TRUE (int )P_1_pc == 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L85] COND TRUE i < max_loop VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=0, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L51] COND TRUE i___0 == 0 [L52] data_0 = c VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=0, P_1_ev=0, P_1_i=1, P_1_pc=0, P_1_st=1, timer=1] [L89] num += 1 [L90] P_1_pc = 1 [L91] P_1_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L296] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L271] COND TRUE 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L243] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L246] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L250] COND FALSE !((int )C_1_st == 0) [L258] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L260] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L274] tmp___2 = exists_runnable_thread() [L276] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L444] kernel_st = 2 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L448] kernel_st = 3 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L367] int tmp ; [L368] int tmp___0 ; [L369] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L109] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L110] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L119] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L121] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L373] tmp = is_P_1_triggered() [L375] COND FALSE !(\read(tmp)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L188] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L191] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L192] COND FALSE !((int )e == 1) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L201] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L211] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L213] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] tmp___1 = is_C_1_triggered() [L383] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L243] int __retres1 ; VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L246] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L250] COND FALSE !((int )C_1_st == 0) [L258] __retres1 = 0 VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L260] return (__retres1); VAL [C_1_ev=0, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=0, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L454] tmp = exists_runnable_thread() [L456] COND TRUE tmp == 0 [L458] kernel_st = 4 [L338] C_1_ev = 1 [L340] P_1_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L367] int tmp ; [L368] int tmp___0 ; [L369] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L109] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L110] COND TRUE (int )P_1_ev == 1 [L111] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L121] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L373] tmp = is_P_1_triggered() [L375] COND TRUE \read(tmp) [L376] P_1_st = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L188] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L191] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L192] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L201] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L211] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L213] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L381] tmp___1 = is_C_1_triggered() [L383] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L352] COND TRUE (int )P_1_ev == 1 [L353] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L357] COND TRUE (int )C_1_ev == 1 [L358] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L404] int tmp ; [L405] int __retres2 ; [L243] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L260] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L409] tmp = exists_runnable_thread() [L411] COND TRUE \read(tmp) [L412] __retres2 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L419] return (__retres2); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L467] tmp___0 = stop_simulation() [L469] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L437] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L440] kernel_st = 1 [L264] int tmp ; [L265] int tmp___0 ; [L266] int tmp___1 ; [L267] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L271] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L243] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L260] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L274] tmp___2 = exists_runnable_thread() [L276] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L281] COND TRUE (int )P_1_st == 0 [L283] tmp = __VERIFIER_nondet_int() [L285] COND TRUE \read(tmp) [L287] P_1_st = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L74] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L77] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L85] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L51] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=0, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L54] COND TRUE i___0 == 1 [L55] data_1 = c VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=1, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L89] num += 1 [L90] P_1_pc = 1 [L91] P_1_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L296] COND FALSE !((int )C_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L271] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L243] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L246] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L250] COND FALSE !((int )C_1_st == 0) [L258] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L260] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L274] tmp___2 = exists_runnable_thread() [L276] COND FALSE !(\read(tmp___2)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L444] kernel_st = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L448] kernel_st = 3 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L367] int tmp ; [L368] int tmp___0 ; [L369] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L109] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L110] COND FALSE !((int )P_1_ev == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L119] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L121] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L373] tmp = is_P_1_triggered() [L375] COND FALSE !(\read(tmp)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L188] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L191] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L192] COND FALSE !((int )e == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L201] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L211] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L213] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L381] tmp___1 = is_C_1_triggered() [L383] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L243] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L246] COND FALSE !((int )P_1_st == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L250] COND FALSE !((int )C_1_st == 0) [L258] __retres1 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L260] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L454] tmp = exists_runnable_thread() [L456] COND TRUE tmp == 0 [L458] kernel_st = 4 [L338] C_1_ev = 1 [L340] P_1_ev = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L367] int tmp ; [L368] int tmp___0 ; [L369] int tmp___1 ; [L106] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L109] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L110] COND TRUE (int )P_1_ev == 1 [L111] __retres1 = 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L121] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=2, timer=1] [L373] tmp = is_P_1_triggered() [L375] COND TRUE \read(tmp) [L376] P_1_st = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L188] int __retres1 ; VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L191] COND TRUE (int )C_1_pc == 1 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L192] COND FALSE !((int )e == 1) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L201] COND FALSE !((int )C_1_pc == 2) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L211] __retres1 = 0 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L213] return (__retres1); VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L381] tmp___1 = is_C_1_triggered() [L383] COND FALSE !(\read(tmp___1)) VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=1, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L352] COND TRUE (int )P_1_ev == 1 [L353] P_1_ev = 2 VAL [C_1_ev=1, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L357] COND TRUE (int )C_1_ev == 1 [L358] C_1_ev = 2 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L404] int tmp ; [L405] int __retres2 ; [L243] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L260] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L409] tmp = exists_runnable_thread() [L411] COND TRUE \read(tmp) [L412] __retres2 = 0 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L419] return (__retres2); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L467] tmp___0 = stop_simulation() [L469] COND FALSE !(\read(tmp___0)) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L437] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L440] kernel_st = 1 [L264] int tmp ; [L265] int tmp___0 ; [L266] int tmp___1 ; [L267] int tmp___2 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L271] COND TRUE 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L243] int __retres1 ; VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L246] COND TRUE (int )P_1_st == 0 [L247] __retres1 = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L260] return (__retres1); VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L274] tmp___2 = exists_runnable_thread() [L276] COND TRUE \read(tmp___2) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=0, timer=1] [L281] COND TRUE (int )P_1_st == 0 [L283] tmp = __VERIFIER_nondet_int() [L285] COND TRUE \read(tmp) [L287] P_1_st = 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L74] COND FALSE !((int )P_1_pc == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L77] COND TRUE (int )P_1_pc == 1 VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L85] COND TRUE i < max_loop VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L51] COND FALSE !(i___0 == 0) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L54] COND FALSE !(i___0 == 1) VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] [L3] __assert_fail("0", "kundu1.cil.c", 3, "reach_error") VAL [C_1_ev=2, C_1_i=1, C_1_pc=1, C_1_pr=0, C_1_st=2, data_0=65, data_1=65, e=0, i=1, max_loop=2, num=2, P_1_ev=2, P_1_i=1, P_1_pc=1, P_1_st=1, timer=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 120 locations, 3 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 14.7s, OverallIterations: 24, TraceHistogramMax: 6, AutomataDifference: 6.7s, 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, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 244 GetRequests, 170 SyntacticMatches, 3 SemanticMatches, 71 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=5850occurred in iteration=11, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 4.4s 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...