./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/systemc/transmitter.02.cil.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_14e7e710-3b4d-4d88-8112-d0dce6a4b335/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_14e7e710-3b4d-4d88-8112-d0dce6a4b335/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_14e7e710-3b4d-4d88-8112-d0dce6a4b335/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_14e7e710-3b4d-4d88-8112-d0dce6a4b335/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/systemc/transmitter.02.cil.c -s /tmp/vcloud-vcloud-master/worker/run_dir_14e7e710-3b4d-4d88-8112-d0dce6a4b335/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_14e7e710-3b4d-4d88-8112-d0dce6a4b335/bin/uautomizer --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0c244c639ec9718adcbacffa967b748c52a23cd0 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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.1.24-cad4683 [2019-11-15 19:54:20,738 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-15 19:54:20,740 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-15 19:54:20,754 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-15 19:54:20,755 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-15 19:54:20,756 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-15 19:54:20,758 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-15 19:54:20,767 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-15 19:54:20,772 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-15 19:54:20,776 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-15 19:54:20,777 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-15 19:54:20,779 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-15 19:54:20,779 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-15 19:54:20,781 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-15 19:54:20,783 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-15 19:54:20,784 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-15 19:54:20,784 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-15 19:54:20,785 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-15 19:54:20,788 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-15 19:54:20,791 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-15 19:54:20,794 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-15 19:54:20,796 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-15 19:54:20,799 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-15 19:54:20,800 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-15 19:54:20,802 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-15 19:54:20,802 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-15 19:54:20,803 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-15 19:54:20,804 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-15 19:54:20,805 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-15 19:54:20,805 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-15 19:54:20,806 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-15 19:54:20,807 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-15 19:54:20,807 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-15 19:54:20,808 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-15 19:54:20,809 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-15 19:54:20,809 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-15 19:54:20,810 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-15 19:54:20,810 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-15 19:54:20,810 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-15 19:54:20,811 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-15 19:54:20,812 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-15 19:54:20,813 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_14e7e710-3b4d-4d88-8112-d0dce6a4b335/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-15 19:54:20,837 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-15 19:54:20,847 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-15 19:54:20,848 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-15 19:54:20,848 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-15 19:54:20,849 INFO L138 SettingsManager]: * Use SBE=true [2019-11-15 19:54:20,849 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-15 19:54:20,849 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-15 19:54:20,849 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-15 19:54:20,850 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-15 19:54:20,850 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-15 19:54:20,850 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-15 19:54:20,850 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-15 19:54:20,851 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-15 19:54:20,852 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-15 19:54:20,852 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-15 19:54:20,852 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-15 19:54:20,852 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-15 19:54:20,853 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-15 19:54:20,853 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-15 19:54:20,853 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-15 19:54:20,853 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-15 19:54:20,854 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-15 19:54:20,854 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-15 19:54:20,854 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-15 19:54:20,854 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-15 19:54:20,855 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-15 19:54:20,855 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-15 19:54:20,855 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-15 19:54:20,856 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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_14e7e710-3b4d-4d88-8112-d0dce6a4b335/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(__VERIFIER_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 -> 0c244c639ec9718adcbacffa967b748c52a23cd0 [2019-11-15 19:54:20,888 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-15 19:54:20,902 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-15 19:54:20,906 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-15 19:54:20,907 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-15 19:54:20,907 INFO L275 PluginConnector]: CDTParser initialized [2019-11-15 19:54:20,908 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_14e7e710-3b4d-4d88-8112-d0dce6a4b335/bin/uautomizer/../../sv-benchmarks/c/systemc/transmitter.02.cil.c [2019-11-15 19:54:20,968 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_14e7e710-3b4d-4d88-8112-d0dce6a4b335/bin/uautomizer/data/9db19be4a/ba0a4884905a41b9a9c998125b143fc3/FLAG40ab8e389 [2019-11-15 19:54:21,348 INFO L306 CDTParser]: Found 1 translation units. [2019-11-15 19:54:21,349 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_14e7e710-3b4d-4d88-8112-d0dce6a4b335/sv-benchmarks/c/systemc/transmitter.02.cil.c [2019-11-15 19:54:21,358 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_14e7e710-3b4d-4d88-8112-d0dce6a4b335/bin/uautomizer/data/9db19be4a/ba0a4884905a41b9a9c998125b143fc3/FLAG40ab8e389 [2019-11-15 19:54:21,781 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_14e7e710-3b4d-4d88-8112-d0dce6a4b335/bin/uautomizer/data/9db19be4a/ba0a4884905a41b9a9c998125b143fc3 [2019-11-15 19:54:21,785 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-15 19:54:21,787 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-15 19:54:21,791 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-15 19:54:21,791 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-15 19:54:21,794 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-15 19:54:21,794 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:54:21" (1/1) ... [2019-11-15 19:54:21,796 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@56ebef4e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:21, skipping insertion in model container [2019-11-15 19:54:21,796 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 15.11 07:54:21" (1/1) ... [2019-11-15 19:54:21,807 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-15 19:54:21,841 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-15 19:54:22,198 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:54:22,212 INFO L188 MainTranslator]: Completed pre-run [2019-11-15 19:54:22,283 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-15 19:54:22,311 INFO L192 MainTranslator]: Completed translation [2019-11-15 19:54:22,311 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:22 WrapperNode [2019-11-15 19:54:22,312 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-15 19:54:22,312 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-15 19:54:22,313 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-15 19:54:22,313 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-15 19:54:22,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:22" (1/1) ... [2019-11-15 19:54:22,337 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:22" (1/1) ... [2019-11-15 19:54:22,386 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-15 19:54:22,388 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-15 19:54:22,388 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-15 19:54:22,388 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-15 19:54:22,397 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:22" (1/1) ... [2019-11-15 19:54:22,398 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:22" (1/1) ... [2019-11-15 19:54:22,414 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:22" (1/1) ... [2019-11-15 19:54:22,416 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:22" (1/1) ... [2019-11-15 19:54:22,441 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:22" (1/1) ... [2019-11-15 19:54:22,457 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:22" (1/1) ... [2019-11-15 19:54:22,474 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:22" (1/1) ... [2019-11-15 19:54:22,478 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-15 19:54:22,479 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-15 19:54:22,479 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-15 19:54:22,479 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-15 19:54:22,480 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:22" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_14e7e710-3b4d-4d88-8112-d0dce6a4b335/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 [2019-11-15 19:54:22,541 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-15 19:54:22,541 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-15 19:54:23,234 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-15 19:54:23,234 INFO L284 CfgBuilder]: Removed 94 assume(true) statements. [2019-11-15 19:54:23,236 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:54:23 BoogieIcfgContainer [2019-11-15 19:54:23,236 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-15 19:54:23,237 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-15 19:54:23,237 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-15 19:54:23,239 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-15 19:54:23,240 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 15.11 07:54:21" (1/3) ... [2019-11-15 19:54:23,241 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5193ad1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 07:54:23, skipping insertion in model container [2019-11-15 19:54:23,241 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 15.11 07:54:22" (2/3) ... [2019-11-15 19:54:23,243 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5193ad1b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 15.11 07:54:23, skipping insertion in model container [2019-11-15 19:54:23,243 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:54:23" (3/3) ... [2019-11-15 19:54:23,245 INFO L109 eAbstractionObserver]: Analyzing ICFG transmitter.02.cil.c [2019-11-15 19:54:23,260 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-15 19:54:23,267 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-11-15 19:54:23,274 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-11-15 19:54:23,302 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-15 19:54:23,302 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-15 19:54:23,302 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-15 19:54:23,302 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-15 19:54:23,303 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-15 19:54:23,303 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-15 19:54:23,303 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-15 19:54:23,303 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-15 19:54:23,330 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states. [2019-11-15 19:54:23,340 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 19:54:23,340 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:23,341 INFO L380 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, 1, 1, 1, 1, 1] [2019-11-15 19:54:23,343 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:23,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:23,348 INFO L82 PathProgramCache]: Analyzing trace with hash 550865253, now seen corresponding path program 1 times [2019-11-15 19:54:23,353 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:23,354 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209004513] [2019-11-15 19:54:23,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:23,354 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:23,354 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:23,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:23,486 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:54:23,487 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209004513] [2019-11-15 19:54:23,487 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:23,488 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:54:23,488 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [424503993] [2019-11-15 19:54:23,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:54:23,492 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:23,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:54:23,506 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:23,508 INFO L87 Difference]: Start difference. First operand 192 states. Second operand 3 states. [2019-11-15 19:54:23,563 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:23,564 INFO L93 Difference]: Finished difference Result 379 states and 595 transitions. [2019-11-15 19:54:23,564 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:54:23,565 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-15 19:54:23,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:23,577 INFO L225 Difference]: With dead ends: 379 [2019-11-15 19:54:23,577 INFO L226 Difference]: Without dead ends: 188 [2019-11-15 19:54:23,581 INFO L600 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 [2019-11-15 19:54:23,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2019-11-15 19:54:23,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 188. [2019-11-15 19:54:23,624 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 188 states. [2019-11-15 19:54:23,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 188 states to 188 states and 283 transitions. [2019-11-15 19:54:23,628 INFO L78 Accepts]: Start accepts. Automaton has 188 states and 283 transitions. Word has length 49 [2019-11-15 19:54:23,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:23,629 INFO L462 AbstractCegarLoop]: Abstraction has 188 states and 283 transitions. [2019-11-15 19:54:23,629 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:54:23,629 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 283 transitions. [2019-11-15 19:54:23,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 19:54:23,631 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:23,631 INFO L380 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, 1, 1, 1, 1, 1] [2019-11-15 19:54:23,632 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:23,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:23,632 INFO L82 PathProgramCache]: Analyzing trace with hash -342621085, now seen corresponding path program 1 times [2019-11-15 19:54:23,632 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:23,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1849351940] [2019-11-15 19:54:23,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:23,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:23,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:23,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:23,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:54:23,677 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1849351940] [2019-11-15 19:54:23,678 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:23,678 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 19:54:23,678 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [417052916] [2019-11-15 19:54:23,679 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:54:23,680 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:23,680 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:54:23,680 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:23,680 INFO L87 Difference]: Start difference. First operand 188 states and 283 transitions. Second operand 3 states. [2019-11-15 19:54:23,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:23,817 INFO L93 Difference]: Finished difference Result 498 states and 749 transitions. [2019-11-15 19:54:23,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:54:23,818 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-15 19:54:23,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:23,821 INFO L225 Difference]: With dead ends: 498 [2019-11-15 19:54:23,821 INFO L226 Difference]: Without dead ends: 317 [2019-11-15 19:54:23,823 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:23,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 317 states. [2019-11-15 19:54:23,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 317 to 315. [2019-11-15 19:54:23,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-15 19:54:23,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 467 transitions. [2019-11-15 19:54:23,856 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 467 transitions. Word has length 49 [2019-11-15 19:54:23,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:23,856 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 467 transitions. [2019-11-15 19:54:23,856 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:54:23,856 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 467 transitions. [2019-11-15 19:54:23,858 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 19:54:23,858 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:23,858 INFO L380 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, 1, 1, 1, 1, 1] [2019-11-15 19:54:23,859 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:23,859 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:23,859 INFO L82 PathProgramCache]: Analyzing trace with hash -2057662813, now seen corresponding path program 1 times [2019-11-15 19:54:23,859 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:23,860 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725316476] [2019-11-15 19:54:23,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:23,860 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:23,860 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:23,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:23,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:54:23,895 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725316476] [2019-11-15 19:54:23,895 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:23,895 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 19:54:23,895 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509085454] [2019-11-15 19:54:23,896 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:54:23,896 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:23,896 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:54:23,896 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:23,897 INFO L87 Difference]: Start difference. First operand 315 states and 467 transitions. Second operand 3 states. [2019-11-15 19:54:23,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:23,932 INFO L93 Difference]: Finished difference Result 622 states and 923 transitions. [2019-11-15 19:54:23,936 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:54:23,936 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-15 19:54:23,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:23,940 INFO L225 Difference]: With dead ends: 622 [2019-11-15 19:54:23,940 INFO L226 Difference]: Without dead ends: 315 [2019-11-15 19:54:23,944 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:23,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-15 19:54:23,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-11-15 19:54:23,975 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-15 19:54:23,977 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 459 transitions. [2019-11-15 19:54:23,977 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 459 transitions. Word has length 49 [2019-11-15 19:54:23,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:23,977 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 459 transitions. [2019-11-15 19:54:23,978 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:54:23,978 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 459 transitions. [2019-11-15 19:54:23,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 19:54:23,980 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:23,980 INFO L380 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, 1, 1, 1, 1, 1] [2019-11-15 19:54:23,980 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:23,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:23,981 INFO L82 PathProgramCache]: Analyzing trace with hash 796507235, now seen corresponding path program 1 times [2019-11-15 19:54:23,981 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:23,981 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968516434] [2019-11-15 19:54:23,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:23,981 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:23,982 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:23,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:24,013 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:54:24,013 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968516434] [2019-11-15 19:54:24,014 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:24,014 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 19:54:24,014 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696087425] [2019-11-15 19:54:24,014 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:54:24,014 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:24,015 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:54:24,015 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:24,015 INFO L87 Difference]: Start difference. First operand 315 states and 459 transitions. Second operand 3 states. [2019-11-15 19:54:24,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:24,049 INFO L93 Difference]: Finished difference Result 621 states and 906 transitions. [2019-11-15 19:54:24,049 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:54:24,049 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-15 19:54:24,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:24,052 INFO L225 Difference]: With dead ends: 621 [2019-11-15 19:54:24,052 INFO L226 Difference]: Without dead ends: 315 [2019-11-15 19:54:24,053 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:24,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-15 19:54:24,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-11-15 19:54:24,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-15 19:54:24,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 451 transitions. [2019-11-15 19:54:24,075 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 451 transitions. Word has length 49 [2019-11-15 19:54:24,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:24,076 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 451 transitions. [2019-11-15 19:54:24,077 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:54:24,077 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 451 transitions. [2019-11-15 19:54:24,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 19:54:24,085 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:24,085 INFO L380 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, 1, 1, 1, 1, 1] [2019-11-15 19:54:24,086 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:24,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:24,086 INFO L82 PathProgramCache]: Analyzing trace with hash -773990749, now seen corresponding path program 1 times [2019-11-15 19:54:24,086 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:24,086 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1209519358] [2019-11-15 19:54:24,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:24,087 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:24,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:24,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:24,133 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:54:24,133 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1209519358] [2019-11-15 19:54:24,133 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:24,133 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 19:54:24,134 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [312802295] [2019-11-15 19:54:24,134 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:54:24,134 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:24,134 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:54:24,135 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:24,135 INFO L87 Difference]: Start difference. First operand 315 states and 451 transitions. Second operand 3 states. [2019-11-15 19:54:24,179 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:24,179 INFO L93 Difference]: Finished difference Result 620 states and 889 transitions. [2019-11-15 19:54:24,180 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:54:24,180 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-15 19:54:24,180 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:24,182 INFO L225 Difference]: With dead ends: 620 [2019-11-15 19:54:24,182 INFO L226 Difference]: Without dead ends: 315 [2019-11-15 19:54:24,183 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:24,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-15 19:54:24,196 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-11-15 19:54:24,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-15 19:54:24,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 437 transitions. [2019-11-15 19:54:24,199 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 437 transitions. Word has length 49 [2019-11-15 19:54:24,199 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:24,199 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 437 transitions. [2019-11-15 19:54:24,199 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:54:24,199 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 437 transitions. [2019-11-15 19:54:24,200 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 19:54:24,200 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:24,201 INFO L380 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, 1, 1, 1, 1, 1] [2019-11-15 19:54:24,201 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:24,201 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:24,201 INFO L82 PathProgramCache]: Analyzing trace with hash -1210649628, now seen corresponding path program 1 times [2019-11-15 19:54:24,201 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:24,202 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [844439850] [2019-11-15 19:54:24,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:24,202 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:24,202 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:24,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:24,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:54:24,232 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [844439850] [2019-11-15 19:54:24,232 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:24,232 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 19:54:24,233 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794578450] [2019-11-15 19:54:24,233 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:54:24,233 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:24,234 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:54:24,234 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:24,234 INFO L87 Difference]: Start difference. First operand 315 states and 437 transitions. Second operand 3 states. [2019-11-15 19:54:24,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:24,293 INFO L93 Difference]: Finished difference Result 619 states and 860 transitions. [2019-11-15 19:54:24,294 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:54:24,294 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-15 19:54:24,294 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:24,296 INFO L225 Difference]: With dead ends: 619 [2019-11-15 19:54:24,297 INFO L226 Difference]: Without dead ends: 315 [2019-11-15 19:54:24,298 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:24,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 315 states. [2019-11-15 19:54:24,314 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 315 to 315. [2019-11-15 19:54:24,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 315 states. [2019-11-15 19:54:24,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 315 states to 315 states and 423 transitions. [2019-11-15 19:54:24,317 INFO L78 Accepts]: Start accepts. Automaton has 315 states and 423 transitions. Word has length 49 [2019-11-15 19:54:24,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:24,317 INFO L462 AbstractCegarLoop]: Abstraction has 315 states and 423 transitions. [2019-11-15 19:54:24,317 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:54:24,317 INFO L276 IsEmpty]: Start isEmpty. Operand 315 states and 423 transitions. [2019-11-15 19:54:24,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-15 19:54:24,321 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:24,321 INFO L380 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, 1, 1, 1, 1, 1] [2019-11-15 19:54:24,321 INFO L410 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:24,321 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:24,330 INFO L82 PathProgramCache]: Analyzing trace with hash 217882148, now seen corresponding path program 1 times [2019-11-15 19:54:24,331 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:24,331 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855842868] [2019-11-15 19:54:24,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:24,332 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:24,332 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:24,422 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:54:24,422 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855842868] [2019-11-15 19:54:24,423 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:24,423 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:54:24,423 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1843399681] [2019-11-15 19:54:24,424 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:54:24,424 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:24,424 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:54:24,425 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:24,425 INFO L87 Difference]: Start difference. First operand 315 states and 423 transitions. Second operand 3 states. [2019-11-15 19:54:24,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:24,515 INFO L93 Difference]: Finished difference Result 870 states and 1162 transitions. [2019-11-15 19:54:24,516 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:54:24,516 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-15 19:54:24,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:24,520 INFO L225 Difference]: With dead ends: 870 [2019-11-15 19:54:24,520 INFO L226 Difference]: Without dead ends: 592 [2019-11-15 19:54:24,521 INFO L600 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 [2019-11-15 19:54:24,522 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 592 states. [2019-11-15 19:54:24,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 592 to 556. [2019-11-15 19:54:24,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 556 states. [2019-11-15 19:54:24,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 556 states to 556 states and 731 transitions. [2019-11-15 19:54:24,552 INFO L78 Accepts]: Start accepts. Automaton has 556 states and 731 transitions. Word has length 49 [2019-11-15 19:54:24,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:24,552 INFO L462 AbstractCegarLoop]: Abstraction has 556 states and 731 transitions. [2019-11-15 19:54:24,553 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:54:24,553 INFO L276 IsEmpty]: Start isEmpty. Operand 556 states and 731 transitions. [2019-11-15 19:54:24,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2019-11-15 19:54:24,554 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:24,554 INFO L380 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, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:24,554 INFO L410 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:24,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:24,555 INFO L82 PathProgramCache]: Analyzing trace with hash -397727545, now seen corresponding path program 1 times [2019-11-15 19:54:24,555 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:24,555 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2029245592] [2019-11-15 19:54:24,555 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:24,556 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:24,556 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:24,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:24,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:54:24,601 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2029245592] [2019-11-15 19:54:24,601 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:24,601 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:54:24,601 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1855190740] [2019-11-15 19:54:24,602 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:54:24,602 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:24,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:54:24,603 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:24,603 INFO L87 Difference]: Start difference. First operand 556 states and 731 transitions. Second operand 3 states. [2019-11-15 19:54:24,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:24,692 INFO L93 Difference]: Finished difference Result 1454 states and 1913 transitions. [2019-11-15 19:54:24,692 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:54:24,692 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 50 [2019-11-15 19:54:24,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:24,699 INFO L225 Difference]: With dead ends: 1454 [2019-11-15 19:54:24,700 INFO L226 Difference]: Without dead ends: 968 [2019-11-15 19:54:24,702 INFO L600 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 [2019-11-15 19:54:24,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 968 states. [2019-11-15 19:54:24,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 968 to 926. [2019-11-15 19:54:24,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 926 states. [2019-11-15 19:54:24,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 926 states to 926 states and 1204 transitions. [2019-11-15 19:54:24,773 INFO L78 Accepts]: Start accepts. Automaton has 926 states and 1204 transitions. Word has length 50 [2019-11-15 19:54:24,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:24,774 INFO L462 AbstractCegarLoop]: Abstraction has 926 states and 1204 transitions. [2019-11-15 19:54:24,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:54:24,774 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1204 transitions. [2019-11-15 19:54:24,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2019-11-15 19:54:24,775 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:24,775 INFO L380 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:24,775 INFO L410 AbstractCegarLoop]: === Iteration 9 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:24,776 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:24,776 INFO L82 PathProgramCache]: Analyzing trace with hash 765911831, now seen corresponding path program 1 times [2019-11-15 19:54:24,776 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:24,776 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2067257778] [2019-11-15 19:54:24,776 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:24,777 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:24,777 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:24,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:24,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:54:24,835 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2067257778] [2019-11-15 19:54:24,835 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:24,835 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-11-15 19:54:24,835 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952028474] [2019-11-15 19:54:24,836 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:54:24,836 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:24,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:54:24,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:24,836 INFO L87 Difference]: Start difference. First operand 926 states and 1204 transitions. Second operand 3 states. [2019-11-15 19:54:24,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:24,946 INFO L93 Difference]: Finished difference Result 2626 states and 3421 transitions. [2019-11-15 19:54:24,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:54:24,947 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 51 [2019-11-15 19:54:24,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:24,956 INFO L225 Difference]: With dead ends: 2626 [2019-11-15 19:54:24,956 INFO L226 Difference]: Without dead ends: 1750 [2019-11-15 19:54:24,958 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:24,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1750 states. [2019-11-15 19:54:25,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1750 to 1734. [2019-11-15 19:54:25,040 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1734 states. [2019-11-15 19:54:25,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1734 states to 1734 states and 2234 transitions. [2019-11-15 19:54:25,047 INFO L78 Accepts]: Start accepts. Automaton has 1734 states and 2234 transitions. Word has length 51 [2019-11-15 19:54:25,047 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:25,048 INFO L462 AbstractCegarLoop]: Abstraction has 1734 states and 2234 transitions. [2019-11-15 19:54:25,048 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:54:25,048 INFO L276 IsEmpty]: Start isEmpty. Operand 1734 states and 2234 transitions. [2019-11-15 19:54:25,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-11-15 19:54:25,049 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:25,050 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:25,050 INFO L410 AbstractCegarLoop]: === Iteration 10 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:25,052 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:25,054 INFO L82 PathProgramCache]: Analyzing trace with hash -1533277321, now seen corresponding path program 1 times [2019-11-15 19:54:25,054 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:25,054 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [357443508] [2019-11-15 19:54:25,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:25,054 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:25,055 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:25,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:25,109 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:54:25,109 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [357443508] [2019-11-15 19:54:25,109 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:25,109 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:54:25,110 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [365637032] [2019-11-15 19:54:25,110 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:54:25,110 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:25,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:54:25,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:25,111 INFO L87 Difference]: Start difference. First operand 1734 states and 2234 transitions. Second operand 3 states. [2019-11-15 19:54:25,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:25,282 INFO L93 Difference]: Finished difference Result 5068 states and 6521 transitions. [2019-11-15 19:54:25,283 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:54:25,283 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-11-15 19:54:25,284 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:25,302 INFO L225 Difference]: With dead ends: 5068 [2019-11-15 19:54:25,302 INFO L226 Difference]: Without dead ends: 3402 [2019-11-15 19:54:25,309 INFO L600 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 [2019-11-15 19:54:25,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3402 states. [2019-11-15 19:54:25,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3402 to 3402. [2019-11-15 19:54:25,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3402 states. [2019-11-15 19:54:25,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3402 states to 3402 states and 4340 transitions. [2019-11-15 19:54:25,461 INFO L78 Accepts]: Start accepts. Automaton has 3402 states and 4340 transitions. Word has length 66 [2019-11-15 19:54:25,461 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:25,461 INFO L462 AbstractCegarLoop]: Abstraction has 3402 states and 4340 transitions. [2019-11-15 19:54:25,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:54:25,462 INFO L276 IsEmpty]: Start isEmpty. Operand 3402 states and 4340 transitions. [2019-11-15 19:54:25,465 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 19:54:25,465 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:25,465 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:25,466 INFO L410 AbstractCegarLoop]: === Iteration 11 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:25,466 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:25,466 INFO L82 PathProgramCache]: Analyzing trace with hash -883662481, now seen corresponding path program 1 times [2019-11-15 19:54:25,466 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:25,466 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512185724] [2019-11-15 19:54:25,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:25,467 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:25,467 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:25,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:25,535 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 19:54:25,536 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512185724] [2019-11-15 19:54:25,536 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:25,536 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 19:54:25,536 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216351466] [2019-11-15 19:54:25,538 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 19:54:25,538 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:25,538 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 19:54:25,539 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:54:25,539 INFO L87 Difference]: Start difference. First operand 3402 states and 4340 transitions. Second operand 5 states. [2019-11-15 19:54:25,963 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:25,963 INFO L93 Difference]: Finished difference Result 10802 states and 13699 transitions. [2019-11-15 19:54:25,963 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 19:54:25,963 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-11-15 19:54:25,964 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:26,003 INFO L225 Difference]: With dead ends: 10802 [2019-11-15 19:54:26,003 INFO L226 Difference]: Without dead ends: 7492 [2019-11-15 19:54:26,009 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:54:26,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7492 states. [2019-11-15 19:54:26,195 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7492 to 3546. [2019-11-15 19:54:26,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3546 states. [2019-11-15 19:54:26,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3546 states to 3546 states and 4448 transitions. [2019-11-15 19:54:26,210 INFO L78 Accepts]: Start accepts. Automaton has 3546 states and 4448 transitions. Word has length 89 [2019-11-15 19:54:26,210 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:26,210 INFO L462 AbstractCegarLoop]: Abstraction has 3546 states and 4448 transitions. [2019-11-15 19:54:26,211 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 19:54:26,211 INFO L276 IsEmpty]: Start isEmpty. Operand 3546 states and 4448 transitions. [2019-11-15 19:54:26,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 19:54:26,214 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:26,214 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:26,215 INFO L410 AbstractCegarLoop]: === Iteration 12 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:26,215 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:26,215 INFO L82 PathProgramCache]: Analyzing trace with hash -305176077, now seen corresponding path program 1 times [2019-11-15 19:54:26,215 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:26,215 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [769968151] [2019-11-15 19:54:26,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:26,216 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:26,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:26,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:26,255 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 19:54:26,256 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [769968151] [2019-11-15 19:54:26,256 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:26,256 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:54:26,256 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1181871502] [2019-11-15 19:54:26,257 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:54:26,257 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:26,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:54:26,258 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:26,258 INFO L87 Difference]: Start difference. First operand 3546 states and 4448 transitions. Second operand 3 states. [2019-11-15 19:54:26,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:26,629 INFO L93 Difference]: Finished difference Result 10194 states and 12806 transitions. [2019-11-15 19:54:26,629 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:54:26,629 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-15 19:54:26,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:26,665 INFO L225 Difference]: With dead ends: 10194 [2019-11-15 19:54:26,665 INFO L226 Difference]: Without dead ends: 6712 [2019-11-15 19:54:26,671 INFO L600 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 [2019-11-15 19:54:26,680 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6712 states. [2019-11-15 19:54:26,982 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6712 to 6494. [2019-11-15 19:54:26,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6494 states. [2019-11-15 19:54:27,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6494 states to 6494 states and 8084 transitions. [2019-11-15 19:54:27,007 INFO L78 Accepts]: Start accepts. Automaton has 6494 states and 8084 transitions. Word has length 89 [2019-11-15 19:54:27,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:27,008 INFO L462 AbstractCegarLoop]: Abstraction has 6494 states and 8084 transitions. [2019-11-15 19:54:27,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:54:27,008 INFO L276 IsEmpty]: Start isEmpty. Operand 6494 states and 8084 transitions. [2019-11-15 19:54:27,012 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 19:54:27,013 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:27,013 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:27,013 INFO L410 AbstractCegarLoop]: === Iteration 13 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:27,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:27,013 INFO L82 PathProgramCache]: Analyzing trace with hash -1278665036, now seen corresponding path program 1 times [2019-11-15 19:54:27,014 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:27,014 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678131565] [2019-11-15 19:54:27,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:27,014 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:27,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:27,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:27,068 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 19:54:27,068 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678131565] [2019-11-15 19:54:27,070 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:27,071 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 19:54:27,071 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522884851] [2019-11-15 19:54:27,071 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 19:54:27,072 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:27,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 19:54:27,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:54:27,073 INFO L87 Difference]: Start difference. First operand 6494 states and 8084 transitions. Second operand 5 states. [2019-11-15 19:54:27,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:27,656 INFO L93 Difference]: Finished difference Result 15348 states and 19199 transitions. [2019-11-15 19:54:27,656 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 19:54:27,656 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 89 [2019-11-15 19:54:27,657 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:27,708 INFO L225 Difference]: With dead ends: 15348 [2019-11-15 19:54:27,708 INFO L226 Difference]: Without dead ends: 8934 [2019-11-15 19:54:27,717 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:54:27,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8934 states. [2019-11-15 19:54:28,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8934 to 6542. [2019-11-15 19:54:28,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6542 states. [2019-11-15 19:54:28,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6542 states to 6542 states and 8000 transitions. [2019-11-15 19:54:28,105 INFO L78 Accepts]: Start accepts. Automaton has 6542 states and 8000 transitions. Word has length 89 [2019-11-15 19:54:28,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:28,105 INFO L462 AbstractCegarLoop]: Abstraction has 6542 states and 8000 transitions. [2019-11-15 19:54:28,105 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 19:54:28,105 INFO L276 IsEmpty]: Start isEmpty. Operand 6542 states and 8000 transitions. [2019-11-15 19:54:28,110 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2019-11-15 19:54:28,110 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:28,111 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:28,111 INFO L410 AbstractCegarLoop]: === Iteration 14 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:28,111 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:28,112 INFO L82 PathProgramCache]: Analyzing trace with hash 211800632, now seen corresponding path program 1 times [2019-11-15 19:54:28,112 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:28,112 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699093985] [2019-11-15 19:54:28,112 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:28,113 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:28,113 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:28,124 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:28,165 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 13 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:54:28,165 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699093985] [2019-11-15 19:54:28,165 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:28,165 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:54:28,166 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [392203920] [2019-11-15 19:54:28,166 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:54:28,166 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:28,167 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:54:28,167 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:28,167 INFO L87 Difference]: Start difference. First operand 6542 states and 8000 transitions. Second operand 3 states. [2019-11-15 19:54:28,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:28,531 INFO L93 Difference]: Finished difference Result 9812 states and 12049 transitions. [2019-11-15 19:54:28,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:54:28,531 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 89 [2019-11-15 19:54:28,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:28,543 INFO L225 Difference]: With dead ends: 9812 [2019-11-15 19:54:28,543 INFO L226 Difference]: Without dead ends: 6542 [2019-11-15 19:54:28,549 INFO L600 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 [2019-11-15 19:54:28,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6542 states. [2019-11-15 19:54:28,837 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6542 to 6512. [2019-11-15 19:54:28,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6512 states. [2019-11-15 19:54:28,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6512 states to 6512 states and 7866 transitions. [2019-11-15 19:54:28,847 INFO L78 Accepts]: Start accepts. Automaton has 6512 states and 7866 transitions. Word has length 89 [2019-11-15 19:54:28,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:28,848 INFO L462 AbstractCegarLoop]: Abstraction has 6512 states and 7866 transitions. [2019-11-15 19:54:28,848 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:54:28,848 INFO L276 IsEmpty]: Start isEmpty. Operand 6512 states and 7866 transitions. [2019-11-15 19:54:28,852 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 91 [2019-11-15 19:54:28,853 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:28,853 INFO L380 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:28,853 INFO L410 AbstractCegarLoop]: === Iteration 15 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:28,853 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:28,854 INFO L82 PathProgramCache]: Analyzing trace with hash -974468191, now seen corresponding path program 1 times [2019-11-15 19:54:28,854 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:28,854 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [408929907] [2019-11-15 19:54:28,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:28,854 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:28,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:28,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:28,899 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 19:54:28,900 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [408929907] [2019-11-15 19:54:28,900 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:28,900 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-11-15 19:54:28,900 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [18650429] [2019-11-15 19:54:28,901 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-11-15 19:54:28,901 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:28,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-11-15 19:54:28,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-11-15 19:54:28,902 INFO L87 Difference]: Start difference. First operand 6512 states and 7866 transitions. Second operand 5 states. [2019-11-15 19:54:29,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:29,360 INFO L93 Difference]: Finished difference Result 12634 states and 15323 transitions. [2019-11-15 19:54:29,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-15 19:54:29,360 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 90 [2019-11-15 19:54:29,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:29,370 INFO L225 Difference]: With dead ends: 12634 [2019-11-15 19:54:29,371 INFO L226 Difference]: Without dead ends: 6178 [2019-11-15 19:54:29,378 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-11-15 19:54:29,386 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6178 states. [2019-11-15 19:54:29,620 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6178 to 4920. [2019-11-15 19:54:29,621 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4920 states. [2019-11-15 19:54:29,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4920 states to 4920 states and 5854 transitions. [2019-11-15 19:54:29,628 INFO L78 Accepts]: Start accepts. Automaton has 4920 states and 5854 transitions. Word has length 90 [2019-11-15 19:54:29,628 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:29,628 INFO L462 AbstractCegarLoop]: Abstraction has 4920 states and 5854 transitions. [2019-11-15 19:54:29,628 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-11-15 19:54:29,628 INFO L276 IsEmpty]: Start isEmpty. Operand 4920 states and 5854 transitions. [2019-11-15 19:54:29,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2019-11-15 19:54:29,631 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:29,632 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:29,632 INFO L410 AbstractCegarLoop]: === Iteration 16 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:29,632 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:29,632 INFO L82 PathProgramCache]: Analyzing trace with hash 724986355, now seen corresponding path program 1 times [2019-11-15 19:54:29,633 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:29,633 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094554303] [2019-11-15 19:54:29,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:29,633 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:29,633 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:29,641 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:29,659 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:54:29,660 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094554303] [2019-11-15 19:54:29,660 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:29,660 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:54:29,660 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [272247] [2019-11-15 19:54:29,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:54:29,661 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:29,661 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:54:29,661 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:29,662 INFO L87 Difference]: Start difference. First operand 4920 states and 5854 transitions. Second operand 3 states. [2019-11-15 19:54:29,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:29,903 INFO L93 Difference]: Finished difference Result 9778 states and 11642 transitions. [2019-11-15 19:54:29,904 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:54:29,904 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 92 [2019-11-15 19:54:29,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:29,911 INFO L225 Difference]: With dead ends: 9778 [2019-11-15 19:54:29,911 INFO L226 Difference]: Without dead ends: 4190 [2019-11-15 19:54:29,918 INFO L600 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 [2019-11-15 19:54:29,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4190 states. [2019-11-15 19:54:30,161 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4190 to 4186. [2019-11-15 19:54:30,161 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4186 states. [2019-11-15 19:54:30,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4186 states to 4186 states and 4930 transitions. [2019-11-15 19:54:30,168 INFO L78 Accepts]: Start accepts. Automaton has 4186 states and 4930 transitions. Word has length 92 [2019-11-15 19:54:30,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:30,169 INFO L462 AbstractCegarLoop]: Abstraction has 4186 states and 4930 transitions. [2019-11-15 19:54:30,170 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:54:30,170 INFO L276 IsEmpty]: Start isEmpty. Operand 4186 states and 4930 transitions. [2019-11-15 19:54:30,174 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 117 [2019-11-15 19:54:30,174 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:30,174 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:30,175 INFO L410 AbstractCegarLoop]: === Iteration 17 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:30,175 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:30,175 INFO L82 PathProgramCache]: Analyzing trace with hash 2141342848, now seen corresponding path program 1 times [2019-11-15 19:54:30,175 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:30,176 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [222929266] [2019-11-15 19:54:30,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:30,176 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:30,176 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:30,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:30,220 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2019-11-15 19:54:30,220 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [222929266] [2019-11-15 19:54:30,221 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:30,221 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:54:30,221 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966231788] [2019-11-15 19:54:30,222 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:54:30,222 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:30,222 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:54:30,222 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:30,223 INFO L87 Difference]: Start difference. First operand 4186 states and 4930 transitions. Second operand 3 states. [2019-11-15 19:54:30,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:30,521 INFO L93 Difference]: Finished difference Result 8752 states and 10233 transitions. [2019-11-15 19:54:30,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:54:30,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 116 [2019-11-15 19:54:30,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:30,526 INFO L225 Difference]: With dead ends: 8752 [2019-11-15 19:54:30,527 INFO L226 Difference]: Without dead ends: 2868 [2019-11-15 19:54:30,535 INFO L600 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 [2019-11-15 19:54:30,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2868 states. [2019-11-15 19:54:30,662 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2868 to 2790. [2019-11-15 19:54:30,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2790 states. [2019-11-15 19:54:30,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2790 states to 2790 states and 3146 transitions. [2019-11-15 19:54:30,667 INFO L78 Accepts]: Start accepts. Automaton has 2790 states and 3146 transitions. Word has length 116 [2019-11-15 19:54:30,667 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:30,667 INFO L462 AbstractCegarLoop]: Abstraction has 2790 states and 3146 transitions. [2019-11-15 19:54:30,667 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:54:30,667 INFO L276 IsEmpty]: Start isEmpty. Operand 2790 states and 3146 transitions. [2019-11-15 19:54:30,670 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 118 [2019-11-15 19:54:30,670 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:30,671 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:30,671 INFO L410 AbstractCegarLoop]: === Iteration 18 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:30,671 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:30,671 INFO L82 PathProgramCache]: Analyzing trace with hash 1717534558, now seen corresponding path program 1 times [2019-11-15 19:54:30,671 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:30,672 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [215836375] [2019-11-15 19:54:30,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:30,672 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:30,672 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:30,687 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-15 19:54:30,728 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-15 19:54:30,728 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [215836375] [2019-11-15 19:54:30,728 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-15 19:54:30,729 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-15 19:54:30,729 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434153108] [2019-11-15 19:54:30,729 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-15 19:54:30,729 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-15 19:54:30,729 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-15 19:54:30,730 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-15 19:54:30,730 INFO L87 Difference]: Start difference. First operand 2790 states and 3146 transitions. Second operand 3 states. [2019-11-15 19:54:30,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-15 19:54:30,855 INFO L93 Difference]: Finished difference Result 3172 states and 3583 transitions. [2019-11-15 19:54:30,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-15 19:54:30,855 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 117 [2019-11-15 19:54:30,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-15 19:54:30,859 INFO L225 Difference]: With dead ends: 3172 [2019-11-15 19:54:30,859 INFO L226 Difference]: Without dead ends: 2470 [2019-11-15 19:54:30,861 INFO L600 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 [2019-11-15 19:54:30,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2470 states. [2019-11-15 19:54:30,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2470 to 2470. [2019-11-15 19:54:30,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2470 states. [2019-11-15 19:54:30,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2470 states to 2470 states and 2766 transitions. [2019-11-15 19:54:30,979 INFO L78 Accepts]: Start accepts. Automaton has 2470 states and 2766 transitions. Word has length 117 [2019-11-15 19:54:30,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-15 19:54:30,980 INFO L462 AbstractCegarLoop]: Abstraction has 2470 states and 2766 transitions. [2019-11-15 19:54:30,980 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-15 19:54:30,980 INFO L276 IsEmpty]: Start isEmpty. Operand 2470 states and 2766 transitions. [2019-11-15 19:54:30,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-15 19:54:30,983 INFO L372 BasicCegarLoop]: Found error trace [2019-11-15 19:54:30,983 INFO L380 BasicCegarLoop]: trace histogram [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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-15 19:54:30,983 INFO L410 AbstractCegarLoop]: === Iteration 19 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-15 19:54:30,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-15 19:54:30,984 INFO L82 PathProgramCache]: Analyzing trace with hash -692010475, now seen corresponding path program 1 times [2019-11-15 19:54:30,984 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-11-15 19:54:30,985 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1195049663] [2019-11-15 19:54:30,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:30,985 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-11-15 19:54:30,985 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-15 19:54:31,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:31,029 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-15 19:54:31,078 INFO L168 tionRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-15 19:54:31,078 INFO L445 BasicCegarLoop]: Counterexample might be feasible [2019-11-15 19:54:31,188 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 15.11 07:54:31 BoogieIcfgContainer [2019-11-15 19:54:31,188 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-15 19:54:31,189 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-15 19:54:31,189 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-15 19:54:31,189 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-15 19:54:31,190 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 15.11 07:54:23" (3/4) ... [2019-11-15 19:54:31,191 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-15 19:54:31,354 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_14e7e710-3b4d-4d88-8112-d0dce6a4b335/bin/uautomizer/witness.graphml [2019-11-15 19:54:31,354 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-15 19:54:31,356 INFO L168 Benchmark]: Toolchain (without parser) took 9569.17 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 494.4 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -109.4 MB). Peak memory consumption was 385.0 MB. Max. memory is 11.5 GB. [2019-11-15 19:54:31,356 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 19:54:31,358 INFO L168 Benchmark]: CACSL2BoogieTranslator took 521.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -194.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. [2019-11-15 19:54:31,358 INFO L168 Benchmark]: Boogie Procedure Inliner took 75.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-15 19:54:31,359 INFO L168 Benchmark]: Boogie Preprocessor took 90.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2019-11-15 19:54:31,361 INFO L168 Benchmark]: RCFGBuilder took 757.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. [2019-11-15 19:54:31,361 INFO L168 Benchmark]: TraceAbstraction took 7951.63 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 343.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.4 MB). Peak memory consumption was 355.8 MB. Max. memory is 11.5 GB. [2019-11-15 19:54:31,361 INFO L168 Benchmark]: Witness Printer took 165.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. [2019-11-15 19:54:31,363 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 967.5 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 521.15 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 151.0 MB). Free memory was 946.1 MB in the beginning and 1.1 GB in the end (delta: -194.4 MB). Peak memory consumption was 24.4 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 75.23 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 90.39 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * RCFGBuilder took 757.40 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 50.6 MB). Peak memory consumption was 50.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 7951.63 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 343.4 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 12.4 MB). Peak memory consumption was 355.8 MB. Max. memory is 11.5 GB. * Witness Printer took 165.30 ms. Allocated memory is still 1.5 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 16.6 MB). Peak memory consumption was 16.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 11]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L15] int m_pc = 0; [L16] int t1_pc = 0; [L17] int t2_pc = 0; [L18] int m_st ; [L19] int t1_st ; [L20] int t2_st ; [L21] int m_i ; [L22] int t1_i ; [L23] int t2_i ; [L24] int M_E = 2; [L25] int T1_E = 2; [L26] int T2_E = 2; [L27] int E_1 = 2; [L28] int E_2 = 2; VAL [E_1=2, E_2=2, M_E=2, m_i=0, m_pc=0, m_st=0, T1_E=2, t1_i=0, t1_pc=0, t1_st=0, T2_E=2, t2_i=0, t2_pc=0, t2_st=0] [L563] int __retres1 ; [L477] m_i = 1 [L478] t1_i = 1 [L479] t2_i = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L504] int kernel_st ; [L505] int tmp ; [L506] int tmp___0 ; [L510] kernel_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L211] COND TRUE m_i == 1 [L212] m_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L216] COND TRUE t1_i == 1 [L217] t1_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L221] COND TRUE t2_i == 1 [L222] t2_st = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L324] COND FALSE !(M_E == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L329] COND FALSE !(T1_E == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L334] COND FALSE !(T2_E == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L339] COND FALSE !(E_1 == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L344] COND FALSE !(E_2 == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L387] int tmp ; [L388] int tmp___0 ; [L389] int tmp___1 ; [L143] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L146] COND FALSE !(m_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L156] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L158] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L162] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L165] COND FALSE !(t1_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L175] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L177] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L401] tmp___0 = is_transmit1_triggered() [L403] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L181] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L184] COND FALSE !(t2_pc == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L194] __retres1 = 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L196] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L409] tmp___1 = is_transmit2_triggered() [L411] COND FALSE !(\read(tmp___1)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L357] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L362] COND FALSE !(T1_E == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L367] COND FALSE !(T2_E == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L372] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L377] COND FALSE !(E_2 == 1) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L518] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L521] kernel_st = 1 [L257] int tmp ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L261] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L231] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L234] COND TRUE m_st == 0 [L235] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L252] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L264] tmp = exists_runnable_thread() [L266] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L271] COND TRUE m_st == 0 [L272] int tmp_ndt_1; [L273] tmp_ndt_1 = __VERIFIER_nondet_int() [L274] COND FALSE !(\read(tmp_ndt_1)) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=0, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L285] COND TRUE t1_st == 0 [L286] int tmp_ndt_2; [L287] tmp_ndt_2 = __VERIFIER_nondet_int() [L288] COND TRUE \read(tmp_ndt_2) [L290] t1_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L78] COND TRUE t1_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L89] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=0, t1_st=1, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L91] t1_pc = 1 [L92] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=0] [L299] COND TRUE t2_st == 0 [L300] int tmp_ndt_3; [L301] tmp_ndt_3 = __VERIFIER_nondet_int() [L302] COND TRUE \read(tmp_ndt_3) [L304] t2_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L113] COND TRUE t2_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L124] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=0, t2_st=1] [L126] t2_pc = 1 [L127] t2_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L261] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L231] int __retres1 ; VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L234] COND TRUE m_st == 0 [L235] __retres1 = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L252] return (__retres1); VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L264] tmp = exists_runnable_thread() [L266] COND TRUE \read(tmp) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=0, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L271] COND TRUE m_st == 0 [L272] int tmp_ndt_1; [L273] tmp_ndt_1 = __VERIFIER_nondet_int() [L274] COND TRUE \read(tmp_ndt_1) [L276] m_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L37] COND TRUE m_pc == 0 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L48] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L51] E_1 = 1 [L387] int tmp ; [L388] int tmp___0 ; [L389] int tmp___1 ; [L143] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L146] COND FALSE !(m_pc == 1) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L158] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L162] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L165] COND TRUE t1_pc == 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] COND TRUE E_1 == 1 [L167] __retres1 = 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L177] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L401] tmp___0 = is_transmit1_triggered() [L403] COND TRUE \read(tmp___0) [L404] t1_st = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L181] int __retres1 ; VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L184] COND TRUE t2_pc == 1 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L185] COND FALSE !(E_2 == 1) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L194] __retres1 = 0 VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L196] return (__retres1); VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L409] tmp___1 = is_transmit2_triggered() [L411] COND FALSE !(\read(tmp___1)) VAL [E_1=1, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L53] E_1 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L56] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=0, m_st=1, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L58] m_pc = 1 [L59] m_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=0, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L285] COND TRUE t1_st == 0 [L286] int tmp_ndt_2; [L287] tmp_ndt_2 = __VERIFIER_nondet_int() [L288] COND TRUE \read(tmp_ndt_2) [L290] t1_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L78] COND FALSE !(t1_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L81] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L97] E_2 = 1 [L387] int tmp ; [L388] int tmp___0 ; [L389] int tmp___1 ; [L143] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L146] COND TRUE m_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L147] COND FALSE !(M_E == 1) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L156] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L158] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L393] tmp = is_master_triggered() [L395] COND FALSE !(\read(tmp)) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L162] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L165] COND TRUE t1_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L166] COND FALSE !(E_1 == 1) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L175] __retres1 = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L177] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L401] tmp___0 = is_transmit1_triggered() [L403] COND FALSE !(\read(tmp___0)) VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L181] int __retres1 ; VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L184] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L185] COND TRUE E_2 == 1 [L186] __retres1 = 1 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L196] return (__retres1); VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=2] [L409] tmp___1 = is_transmit2_triggered() [L411] COND TRUE \read(tmp___1) [L412] t2_st = 0 VAL [E_1=2, E_2=1, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L99] E_2 = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L89] COND TRUE 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=1, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L91] t1_pc = 1 [L92] t1_st = 2 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=0] [L299] COND TRUE t2_st == 0 [L300] int tmp_ndt_3; [L301] tmp_ndt_3 = __VERIFIER_nondet_int() [L302] COND TRUE \read(tmp_ndt_3) [L304] t2_st = 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L113] COND FALSE !(t2_pc == 0) VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L116] COND TRUE t2_pc == 1 VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] [L11] __VERIFIER_error() VAL [E_1=2, E_2=2, M_E=2, m_i=1, m_pc=1, m_st=2, T1_E=2, t1_i=1, t1_pc=1, t1_st=2, T2_E=2, t2_i=1, t2_pc=1, t2_st=1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 192 locations, 1 error locations. Result: UNSAFE, OverallTime: 7.8s, OverallIterations: 19, TraceHistogramMax: 2, AutomataDifference: 4.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 5274 SDtfs, 4949 SDslu, 4000 SDs, 0 SdLazy, 329 SolverSat, 161 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.5s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 66 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=6542occurred in iteration=13, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 2.4s AutomataMinimizationTime, 18 MinimizatonAttempts, 8022 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 1399 NumberOfCodeBlocks, 1399 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 1263 ConstructedInterpolants, 0 QuantifiedInterpolants, 148665 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 PerfectInterpolantSequences, 126/126 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...