./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/pthread/stack-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 678e0110 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/stack-2.i -s /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/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 56b20b6796faad8ab2b7905f19aea09fce4f4ac8 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................. 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-678e011 [2019-11-19 22:34:00,483 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-11-19 22:34:00,485 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-11-19 22:34:00,496 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-11-19 22:34:00,497 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-11-19 22:34:00,498 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-11-19 22:34:00,500 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-11-19 22:34:00,502 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-11-19 22:34:00,504 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-11-19 22:34:00,505 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-11-19 22:34:00,507 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-11-19 22:34:00,508 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-11-19 22:34:00,508 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-11-19 22:34:00,510 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-11-19 22:34:00,511 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-11-19 22:34:00,512 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-11-19 22:34:00,513 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-11-19 22:34:00,514 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-11-19 22:34:00,516 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-11-19 22:34:00,520 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-11-19 22:34:00,522 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-11-19 22:34:00,523 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-11-19 22:34:00,524 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-11-19 22:34:00,525 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-11-19 22:34:00,528 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-11-19 22:34:00,529 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-11-19 22:34:00,529 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-11-19 22:34:00,530 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-11-19 22:34:00,530 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-11-19 22:34:00,531 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-11-19 22:34:00,532 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-11-19 22:34:00,532 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-11-19 22:34:00,533 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-11-19 22:34:00,534 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-11-19 22:34:00,535 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-11-19 22:34:00,536 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-11-19 22:34:00,536 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-11-19 22:34:00,537 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-11-19 22:34:00,537 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-11-19 22:34:00,538 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-11-19 22:34:00,539 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-11-19 22:34:00,540 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-11-19 22:34:00,554 INFO L113 SettingsManager]: Loading preferences was successful [2019-11-19 22:34:00,555 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-11-19 22:34:00,556 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-11-19 22:34:00,556 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-11-19 22:34:00,557 INFO L138 SettingsManager]: * Use SBE=true [2019-11-19 22:34:00,557 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-11-19 22:34:00,557 INFO L138 SettingsManager]: * sizeof long=4 [2019-11-19 22:34:00,557 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-11-19 22:34:00,558 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-11-19 22:34:00,558 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-11-19 22:34:00,558 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-11-19 22:34:00,558 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-11-19 22:34:00,559 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-11-19 22:34:00,559 INFO L138 SettingsManager]: * sizeof long double=12 [2019-11-19 22:34:00,559 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-11-19 22:34:00,559 INFO L138 SettingsManager]: * Use constant arrays=true [2019-11-19 22:34:00,560 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-11-19 22:34:00,560 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-11-19 22:34:00,560 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-11-19 22:34:00,560 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-11-19 22:34:00,561 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-11-19 22:34:00,561 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-11-19 22:34:00,561 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-11-19 22:34:00,561 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-11-19 22:34:00,562 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-11-19 22:34:00,562 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-11-19 22:34:00,562 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-11-19 22:34:00,562 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-11-19 22:34:00,563 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_7f073047-448d-458d-a6fd-4ade9e2e7f8c/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 -> 56b20b6796faad8ab2b7905f19aea09fce4f4ac8 [2019-11-19 22:34:00,757 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-11-19 22:34:00,770 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-11-19 22:34:00,774 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-11-19 22:34:00,775 INFO L271 PluginConnector]: Initializing CDTParser... [2019-11-19 22:34:00,776 INFO L275 PluginConnector]: CDTParser initialized [2019-11-19 22:34:00,777 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/bin/uautomizer/../../sv-benchmarks/c/pthread/stack-2.i [2019-11-19 22:34:00,846 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/bin/uautomizer/data/70f0cb935/c992d813bb6342518cd96b89018f1f21/FLAGc9ee997b5 [2019-11-19 22:34:01,337 INFO L306 CDTParser]: Found 1 translation units. [2019-11-19 22:34:01,338 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/sv-benchmarks/c/pthread/stack-2.i [2019-11-19 22:34:01,374 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/bin/uautomizer/data/70f0cb935/c992d813bb6342518cd96b89018f1f21/FLAGc9ee997b5 [2019-11-19 22:34:01,586 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/bin/uautomizer/data/70f0cb935/c992d813bb6342518cd96b89018f1f21 [2019-11-19 22:34:01,589 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-11-19 22:34:01,590 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-11-19 22:34:01,592 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-11-19 22:34:01,592 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-11-19 22:34:01,596 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-11-19 22:34:01,598 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:34:01" (1/1) ... [2019-11-19 22:34:01,601 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@e6298ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:01, skipping insertion in model container [2019-11-19 22:34:01,601 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 10:34:01" (1/1) ... [2019-11-19 22:34:01,609 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-11-19 22:34:01,661 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-11-19 22:34:02,253 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:34:02,271 INFO L188 MainTranslator]: Completed pre-run [2019-11-19 22:34:02,326 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-11-19 22:34:02,466 INFO L192 MainTranslator]: Completed translation [2019-11-19 22:34:02,466 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:02 WrapperNode [2019-11-19 22:34:02,467 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-11-19 22:34:02,467 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-11-19 22:34:02,468 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-11-19 22:34:02,468 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-11-19 22:34:02,477 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:02" (1/1) ... [2019-11-19 22:34:02,497 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:02" (1/1) ... [2019-11-19 22:34:02,529 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-11-19 22:34:02,529 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-11-19 22:34:02,529 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-11-19 22:34:02,530 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-11-19 22:34:02,539 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:02" (1/1) ... [2019-11-19 22:34:02,539 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:02" (1/1) ... [2019-11-19 22:34:02,544 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:02" (1/1) ... [2019-11-19 22:34:02,544 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:02" (1/1) ... [2019-11-19 22:34:02,553 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:02" (1/1) ... [2019-11-19 22:34:02,558 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:02" (1/1) ... [2019-11-19 22:34:02,561 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:02" (1/1) ... [2019-11-19 22:34:02,565 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-11-19 22:34:02,565 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-11-19 22:34:02,565 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-11-19 22:34:02,565 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-11-19 22:34:02,566 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:02" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/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-19 22:34:02,638 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2019-11-19 22:34:02,638 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2019-11-19 22:34:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2019-11-19 22:34:02,639 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2019-11-19 22:34:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-11-19 22:34:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-11-19 22:34:02,639 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-11-19 22:34:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-11-19 22:34:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2019-11-19 22:34:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2019-11-19 22:34:02,640 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-11-19 22:34:02,640 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-11-19 22:34:02,642 WARN L203 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-11-19 22:34:03,336 INFO L280 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-11-19 22:34:03,337 INFO L285 CfgBuilder]: Removed 24 assume(true) statements. [2019-11-19 22:34:03,338 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:34:03 BoogieIcfgContainer [2019-11-19 22:34:03,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-11-19 22:34:03,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-11-19 22:34:03,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-11-19 22:34:03,344 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-11-19 22:34:03,344 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 10:34:01" (1/3) ... [2019-11-19 22:34:03,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3278bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:34:03, skipping insertion in model container [2019-11-19 22:34:03,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 10:34:02" (2/3) ... [2019-11-19 22:34:03,346 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b3278bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 10:34:03, skipping insertion in model container [2019-11-19 22:34:03,346 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:34:03" (3/3) ... [2019-11-19 22:34:03,348 INFO L109 eAbstractionObserver]: Analyzing ICFG stack-2.i [2019-11-19 22:34:03,416 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,417 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,417 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,417 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,417 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,418 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork2_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,418 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,418 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,418 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,418 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,419 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,419 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,419 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,419 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,420 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork2_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,420 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,420 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork2_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,420 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork2_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,420 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,421 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,421 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,421 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,421 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_push_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,421 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork2_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,422 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork2_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,422 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,422 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork2_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,422 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,422 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,423 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork2_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,423 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork2_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,423 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,423 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork2_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,423 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_push_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,424 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,424 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,424 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,425 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,425 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,425 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,426 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,426 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,426 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,427 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,427 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,428 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork2_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,428 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork2_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,428 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,429 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork2_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,429 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,429 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,429 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,430 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_inc_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,430 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_inc_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,430 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,430 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,430 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_inc_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,431 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,431 WARN L315 ript$VariableManager]: TermVariabe t1Thread2of3ForFork2_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,431 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_inc_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,431 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,431 WARN L315 ript$VariableManager]: TermVariabe |t1Thread2of3ForFork2_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,433 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,433 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,433 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork4_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,433 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork4_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,433 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork4_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,434 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork4_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,434 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork4_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,434 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork4_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,434 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork4_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,434 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,435 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,436 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,436 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,437 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,437 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork4_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,437 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,438 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork4_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,438 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork4_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,438 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,438 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,438 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,439 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,439 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_push_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,439 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork4_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,439 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork4_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,439 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,439 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork4_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,440 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,440 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,440 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork4_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,441 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork4_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,441 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,441 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork4_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,441 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_push_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,442 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,442 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,442 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,443 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,446 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,446 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,447 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,447 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,447 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,448 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,448 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,448 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork4_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,448 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork4_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,448 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,449 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork4_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,449 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,457 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,460 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,461 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_inc_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,461 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_inc_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,461 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork4_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,462 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,462 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_inc_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,462 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,462 WARN L315 ript$VariableManager]: TermVariabe t1Thread3of3ForFork4_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,462 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_inc_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,462 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,463 WARN L315 ript$VariableManager]: TermVariabe |t1Thread3of3ForFork4_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,463 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,464 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,464 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,464 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,464 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,464 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,465 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,465 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,465 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,465 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,465 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,466 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,466 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_#t~nondet43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,466 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,466 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,466 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_#t~nondet44| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,467 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,467 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork0_~tmp~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,467 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,467 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,467 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,468 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,468 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_push_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,468 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,468 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,468 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,469 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,469 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_push_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,469 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_push_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,469 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,469 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,469 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_push_#in~x| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,470 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,470 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_push_#t~nondet34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,470 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,470 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,470 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,471 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,471 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,471 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,471 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,471 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,472 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,472 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,472 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,472 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork0_push_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,472 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork0_push_~x not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,472 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,473 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork0_push_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,473 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,474 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_#t~ret45| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,474 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_push_#t~ret36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,474 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_inc_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,474 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_inc_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,475 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,475 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,475 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_inc_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,475 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,475 WARN L315 ript$VariableManager]: TermVariabe t1Thread1of3ForFork0_~i~0 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,476 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_inc_top_#t~post31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,476 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_#t~post42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,476 WARN L315 ript$VariableManager]: TermVariabe |t1Thread1of3ForFork0_push_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,477 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,477 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,477 WARN L315 ript$VariableManager]: TermVariabe t2Thread3of3ForFork5_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,478 WARN L315 ript$VariableManager]: TermVariabe t2Thread3of3ForFork5_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,478 WARN L315 ript$VariableManager]: TermVariabe t2Thread3of3ForFork5_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,478 WARN L315 ript$VariableManager]: TermVariabe t2Thread3of3ForFork5_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,478 WARN L315 ript$VariableManager]: TermVariabe t2Thread3of3ForFork5_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,478 WARN L315 ript$VariableManager]: TermVariabe t2Thread3of3ForFork5_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,479 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,479 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,479 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,479 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,480 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,480 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,480 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,480 WARN L315 ript$VariableManager]: TermVariabe t2Thread3of3ForFork5_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,480 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,480 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_pop_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,481 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,481 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_pop_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,481 WARN L315 ript$VariableManager]: TermVariabe t2Thread3of3ForFork5_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,481 WARN L315 ript$VariableManager]: TermVariabe t2Thread3of3ForFork5_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,481 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,481 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,482 WARN L315 ript$VariableManager]: TermVariabe t2Thread3of3ForFork5_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,482 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,482 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,482 WARN L315 ript$VariableManager]: TermVariabe t2Thread3of3ForFork5_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,482 WARN L315 ript$VariableManager]: TermVariabe t2Thread3of3ForFork5_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,483 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,483 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,483 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,483 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,483 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,484 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,484 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,484 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,484 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,484 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,485 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_pop_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,485 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_dec_top_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,485 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,487 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_dec_top_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,487 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,488 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,488 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_dec_top_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,488 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,488 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_dec_top_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,488 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,489 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,489 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,489 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,489 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,490 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,490 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,491 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,491 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,491 WARN L315 ript$VariableManager]: TermVariabe t2Thread3of3ForFork5_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,491 WARN L315 ript$VariableManager]: TermVariabe t2Thread3of3ForFork5_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,492 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,492 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_pop_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,492 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_pop_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,492 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,492 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,492 WARN L315 ript$VariableManager]: TermVariabe |t2Thread3of3ForFork5_pop_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,494 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,494 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,495 WARN L315 ript$VariableManager]: TermVariabe t2Thread2of3ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,495 WARN L315 ript$VariableManager]: TermVariabe t2Thread2of3ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,496 WARN L315 ript$VariableManager]: TermVariabe t2Thread2of3ForFork3_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,496 WARN L315 ript$VariableManager]: TermVariabe t2Thread2of3ForFork3_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,496 WARN L315 ript$VariableManager]: TermVariabe t2Thread2of3ForFork3_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,497 WARN L315 ript$VariableManager]: TermVariabe t2Thread2of3ForFork3_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,497 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,497 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,497 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,498 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,498 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,498 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,498 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,498 WARN L315 ript$VariableManager]: TermVariabe t2Thread2of3ForFork3_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,499 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,499 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_pop_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,499 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,499 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_pop_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,499 WARN L315 ript$VariableManager]: TermVariabe t2Thread2of3ForFork3_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,499 WARN L315 ript$VariableManager]: TermVariabe t2Thread2of3ForFork3_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,499 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,500 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,500 WARN L315 ript$VariableManager]: TermVariabe t2Thread2of3ForFork3_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,500 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,500 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,500 WARN L315 ript$VariableManager]: TermVariabe t2Thread2of3ForFork3_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,500 WARN L315 ript$VariableManager]: TermVariabe t2Thread2of3ForFork3_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,501 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,501 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,501 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,501 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,501 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,501 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,503 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,503 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,503 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,503 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,504 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_pop_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,504 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_dec_top_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,504 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,504 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_dec_top_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,504 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,504 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,505 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_dec_top_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,505 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,505 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_dec_top_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,505 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,505 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,505 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,506 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,506 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,506 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,506 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,506 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,508 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,508 WARN L315 ript$VariableManager]: TermVariabe t2Thread2of3ForFork3_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,508 WARN L315 ript$VariableManager]: TermVariabe t2Thread2of3ForFork3_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,509 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,509 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_pop_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,509 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_pop_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,509 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,509 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,509 WARN L315 ript$VariableManager]: TermVariabe |t2Thread2of3ForFork3_pop_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,513 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,513 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,513 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of3ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,514 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of3ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,514 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of3ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,514 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of3ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,514 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of3ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,514 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of3ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,515 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,515 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,516 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,516 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_#t~nondet47| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,516 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,516 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,521 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,522 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of3ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,522 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,522 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_pop_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,522 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,523 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_pop_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,523 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of3ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,523 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of3ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,523 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,523 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,523 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of3ForFork1_~i~1 not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,523 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_pop_#in~stack.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,524 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_pop_#in~stack.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,524 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of3ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,524 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of3ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,524 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_#t~post46| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,524 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,524 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,525 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,525 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,525 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,525 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,526 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,526 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,533 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_pop_#t~ret37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,537 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_pop_#t~nondet38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,537 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_dec_top_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,537 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,538 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_dec_top_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,538 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,538 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,538 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_dec_top_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,538 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,538 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_dec_top_#t~post32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,539 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,539 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,539 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,539 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,539 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_#t~ret48| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,539 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,540 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_get_top_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,540 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,540 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,540 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of3ForFork1_pop_~stack.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,540 WARN L315 ript$VariableManager]: TermVariabe t2Thread1of3ForFork1_pop_~stack.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,540 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,541 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_pop_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,541 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_pop_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,541 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_pop_#res| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,541 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_pop_#t~ret40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,541 WARN L315 ript$VariableManager]: TermVariabe |t2Thread1of3ForFork1_pop_#t~mem41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-11-19 22:34:03,586 WARN L142 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-11-19 22:34:03,587 INFO L153 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-11-19 22:34:03,598 INFO L165 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2019-11-19 22:34:03,613 INFO L249 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2019-11-19 22:34:03,641 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-11-19 22:34:03,641 INFO L374 AbstractCegarLoop]: Hoare is true [2019-11-19 22:34:03,641 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-11-19 22:34:03,641 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-11-19 22:34:03,642 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-11-19 22:34:03,642 INFO L378 AbstractCegarLoop]: Difference is false [2019-11-19 22:34:03,642 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-11-19 22:34:03,642 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-11-19 22:34:03,673 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 326 places, 348 transitions [2019-11-19 22:34:08,396 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 55889 states. [2019-11-19 22:34:08,398 INFO L276 IsEmpty]: Start isEmpty. Operand 55889 states. [2019-11-19 22:34:08,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2019-11-19 22:34:08,485 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:08,486 INFO L410 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-19 22:34:08,487 INFO L410 AbstractCegarLoop]: === Iteration 1 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:34:08,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:08,494 INFO L82 PathProgramCache]: Analyzing trace with hash 1470251822, now seen corresponding path program 1 times [2019-11-19 22:34:08,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:34:08,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463008912] [2019-11-19 22:34:08,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:34:08,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:08,893 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-19 22:34:08,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463008912] [2019-11-19 22:34:08,895 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:34:08,896 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:34:08,896 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [456043661] [2019-11-19 22:34:08,906 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:34:08,907 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:34:08,924 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:34:08,925 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:34:08,928 INFO L87 Difference]: Start difference. First operand 55889 states. Second operand 3 states. [2019-11-19 22:34:09,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:09,913 INFO L93 Difference]: Finished difference Result 84347 states and 230048 transitions. [2019-11-19 22:34:09,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:34:09,915 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 49 [2019-11-19 22:34:09,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:10,452 INFO L225 Difference]: With dead ends: 84347 [2019-11-19 22:34:10,452 INFO L226 Difference]: Without dead ends: 83735 [2019-11-19 22:34:10,454 INFO L630 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-19 22:34:11,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83735 states. [2019-11-19 22:34:13,031 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83735 to 71495. [2019-11-19 22:34:13,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71495 states. [2019-11-19 22:34:13,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71495 states to 71495 states and 196057 transitions. [2019-11-19 22:34:13,342 INFO L78 Accepts]: Start accepts. Automaton has 71495 states and 196057 transitions. Word has length 49 [2019-11-19 22:34:13,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:13,343 INFO L462 AbstractCegarLoop]: Abstraction has 71495 states and 196057 transitions. [2019-11-19 22:34:13,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:34:13,343 INFO L276 IsEmpty]: Start isEmpty. Operand 71495 states and 196057 transitions. [2019-11-19 22:34:13,401 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2019-11-19 22:34:13,402 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:13,402 INFO L410 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, 1, 1] [2019-11-19 22:34:13,402 INFO L410 AbstractCegarLoop]: === Iteration 2 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:34:13,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:13,403 INFO L82 PathProgramCache]: Analyzing trace with hash -1927459616, now seen corresponding path program 1 times [2019-11-19 22:34:13,403 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:34:13,404 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579469001] [2019-11-19 22:34:13,404 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:34:13,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:13,568 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-19 22:34:13,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579469001] [2019-11-19 22:34:13,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:34:13,570 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:34:13,570 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [342262499] [2019-11-19 22:34:13,572 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:34:13,572 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:34:13,573 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:34:13,573 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:34:13,573 INFO L87 Difference]: Start difference. First operand 71495 states and 196057 transitions. Second operand 3 states. [2019-11-19 22:34:13,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:13,934 INFO L93 Difference]: Finished difference Result 65420 states and 177850 transitions. [2019-11-19 22:34:13,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:34:13,935 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 53 [2019-11-19 22:34:13,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:14,667 INFO L225 Difference]: With dead ends: 65420 [2019-11-19 22:34:14,667 INFO L226 Difference]: Without dead ends: 64403 [2019-11-19 22:34:14,668 INFO L630 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-19 22:34:15,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64403 states. [2019-11-19 22:34:15,931 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64403 to 62693. [2019-11-19 22:34:15,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62693 states. [2019-11-19 22:34:16,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62693 states to 62693 states and 171091 transitions. [2019-11-19 22:34:16,044 INFO L78 Accepts]: Start accepts. Automaton has 62693 states and 171091 transitions. Word has length 53 [2019-11-19 22:34:16,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:16,046 INFO L462 AbstractCegarLoop]: Abstraction has 62693 states and 171091 transitions. [2019-11-19 22:34:16,046 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:34:16,046 INFO L276 IsEmpty]: Start isEmpty. Operand 62693 states and 171091 transitions. [2019-11-19 22:34:16,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-19 22:34:16,070 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:16,070 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:34:16,070 INFO L410 AbstractCegarLoop]: === Iteration 3 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:34:16,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:16,071 INFO L82 PathProgramCache]: Analyzing trace with hash 1082076049, now seen corresponding path program 1 times [2019-11-19 22:34:16,071 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:34:16,071 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696924494] [2019-11-19 22:34:16,071 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:34:16,094 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:16,144 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-19 22:34:16,145 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696924494] [2019-11-19 22:34:16,145 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:34:16,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 22:34:16,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1072032482] [2019-11-19 22:34:16,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:34:16,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:34:16,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:34:16,148 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:34:16,148 INFO L87 Difference]: Start difference. First operand 62693 states and 171091 transitions. Second operand 4 states. [2019-11-19 22:34:17,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:17,124 INFO L93 Difference]: Finished difference Result 71084 states and 193560 transitions. [2019-11-19 22:34:17,124 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:34:17,125 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-19 22:34:17,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:17,216 INFO L225 Difference]: With dead ends: 71084 [2019-11-19 22:34:17,216 INFO L226 Difference]: Without dead ends: 71084 [2019-11-19 22:34:17,216 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:34:17,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71084 states. [2019-11-19 22:34:18,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71084 to 63647. [2019-11-19 22:34:18,333 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63647 states. [2019-11-19 22:34:18,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63647 states to 63647 states and 173662 transitions. [2019-11-19 22:34:18,446 INFO L78 Accepts]: Start accepts. Automaton has 63647 states and 173662 transitions. Word has length 58 [2019-11-19 22:34:18,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:18,447 INFO L462 AbstractCegarLoop]: Abstraction has 63647 states and 173662 transitions. [2019-11-19 22:34:18,447 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:34:18,447 INFO L276 IsEmpty]: Start isEmpty. Operand 63647 states and 173662 transitions. [2019-11-19 22:34:18,464 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-19 22:34:18,464 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:18,464 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:34:18,464 INFO L410 AbstractCegarLoop]: === Iteration 4 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:34:18,465 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:18,465 INFO L82 PathProgramCache]: Analyzing trace with hash -1704023150, now seen corresponding path program 1 times [2019-11-19 22:34:18,465 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:34:18,465 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [776124956] [2019-11-19 22:34:18,465 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:34:18,485 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:18,533 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-19 22:34:18,534 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [776124956] [2019-11-19 22:34:18,534 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:34:18,534 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 22:34:18,535 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [895203350] [2019-11-19 22:34:18,535 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:34:18,535 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:34:18,536 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:34:18,536 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:34:18,536 INFO L87 Difference]: Start difference. First operand 63647 states and 173662 transitions. Second operand 4 states. [2019-11-19 22:34:18,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:18,872 INFO L93 Difference]: Finished difference Result 72038 states and 196131 transitions. [2019-11-19 22:34:18,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:34:18,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-19 22:34:18,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:18,976 INFO L225 Difference]: With dead ends: 72038 [2019-11-19 22:34:18,976 INFO L226 Difference]: Without dead ends: 72038 [2019-11-19 22:34:18,976 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:34:19,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72038 states. [2019-11-19 22:34:20,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72038 to 64601. [2019-11-19 22:34:20,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64601 states. [2019-11-19 22:34:21,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64601 states to 64601 states and 176233 transitions. [2019-11-19 22:34:21,002 INFO L78 Accepts]: Start accepts. Automaton has 64601 states and 176233 transitions. Word has length 58 [2019-11-19 22:34:21,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:21,002 INFO L462 AbstractCegarLoop]: Abstraction has 64601 states and 176233 transitions. [2019-11-19 22:34:21,002 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:34:21,002 INFO L276 IsEmpty]: Start isEmpty. Operand 64601 states and 176233 transitions. [2019-11-19 22:34:21,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2019-11-19 22:34:21,018 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:21,018 INFO L410 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, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:34:21,018 INFO L410 AbstractCegarLoop]: === Iteration 5 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:34:21,019 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:21,019 INFO L82 PathProgramCache]: Analyzing trace with hash 708478355, now seen corresponding path program 1 times [2019-11-19 22:34:21,019 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:34:21,019 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204617168] [2019-11-19 22:34:21,020 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:34:21,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:21,117 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-19 22:34:21,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204617168] [2019-11-19 22:34:21,118 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:34:21,118 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-11-19 22:34:21,118 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [797441552] [2019-11-19 22:34:21,118 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-11-19 22:34:21,119 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:34:21,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-11-19 22:34:21,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-11-19 22:34:21,119 INFO L87 Difference]: Start difference. First operand 64601 states and 176233 transitions. Second operand 4 states. [2019-11-19 22:34:21,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:21,365 INFO L93 Difference]: Finished difference Result 72992 states and 198702 transitions. [2019-11-19 22:34:21,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-11-19 22:34:21,366 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 58 [2019-11-19 22:34:21,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:21,473 INFO L225 Difference]: With dead ends: 72992 [2019-11-19 22:34:21,473 INFO L226 Difference]: Without dead ends: 72992 [2019-11-19 22:34:21,474 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-11-19 22:34:21,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72992 states. [2019-11-19 22:34:22,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72992 to 65555. [2019-11-19 22:34:22,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65555 states. [2019-11-19 22:34:22,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65555 states to 65555 states and 178804 transitions. [2019-11-19 22:34:22,660 INFO L78 Accepts]: Start accepts. Automaton has 65555 states and 178804 transitions. Word has length 58 [2019-11-19 22:34:22,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:22,661 INFO L462 AbstractCegarLoop]: Abstraction has 65555 states and 178804 transitions. [2019-11-19 22:34:22,661 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-11-19 22:34:22,661 INFO L276 IsEmpty]: Start isEmpty. Operand 65555 states and 178804 transitions. [2019-11-19 22:34:22,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-19 22:34:22,692 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:22,692 INFO L410 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] [2019-11-19 22:34:22,693 INFO L410 AbstractCegarLoop]: === Iteration 6 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:34:22,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:22,693 INFO L82 PathProgramCache]: Analyzing trace with hash 530004389, now seen corresponding path program 1 times [2019-11-19 22:34:22,693 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:34:22,693 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361624339] [2019-11-19 22:34:22,693 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:34:22,721 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:22,838 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:34:22,838 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361624339] [2019-11-19 22:34:22,839 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1548631618] [2019-11-19 22:34:22,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/bin/uautomizer/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:34:22,992 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:22,995 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:34:23,008 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:34:23,075 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:34:23,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:34:23,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-19 22:34:23,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1440110518] [2019-11-19 22:34:23,076 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:34:23,077 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:34:23,077 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:34:23,077 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:34:23,078 INFO L87 Difference]: Start difference. First operand 65555 states and 178804 transitions. Second operand 7 states. [2019-11-19 22:34:23,622 WARN L191 SmtUtils]: Spent 497.00 ms on a formula simplification that was a NOOP. DAG size: 6 [2019-11-19 22:34:23,982 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:23,983 INFO L93 Difference]: Finished difference Result 76283 states and 207424 transitions. [2019-11-19 22:34:23,983 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:34:23,983 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-11-19 22:34:23,983 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:24,177 INFO L225 Difference]: With dead ends: 76283 [2019-11-19 22:34:24,177 INFO L226 Difference]: Without dead ends: 76283 [2019-11-19 22:34:24,178 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:34:24,604 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76283 states. [2019-11-19 22:34:25,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76283 to 71459. [2019-11-19 22:34:25,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71459 states. [2019-11-19 22:34:25,621 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71459 states to 71459 states and 195001 transitions. [2019-11-19 22:34:25,621 INFO L78 Accepts]: Start accepts. Automaton has 71459 states and 195001 transitions. Word has length 81 [2019-11-19 22:34:25,622 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:25,622 INFO L462 AbstractCegarLoop]: Abstraction has 71459 states and 195001 transitions. [2019-11-19 22:34:25,622 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:34:25,622 INFO L276 IsEmpty]: Start isEmpty. Operand 71459 states and 195001 transitions. [2019-11-19 22:34:25,716 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-19 22:34:25,716 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:25,716 INFO L410 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] [2019-11-19 22:34:25,919 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:34:25,920 INFO L410 AbstractCegarLoop]: === Iteration 7 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:34:25,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:25,920 INFO L82 PathProgramCache]: Analyzing trace with hash -86044314, now seen corresponding path program 1 times [2019-11-19 22:34:25,920 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:34:25,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1278458481] [2019-11-19 22:34:25,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:34:25,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:26,094 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:34:26,094 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1278458481] [2019-11-19 22:34:26,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2073926145] [2019-11-19 22:34:26,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/bin/uautomizer/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:34:26,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:26,237 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:34:26,252 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:34:26,293 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:34:26,293 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:34:26,293 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-19 22:34:26,294 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1892635145] [2019-11-19 22:34:26,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:34:26,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:34:26,295 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:34:26,296 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:34:26,296 INFO L87 Difference]: Start difference. First operand 71459 states and 195001 transitions. Second operand 7 states. [2019-11-19 22:34:26,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:26,769 INFO L93 Difference]: Finished difference Result 81917 states and 222982 transitions. [2019-11-19 22:34:26,769 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:34:26,769 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-11-19 22:34:26,770 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:26,946 INFO L225 Difference]: With dead ends: 81917 [2019-11-19 22:34:26,946 INFO L226 Difference]: Without dead ends: 81917 [2019-11-19 22:34:26,947 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:34:27,401 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81917 states. [2019-11-19 22:34:28,987 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81917 to 77363. [2019-11-19 22:34:28,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77363 states. [2019-11-19 22:34:29,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77363 states to 77363 states and 211198 transitions. [2019-11-19 22:34:29,129 INFO L78 Accepts]: Start accepts. Automaton has 77363 states and 211198 transitions. Word has length 81 [2019-11-19 22:34:29,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:29,130 INFO L462 AbstractCegarLoop]: Abstraction has 77363 states and 211198 transitions. [2019-11-19 22:34:29,130 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:34:29,130 INFO L276 IsEmpty]: Start isEmpty. Operand 77363 states and 211198 transitions. [2019-11-19 22:34:29,164 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2019-11-19 22:34:29,165 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:29,165 INFO L410 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] [2019-11-19 22:34:29,368 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:34:29,369 INFO L410 AbstractCegarLoop]: === Iteration 8 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:34:29,369 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:29,369 INFO L82 PathProgramCache]: Analyzing trace with hash 252486100, now seen corresponding path program 1 times [2019-11-19 22:34:29,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:34:29,370 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [876847681] [2019-11-19 22:34:29,370 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:34:29,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:29,465 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:34:29,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [876847681] [2019-11-19 22:34:29,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1040321201] [2019-11-19 22:34:29,466 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/bin/uautomizer/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:34:29,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:29,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 4 conjunts are in the unsatisfiable core [2019-11-19 22:34:29,596 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:34:29,631 INFO L134 CoverageAnalysis]: Checked inductivity of 15 backedges. 3 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:34:29,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:34:29,638 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 7 [2019-11-19 22:34:29,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270777090] [2019-11-19 22:34:29,639 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:34:29,639 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:34:29,640 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:34:29,640 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:34:29,640 INFO L87 Difference]: Start difference. First operand 77363 states and 211198 transitions. Second operand 7 states. [2019-11-19 22:34:30,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:30,139 INFO L93 Difference]: Finished difference Result 87551 states and 238540 transitions. [2019-11-19 22:34:30,139 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-11-19 22:34:30,139 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 81 [2019-11-19 22:34:30,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:30,316 INFO L225 Difference]: With dead ends: 87551 [2019-11-19 22:34:30,317 INFO L226 Difference]: Without dead ends: 87551 [2019-11-19 22:34:30,317 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 80 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:34:30,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87551 states. [2019-11-19 22:34:31,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87551 to 83267. [2019-11-19 22:34:31,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 83267 states. [2019-11-19 22:34:31,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83267 states to 83267 states and 227395 transitions. [2019-11-19 22:34:31,774 INFO L78 Accepts]: Start accepts. Automaton has 83267 states and 227395 transitions. Word has length 81 [2019-11-19 22:34:31,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:31,774 INFO L462 AbstractCegarLoop]: Abstraction has 83267 states and 227395 transitions. [2019-11-19 22:34:31,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:34:31,774 INFO L276 IsEmpty]: Start isEmpty. Operand 83267 states and 227395 transitions. [2019-11-19 22:34:31,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2019-11-19 22:34:31,820 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:31,820 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:34:32,020 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:34:32,021 INFO L410 AbstractCegarLoop]: === Iteration 9 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:34:32,021 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:32,021 INFO L82 PathProgramCache]: Analyzing trace with hash 1688027991, now seen corresponding path program 1 times [2019-11-19 22:34:32,021 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:34:32,021 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930375107] [2019-11-19 22:34:32,022 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:34:32,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:32,070 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-19 22:34:32,070 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930375107] [2019-11-19 22:34:32,071 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:34:32,071 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-11-19 22:34:32,071 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228733325] [2019-11-19 22:34:32,072 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-11-19 22:34:32,072 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:34:32,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-11-19 22:34:32,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-11-19 22:34:32,073 INFO L87 Difference]: Start difference. First operand 83267 states and 227395 transitions. Second operand 3 states. [2019-11-19 22:34:32,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:32,266 INFO L93 Difference]: Finished difference Result 40364 states and 105886 transitions. [2019-11-19 22:34:32,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-11-19 22:34:32,267 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 85 [2019-11-19 22:34:32,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:32,315 INFO L225 Difference]: With dead ends: 40364 [2019-11-19 22:34:32,316 INFO L226 Difference]: Without dead ends: 40364 [2019-11-19 22:34:32,316 INFO L630 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-19 22:34:32,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40364 states. [2019-11-19 22:34:32,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40364 to 39419. [2019-11-19 22:34:32,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39419 states. [2019-11-19 22:34:32,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39419 states to 39419 states and 103501 transitions. [2019-11-19 22:34:32,904 INFO L78 Accepts]: Start accepts. Automaton has 39419 states and 103501 transitions. Word has length 85 [2019-11-19 22:34:32,904 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:32,904 INFO L462 AbstractCegarLoop]: Abstraction has 39419 states and 103501 transitions. [2019-11-19 22:34:32,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-11-19 22:34:32,905 INFO L276 IsEmpty]: Start isEmpty. Operand 39419 states and 103501 transitions. [2019-11-19 22:34:32,927 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-19 22:34:32,928 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:32,928 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:34:32,928 INFO L410 AbstractCegarLoop]: === Iteration 10 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:34:32,928 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:32,928 INFO L82 PathProgramCache]: Analyzing trace with hash 655565977, now seen corresponding path program 1 times [2019-11-19 22:34:32,928 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:34:32,929 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [778100446] [2019-11-19 22:34:32,929 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:34:32,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:33,049 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-19 22:34:33,049 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [778100446] [2019-11-19 22:34:33,050 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:34:33,051 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 22:34:33,051 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1056268670] [2019-11-19 22:34:33,051 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:34:33,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:34:33,052 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:34:33,052 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:34:33,052 INFO L87 Difference]: Start difference. First operand 39419 states and 103501 transitions. Second operand 7 states. [2019-11-19 22:34:35,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:35,958 INFO L93 Difference]: Finished difference Result 53816 states and 141329 transitions. [2019-11-19 22:34:35,958 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:34:35,958 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-11-19 22:34:35,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:36,050 INFO L225 Difference]: With dead ends: 53816 [2019-11-19 22:34:36,050 INFO L226 Difference]: Without dead ends: 53816 [2019-11-19 22:34:36,051 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:34:36,266 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53816 states. [2019-11-19 22:34:36,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53816 to 40994. [2019-11-19 22:34:36,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 40994 states. [2019-11-19 22:34:36,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40994 states to 40994 states and 107683 transitions. [2019-11-19 22:34:36,766 INFO L78 Accepts]: Start accepts. Automaton has 40994 states and 107683 transitions. Word has length 86 [2019-11-19 22:34:36,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:36,766 INFO L462 AbstractCegarLoop]: Abstraction has 40994 states and 107683 transitions. [2019-11-19 22:34:36,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:34:36,767 INFO L276 IsEmpty]: Start isEmpty. Operand 40994 states and 107683 transitions. [2019-11-19 22:34:36,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-19 22:34:36,789 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:36,789 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:34:36,790 INFO L410 AbstractCegarLoop]: === Iteration 11 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:34:36,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:36,790 INFO L82 PathProgramCache]: Analyzing trace with hash 1574071066, now seen corresponding path program 1 times [2019-11-19 22:34:36,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:34:36,790 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [833280347] [2019-11-19 22:34:36,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:34:36,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:36,907 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-19 22:34:36,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [833280347] [2019-11-19 22:34:36,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:34:36,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 22:34:36,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [258289595] [2019-11-19 22:34:36,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:34:36,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:34:36,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:34:36,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:34:36,909 INFO L87 Difference]: Start difference. First operand 40994 states and 107683 transitions. Second operand 7 states. [2019-11-19 22:34:37,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:37,363 INFO L93 Difference]: Finished difference Result 52826 states and 138674 transitions. [2019-11-19 22:34:37,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:34:37,364 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-11-19 22:34:37,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:37,460 INFO L225 Difference]: With dead ends: 52826 [2019-11-19 22:34:37,460 INFO L226 Difference]: Without dead ends: 52826 [2019-11-19 22:34:37,461 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:34:37,672 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52826 states. [2019-11-19 22:34:38,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52826 to 42470. [2019-11-19 22:34:38,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42470 states. [2019-11-19 22:34:38,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42470 states to 42470 states and 111601 transitions. [2019-11-19 22:34:38,200 INFO L78 Accepts]: Start accepts. Automaton has 42470 states and 111601 transitions. Word has length 86 [2019-11-19 22:34:38,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:38,200 INFO L462 AbstractCegarLoop]: Abstraction has 42470 states and 111601 transitions. [2019-11-19 22:34:38,200 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:34:38,200 INFO L276 IsEmpty]: Start isEmpty. Operand 42470 states and 111601 transitions. [2019-11-19 22:34:38,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-19 22:34:38,222 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:38,223 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:34:38,223 INFO L410 AbstractCegarLoop]: === Iteration 12 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:34:38,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:38,223 INFO L82 PathProgramCache]: Analyzing trace with hash 28136544, now seen corresponding path program 1 times [2019-11-19 22:34:38,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:34:38,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476658184] [2019-11-19 22:34:38,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:34:38,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:38,312 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-19 22:34:38,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476658184] [2019-11-19 22:34:38,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:34:38,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 22:34:38,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131498324] [2019-11-19 22:34:38,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:34:38,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:34:38,315 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:34:38,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:34:38,315 INFO L87 Difference]: Start difference. First operand 42470 states and 111601 transitions. Second operand 7 states. [2019-11-19 22:34:38,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:38,756 INFO L93 Difference]: Finished difference Result 51836 states and 136019 transitions. [2019-11-19 22:34:38,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:34:38,757 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-11-19 22:34:38,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:38,826 INFO L225 Difference]: With dead ends: 51836 [2019-11-19 22:34:38,826 INFO L226 Difference]: Without dead ends: 51836 [2019-11-19 22:34:38,826 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:34:39,003 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51836 states. [2019-11-19 22:34:39,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51836 to 43946. [2019-11-19 22:34:39,472 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43946 states. [2019-11-19 22:34:39,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43946 states to 43946 states and 115519 transitions. [2019-11-19 22:34:39,547 INFO L78 Accepts]: Start accepts. Automaton has 43946 states and 115519 transitions. Word has length 86 [2019-11-19 22:34:39,547 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:39,547 INFO L462 AbstractCegarLoop]: Abstraction has 43946 states and 115519 transitions. [2019-11-19 22:34:39,547 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:34:39,547 INFO L276 IsEmpty]: Start isEmpty. Operand 43946 states and 115519 transitions. [2019-11-19 22:34:39,570 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-19 22:34:39,570 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:39,571 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:34:39,572 INFO L410 AbstractCegarLoop]: === Iteration 13 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:34:39,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:39,573 INFO L82 PathProgramCache]: Analyzing trace with hash 1217965840, now seen corresponding path program 1 times [2019-11-19 22:34:39,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:34:39,574 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497815284] [2019-11-19 22:34:39,574 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:34:39,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:39,672 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-19 22:34:39,673 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497815284] [2019-11-19 22:34:39,673 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:34:39,673 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 22:34:39,674 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378592106] [2019-11-19 22:34:39,674 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:34:39,674 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:34:39,675 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:34:39,675 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:34:39,675 INFO L87 Difference]: Start difference. First operand 43946 states and 115519 transitions. Second operand 7 states. [2019-11-19 22:34:40,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:40,044 INFO L93 Difference]: Finished difference Result 53789 states and 140557 transitions. [2019-11-19 22:34:40,045 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:34:40,045 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-11-19 22:34:40,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:40,116 INFO L225 Difference]: With dead ends: 53789 [2019-11-19 22:34:40,116 INFO L226 Difference]: Without dead ends: 53789 [2019-11-19 22:34:40,117 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:34:40,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53789 states. [2019-11-19 22:34:40,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53789 to 43715. [2019-11-19 22:34:40,769 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43715 states. [2019-11-19 22:34:40,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43715 states to 43715 states and 114870 transitions. [2019-11-19 22:34:40,850 INFO L78 Accepts]: Start accepts. Automaton has 43715 states and 114870 transitions. Word has length 86 [2019-11-19 22:34:40,850 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:40,850 INFO L462 AbstractCegarLoop]: Abstraction has 43715 states and 114870 transitions. [2019-11-19 22:34:40,850 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:34:40,850 INFO L276 IsEmpty]: Start isEmpty. Operand 43715 states and 114870 transitions. [2019-11-19 22:34:40,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-19 22:34:40,872 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:40,873 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:34:40,873 INFO L410 AbstractCegarLoop]: === Iteration 14 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:34:40,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:40,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1604463535, now seen corresponding path program 1 times [2019-11-19 22:34:40,873 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:34:40,874 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212071167] [2019-11-19 22:34:40,874 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:34:40,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:40,987 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-19 22:34:40,988 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212071167] [2019-11-19 22:34:40,988 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:34:40,988 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 22:34:40,988 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308888741] [2019-11-19 22:34:40,989 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:34:40,989 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:34:40,989 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:34:40,989 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:34:40,989 INFO L87 Difference]: Start difference. First operand 43715 states and 114870 transitions. Second operand 7 states. [2019-11-19 22:34:41,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:41,365 INFO L93 Difference]: Finished difference Result 53144 states and 138948 transitions. [2019-11-19 22:34:41,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:34:41,366 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-11-19 22:34:41,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:41,445 INFO L225 Difference]: With dead ends: 53144 [2019-11-19 22:34:41,445 INFO L226 Difference]: Without dead ends: 53144 [2019-11-19 22:34:41,446 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:34:41,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53144 states. [2019-11-19 22:34:42,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53144 to 43475. [2019-11-19 22:34:42,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43475 states. [2019-11-19 22:34:42,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43475 states to 43475 states and 114200 transitions. [2019-11-19 22:34:42,772 INFO L78 Accepts]: Start accepts. Automaton has 43475 states and 114200 transitions. Word has length 86 [2019-11-19 22:34:42,773 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:42,773 INFO L462 AbstractCegarLoop]: Abstraction has 43475 states and 114200 transitions. [2019-11-19 22:34:42,773 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:34:42,773 INFO L276 IsEmpty]: Start isEmpty. Operand 43475 states and 114200 transitions. [2019-11-19 22:34:42,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-19 22:34:42,795 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:42,795 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:34:42,795 INFO L410 AbstractCegarLoop]: === Iteration 15 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:34:42,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:42,795 INFO L82 PathProgramCache]: Analyzing trace with hash 947709825, now seen corresponding path program 1 times [2019-11-19 22:34:42,796 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:34:42,796 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1165447853] [2019-11-19 22:34:42,796 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:34:42,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:42,910 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-19 22:34:42,911 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1165447853] [2019-11-19 22:34:42,911 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:34:42,911 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 22:34:42,911 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1529889938] [2019-11-19 22:34:42,912 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:34:42,912 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:34:42,912 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:34:42,912 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:34:42,913 INFO L87 Difference]: Start difference. First operand 43475 states and 114200 transitions. Second operand 7 states. [2019-11-19 22:34:43,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:43,337 INFO L93 Difference]: Finished difference Result 52499 states and 137339 transitions. [2019-11-19 22:34:43,338 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:34:43,338 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-11-19 22:34:43,338 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:43,408 INFO L225 Difference]: With dead ends: 52499 [2019-11-19 22:34:43,408 INFO L226 Difference]: Without dead ends: 52499 [2019-11-19 22:34:43,408 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:34:43,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52499 states. [2019-11-19 22:34:44,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52499 to 43226. [2019-11-19 22:34:44,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43226 states. [2019-11-19 22:34:44,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43226 states to 43226 states and 113509 transitions. [2019-11-19 22:34:44,123 INFO L78 Accepts]: Start accepts. Automaton has 43226 states and 113509 transitions. Word has length 86 [2019-11-19 22:34:44,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:44,123 INFO L462 AbstractCegarLoop]: Abstraction has 43226 states and 113509 transitions. [2019-11-19 22:34:44,123 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:34:44,123 INFO L276 IsEmpty]: Start isEmpty. Operand 43226 states and 113509 transitions. [2019-11-19 22:34:44,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-19 22:34:44,145 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:44,145 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:34:44,146 INFO L410 AbstractCegarLoop]: === Iteration 16 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:34:44,146 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:44,146 INFO L82 PathProgramCache]: Analyzing trace with hash 741052160, now seen corresponding path program 1 times [2019-11-19 22:34:44,146 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:34:44,147 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899229478] [2019-11-19 22:34:44,147 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:34:44,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:44,245 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-19 22:34:44,245 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899229478] [2019-11-19 22:34:44,245 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:34:44,245 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 22:34:44,246 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1238328308] [2019-11-19 22:34:44,246 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:34:44,247 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:34:44,247 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:34:44,247 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:34:44,247 INFO L87 Difference]: Start difference. First operand 43226 states and 113509 transitions. Second operand 7 states. [2019-11-19 22:34:44,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:44,655 INFO L93 Difference]: Finished difference Result 54023 states and 140995 transitions. [2019-11-19 22:34:44,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:34:44,655 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-11-19 22:34:44,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:44,728 INFO L225 Difference]: With dead ends: 54023 [2019-11-19 22:34:44,728 INFO L226 Difference]: Without dead ends: 54023 [2019-11-19 22:34:44,729 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:34:44,912 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54023 states. [2019-11-19 22:34:45,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54023 to 42995. [2019-11-19 22:34:45,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42995 states. [2019-11-19 22:34:45,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42995 states to 42995 states and 112860 transitions. [2019-11-19 22:34:45,445 INFO L78 Accepts]: Start accepts. Automaton has 42995 states and 112860 transitions. Word has length 86 [2019-11-19 22:34:45,446 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:45,446 INFO L462 AbstractCegarLoop]: Abstraction has 42995 states and 112860 transitions. [2019-11-19 22:34:45,446 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:34:45,446 INFO L276 IsEmpty]: Start isEmpty. Operand 42995 states and 112860 transitions. [2019-11-19 22:34:45,467 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-19 22:34:45,467 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:45,468 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:34:45,468 INFO L410 AbstractCegarLoop]: === Iteration 17 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:34:45,468 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:45,468 INFO L82 PathProgramCache]: Analyzing trace with hash 1266327583, now seen corresponding path program 1 times [2019-11-19 22:34:45,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:34:45,469 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1972069997] [2019-11-19 22:34:45,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:34:45,480 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:45,555 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-19 22:34:45,556 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1972069997] [2019-11-19 22:34:45,556 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:34:45,556 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 22:34:45,556 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994517603] [2019-11-19 22:34:45,557 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:34:45,557 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:34:45,557 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:34:45,557 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:34:45,558 INFO L87 Difference]: Start difference. First operand 42995 states and 112860 transitions. Second operand 7 states. [2019-11-19 22:34:46,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:46,045 INFO L93 Difference]: Finished difference Result 53378 states and 139386 transitions. [2019-11-19 22:34:46,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:34:46,046 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-11-19 22:34:46,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:46,121 INFO L225 Difference]: With dead ends: 53378 [2019-11-19 22:34:46,121 INFO L226 Difference]: Without dead ends: 53378 [2019-11-19 22:34:46,121 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:34:46,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53378 states. [2019-11-19 22:34:46,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53378 to 42755. [2019-11-19 22:34:46,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42755 states. [2019-11-19 22:34:46,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42755 states to 42755 states and 112190 transitions. [2019-11-19 22:34:46,816 INFO L78 Accepts]: Start accepts. Automaton has 42755 states and 112190 transitions. Word has length 86 [2019-11-19 22:34:46,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:46,816 INFO L462 AbstractCegarLoop]: Abstraction has 42755 states and 112190 transitions. [2019-11-19 22:34:46,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:34:46,816 INFO L276 IsEmpty]: Start isEmpty. Operand 42755 states and 112190 transitions. [2019-11-19 22:34:46,838 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 87 [2019-11-19 22:34:46,838 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:46,838 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:34:46,838 INFO L410 AbstractCegarLoop]: === Iteration 18 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:34:46,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:46,838 INFO L82 PathProgramCache]: Analyzing trace with hash -6461815, now seen corresponding path program 1 times [2019-11-19 22:34:46,839 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:34:46,839 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328994056] [2019-11-19 22:34:46,839 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:34:46,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:46,916 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-19 22:34:46,916 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328994056] [2019-11-19 22:34:46,916 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:34:46,917 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-11-19 22:34:46,917 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [801551914] [2019-11-19 22:34:46,917 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-11-19 22:34:46,918 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:34:46,918 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-11-19 22:34:46,918 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-11-19 22:34:46,918 INFO L87 Difference]: Start difference. First operand 42755 states and 112190 transitions. Second operand 7 states. [2019-11-19 22:34:47,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:47,347 INFO L93 Difference]: Finished difference Result 52733 states and 137777 transitions. [2019-11-19 22:34:47,347 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:34:47,347 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 86 [2019-11-19 22:34:47,347 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:47,417 INFO L225 Difference]: With dead ends: 52733 [2019-11-19 22:34:47,417 INFO L226 Difference]: Without dead ends: 52733 [2019-11-19 22:34:47,418 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:34:47,594 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52733 states. [2019-11-19 22:34:48,033 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52733 to 42506. [2019-11-19 22:34:48,033 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42506 states. [2019-11-19 22:34:48,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42506 states to 42506 states and 111499 transitions. [2019-11-19 22:34:48,102 INFO L78 Accepts]: Start accepts. Automaton has 42506 states and 111499 transitions. Word has length 86 [2019-11-19 22:34:48,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:48,102 INFO L462 AbstractCegarLoop]: Abstraction has 42506 states and 111499 transitions. [2019-11-19 22:34:48,103 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-11-19 22:34:48,103 INFO L276 IsEmpty]: Start isEmpty. Operand 42506 states and 111499 transitions. [2019-11-19 22:34:48,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-19 22:34:48,133 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:48,133 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:34:48,133 INFO L410 AbstractCegarLoop]: === Iteration 19 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:34:48,133 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:48,134 INFO L82 PathProgramCache]: Analyzing trace with hash -592854159, now seen corresponding path program 1 times [2019-11-19 22:34:48,134 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:34:48,134 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1463822997] [2019-11-19 22:34:48,134 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:34:48,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:49,189 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-19 22:34:49,190 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1463822997] [2019-11-19 22:34:49,191 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:34:49,191 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-11-19 22:34:49,191 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [552001390] [2019-11-19 22:34:49,192 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-19 22:34:49,193 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:34:49,193 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-19 22:34:49,194 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-11-19 22:34:49,194 INFO L87 Difference]: Start difference. First operand 42506 states and 111499 transitions. Second operand 22 states. [2019-11-19 22:34:53,149 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-19 22:34:53,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:53,560 INFO L93 Difference]: Finished difference Result 51725 states and 134776 transitions. [2019-11-19 22:34:53,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-19 22:34:53,561 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 96 [2019-11-19 22:34:53,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:53,628 INFO L225 Difference]: With dead ends: 51725 [2019-11-19 22:34:53,629 INFO L226 Difference]: Without dead ends: 51725 [2019-11-19 22:34:53,630 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=442, Invalid=2314, Unknown=0, NotChecked=0, Total=2756 [2019-11-19 22:34:53,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51725 states. [2019-11-19 22:34:54,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51725 to 44771. [2019-11-19 22:34:54,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44771 states. [2019-11-19 22:34:54,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44771 states to 44771 states and 117419 transitions. [2019-11-19 22:34:54,328 INFO L78 Accepts]: Start accepts. Automaton has 44771 states and 117419 transitions. Word has length 96 [2019-11-19 22:34:54,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:54,328 INFO L462 AbstractCegarLoop]: Abstraction has 44771 states and 117419 transitions. [2019-11-19 22:34:54,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-19 22:34:54,329 INFO L276 IsEmpty]: Start isEmpty. Operand 44771 states and 117419 transitions. [2019-11-19 22:34:54,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-19 22:34:54,357 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:54,357 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:34:54,358 INFO L410 AbstractCegarLoop]: === Iteration 20 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:34:54,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:54,358 INFO L82 PathProgramCache]: Analyzing trace with hash -571138702, now seen corresponding path program 1 times [2019-11-19 22:34:54,358 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:34:54,358 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [534628080] [2019-11-19 22:34:54,358 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:34:54,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:34:54,953 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-19 22:34:54,953 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [534628080] [2019-11-19 22:34:54,953 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:34:54,953 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-11-19 22:34:54,954 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1820293199] [2019-11-19 22:34:54,954 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-19 22:34:54,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:34:54,955 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-19 22:34:54,955 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-11-19 22:34:54,955 INFO L87 Difference]: Start difference. First operand 44771 states and 117419 transitions. Second operand 22 states. [2019-11-19 22:34:58,015 WARN L191 SmtUtils]: Spent 105.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-19 22:34:58,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:34:58,682 INFO L93 Difference]: Finished difference Result 54284 states and 141351 transitions. [2019-11-19 22:34:58,683 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-19 22:34:58,683 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 96 [2019-11-19 22:34:58,683 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:34:58,754 INFO L225 Difference]: With dead ends: 54284 [2019-11-19 22:34:58,754 INFO L226 Difference]: Without dead ends: 54284 [2019-11-19 22:34:58,755 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=442, Invalid=2314, Unknown=0, NotChecked=0, Total=2756 [2019-11-19 22:34:58,937 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 54284 states. [2019-11-19 22:34:59,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 54284 to 47018. [2019-11-19 22:34:59,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47018 states. [2019-11-19 22:34:59,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47018 states to 47018 states and 123303 transitions. [2019-11-19 22:34:59,517 INFO L78 Accepts]: Start accepts. Automaton has 47018 states and 123303 transitions. Word has length 96 [2019-11-19 22:34:59,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:34:59,518 INFO L462 AbstractCegarLoop]: Abstraction has 47018 states and 123303 transitions. [2019-11-19 22:34:59,518 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-19 22:34:59,518 INFO L276 IsEmpty]: Start isEmpty. Operand 47018 states and 123303 transitions. [2019-11-19 22:34:59,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-19 22:34:59,562 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:34:59,562 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:34:59,562 INFO L410 AbstractCegarLoop]: === Iteration 21 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:34:59,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:34:59,563 INFO L82 PathProgramCache]: Analyzing trace with hash 867641336, now seen corresponding path program 1 times [2019-11-19 22:34:59,563 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:34:59,563 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877324374] [2019-11-19 22:34:59,563 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:34:59,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:35:00,588 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-19 22:35:00,588 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877324374] [2019-11-19 22:35:00,589 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:35:00,589 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-11-19 22:35:00,589 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196047178] [2019-11-19 22:35:00,589 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-19 22:35:00,590 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:35:00,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-19 22:35:00,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-11-19 22:35:00,591 INFO L87 Difference]: Start difference. First operand 47018 states and 123303 transitions. Second operand 22 states. [2019-11-19 22:35:03,921 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 51 DAG size of output: 49 [2019-11-19 22:35:04,264 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-19 22:35:04,519 WARN L191 SmtUtils]: Spent 121.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-19 22:35:05,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:35:05,029 INFO L93 Difference]: Finished difference Result 56702 states and 147691 transitions. [2019-11-19 22:35:05,029 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-19 22:35:05,029 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 96 [2019-11-19 22:35:05,030 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:35:05,105 INFO L225 Difference]: With dead ends: 56702 [2019-11-19 22:35:05,105 INFO L226 Difference]: Without dead ends: 56702 [2019-11-19 22:35:05,106 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=442, Invalid=2314, Unknown=0, NotChecked=0, Total=2756 [2019-11-19 22:35:05,314 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56702 states. [2019-11-19 22:35:06,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56702 to 49265. [2019-11-19 22:35:06,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49265 states. [2019-11-19 22:35:06,530 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49265 states to 49265 states and 129187 transitions. [2019-11-19 22:35:06,531 INFO L78 Accepts]: Start accepts. Automaton has 49265 states and 129187 transitions. Word has length 96 [2019-11-19 22:35:06,531 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:35:06,531 INFO L462 AbstractCegarLoop]: Abstraction has 49265 states and 129187 transitions. [2019-11-19 22:35:06,531 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-19 22:35:06,531 INFO L276 IsEmpty]: Start isEmpty. Operand 49265 states and 129187 transitions. [2019-11-19 22:35:06,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-19 22:35:06,562 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:35:06,562 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:35:06,562 INFO L410 AbstractCegarLoop]: === Iteration 22 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:35:06,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:35:06,563 INFO L82 PathProgramCache]: Analyzing trace with hash 446293288, now seen corresponding path program 1 times [2019-11-19 22:35:06,564 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:35:06,564 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1037772973] [2019-11-19 22:35:06,564 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:35:06,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:35:07,413 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-19 22:35:07,413 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1037772973] [2019-11-19 22:35:07,413 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:35:07,414 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-11-19 22:35:07,414 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307980579] [2019-11-19 22:35:07,415 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-19 22:35:07,417 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:35:07,417 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-19 22:35:07,418 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-11-19 22:35:07,418 INFO L87 Difference]: Start difference. First operand 49265 states and 129187 transitions. Second operand 22 states. [2019-11-19 22:35:10,896 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-11-19 22:35:11,049 WARN L191 SmtUtils]: Spent 115.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-19 22:35:11,285 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-19 22:35:11,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:35:11,854 INFO L93 Difference]: Finished difference Result 59114 states and 153955 transitions. [2019-11-19 22:35:11,855 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-19 22:35:11,855 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 96 [2019-11-19 22:35:11,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:35:11,932 INFO L225 Difference]: With dead ends: 59114 [2019-11-19 22:35:11,932 INFO L226 Difference]: Without dead ends: 59114 [2019-11-19 22:35:11,933 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=442, Invalid=2314, Unknown=0, NotChecked=0, Total=2756 [2019-11-19 22:35:12,134 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59114 states. [2019-11-19 22:35:12,700 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59114 to 51350. [2019-11-19 22:35:12,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51350 states. [2019-11-19 22:35:12,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51350 states to 51350 states and 134795 transitions. [2019-11-19 22:35:12,791 INFO L78 Accepts]: Start accepts. Automaton has 51350 states and 134795 transitions. Word has length 96 [2019-11-19 22:35:12,792 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:35:12,792 INFO L462 AbstractCegarLoop]: Abstraction has 51350 states and 134795 transitions. [2019-11-19 22:35:12,792 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-19 22:35:12,792 INFO L276 IsEmpty]: Start isEmpty. Operand 51350 states and 134795 transitions. [2019-11-19 22:35:12,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-19 22:35:12,822 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:35:12,823 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:35:12,823 INFO L410 AbstractCegarLoop]: === Iteration 23 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:35:12,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:35:12,823 INFO L82 PathProgramCache]: Analyzing trace with hash 1479600071, now seen corresponding path program 1 times [2019-11-19 22:35:12,823 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:35:12,823 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [701937536] [2019-11-19 22:35:12,823 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:35:12,876 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:35:13,698 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-19 22:35:13,699 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [701937536] [2019-11-19 22:35:13,699 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:35:13,699 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-11-19 22:35:13,699 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597885815] [2019-11-19 22:35:13,700 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-19 22:35:13,700 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:35:13,700 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-19 22:35:13,701 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-11-19 22:35:13,701 INFO L87 Difference]: Start difference. First operand 51350 states and 134795 transitions. Second operand 22 states. [2019-11-19 22:35:15,822 WARN L191 SmtUtils]: Spent 109.00 ms on a formula simplification. DAG size of input: 43 DAG size of output: 39 [2019-11-19 22:35:17,141 WARN L191 SmtUtils]: Spent 106.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-11-19 22:35:17,292 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-19 22:35:17,580 WARN L191 SmtUtils]: Spent 112.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-19 22:35:18,055 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:35:18,055 INFO L93 Difference]: Finished difference Result 61553 states and 160321 transitions. [2019-11-19 22:35:18,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-19 22:35:18,056 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 96 [2019-11-19 22:35:18,056 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:35:18,138 INFO L225 Difference]: With dead ends: 61553 [2019-11-19 22:35:18,138 INFO L226 Difference]: Without dead ends: 61553 [2019-11-19 22:35:18,139 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=442, Invalid=2314, Unknown=0, NotChecked=0, Total=2756 [2019-11-19 22:35:18,351 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61553 states. [2019-11-19 22:35:18,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61553 to 53417. [2019-11-19 22:35:18,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53417 states. [2019-11-19 22:35:19,045 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53417 states to 53417 states and 140367 transitions. [2019-11-19 22:35:19,045 INFO L78 Accepts]: Start accepts. Automaton has 53417 states and 140367 transitions. Word has length 96 [2019-11-19 22:35:19,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:35:19,045 INFO L462 AbstractCegarLoop]: Abstraction has 53417 states and 140367 transitions. [2019-11-19 22:35:19,045 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-19 22:35:19,045 INFO L276 IsEmpty]: Start isEmpty. Operand 53417 states and 140367 transitions. [2019-11-19 22:35:19,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-19 22:35:19,077 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:35:19,077 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:35:19,077 INFO L410 AbstractCegarLoop]: === Iteration 24 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:35:19,077 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:35:19,077 INFO L82 PathProgramCache]: Analyzing trace with hash -135920167, now seen corresponding path program 1 times [2019-11-19 22:35:19,077 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:35:19,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678867341] [2019-11-19 22:35:19,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:35:19,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:35:19,887 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-19 22:35:19,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678867341] [2019-11-19 22:35:19,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:35:19,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [22] imperfect sequences [] total 22 [2019-11-19 22:35:19,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2101470509] [2019-11-19 22:35:19,888 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-11-19 22:35:19,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:35:19,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-11-19 22:35:19,889 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=403, Unknown=0, NotChecked=0, Total=462 [2019-11-19 22:35:19,889 INFO L87 Difference]: Start difference. First operand 53417 states and 140367 transitions. Second operand 22 states. [2019-11-19 22:35:22,700 WARN L191 SmtUtils]: Spent 113.00 ms on a formula simplification. DAG size of input: 44 DAG size of output: 42 [2019-11-19 22:35:23,131 WARN L191 SmtUtils]: Spent 343.00 ms on a formula simplification. DAG size of input: 48 DAG size of output: 46 [2019-11-19 22:35:23,465 WARN L191 SmtUtils]: Spent 116.00 ms on a formula simplification. DAG size of input: 53 DAG size of output: 51 [2019-11-19 22:35:23,611 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-19 22:35:23,852 WARN L191 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 55 DAG size of output: 53 [2019-11-19 22:35:24,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:35:24,388 INFO L93 Difference]: Finished difference Result 63851 states and 166452 transitions. [2019-11-19 22:35:24,388 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-11-19 22:35:24,388 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 96 [2019-11-19 22:35:24,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:35:24,468 INFO L225 Difference]: With dead ends: 63851 [2019-11-19 22:35:24,468 INFO L226 Difference]: Without dead ends: 63851 [2019-11-19 22:35:24,470 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=442, Invalid=2314, Unknown=0, NotChecked=0, Total=2756 [2019-11-19 22:35:24,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63851 states. [2019-11-19 22:35:25,286 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63851 to 55484. [2019-11-19 22:35:25,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55484 states. [2019-11-19 22:35:25,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55484 states to 55484 states and 145939 transitions. [2019-11-19 22:35:25,386 INFO L78 Accepts]: Start accepts. Automaton has 55484 states and 145939 transitions. Word has length 96 [2019-11-19 22:35:25,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:35:25,386 INFO L462 AbstractCegarLoop]: Abstraction has 55484 states and 145939 transitions. [2019-11-19 22:35:25,386 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-11-19 22:35:25,387 INFO L276 IsEmpty]: Start isEmpty. Operand 55484 states and 145939 transitions. [2019-11-19 22:35:25,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-19 22:35:25,417 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:35:25,418 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:35:25,418 INFO L410 AbstractCegarLoop]: === Iteration 25 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:35:25,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:35:25,418 INFO L82 PathProgramCache]: Analyzing trace with hash -37119720, now seen corresponding path program 1 times [2019-11-19 22:35:25,419 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:35:25,419 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804730432] [2019-11-19 22:35:25,419 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:35:25,445 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:35:26,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-19 22:35:26,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804730432] [2019-11-19 22:35:26,677 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:35:26,677 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-11-19 22:35:26,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1300391904] [2019-11-19 22:35:26,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-19 22:35:26,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:35:26,678 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-19 22:35:26,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2019-11-19 22:35:26,679 INFO L87 Difference]: Start difference. First operand 55484 states and 145939 transitions. Second operand 27 states. [2019-11-19 22:35:27,756 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 50 DAG size of output: 38 [2019-11-19 22:35:28,307 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-11-19 22:35:28,649 WARN L191 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-11-19 22:35:31,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:35:31,083 INFO L93 Difference]: Finished difference Result 62948 states and 164560 transitions. [2019-11-19 22:35:31,083 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-19 22:35:31,083 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 96 [2019-11-19 22:35:31,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:35:31,166 INFO L225 Difference]: With dead ends: 62948 [2019-11-19 22:35:31,166 INFO L226 Difference]: Without dead ends: 62948 [2019-11-19 22:35:31,167 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 2.9s TimeCoverageRelationStatistics Valid=378, Invalid=2378, Unknown=0, NotChecked=0, Total=2756 [2019-11-19 22:35:31,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62948 states. [2019-11-19 22:35:32,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62948 to 56552. [2019-11-19 22:35:32,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56552 states. [2019-11-19 22:35:32,108 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56552 states to 56552 states and 148796 transitions. [2019-11-19 22:35:32,108 INFO L78 Accepts]: Start accepts. Automaton has 56552 states and 148796 transitions. Word has length 96 [2019-11-19 22:35:32,108 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:35:32,108 INFO L462 AbstractCegarLoop]: Abstraction has 56552 states and 148796 transitions. [2019-11-19 22:35:32,108 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-19 22:35:32,109 INFO L276 IsEmpty]: Start isEmpty. Operand 56552 states and 148796 transitions. [2019-11-19 22:35:32,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-19 22:35:32,139 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:35:32,139 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:35:32,139 INFO L410 AbstractCegarLoop]: === Iteration 26 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:35:32,140 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:35:32,140 INFO L82 PathProgramCache]: Analyzing trace with hash 454463543, now seen corresponding path program 1 times [2019-11-19 22:35:32,140 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:35:32,140 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048598206] [2019-11-19 22:35:32,140 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:35:32,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:35:33,151 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-19 22:35:33,152 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048598206] [2019-11-19 22:35:33,152 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:35:33,152 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [27] imperfect sequences [] total 27 [2019-11-19 22:35:33,152 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [86447539] [2019-11-19 22:35:33,153 INFO L442 AbstractCegarLoop]: Interpolant automaton has 27 states [2019-11-19 22:35:33,153 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:35:33,153 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2019-11-19 22:35:33,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=625, Unknown=0, NotChecked=0, Total=702 [2019-11-19 22:35:33,154 INFO L87 Difference]: Start difference. First operand 56552 states and 148796 transitions. Second operand 27 states. [2019-11-19 22:35:34,619 WARN L191 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-11-19 22:35:34,965 WARN L191 SmtUtils]: Spent 103.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 51 [2019-11-19 22:35:36,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:35:36,961 INFO L93 Difference]: Finished difference Result 63926 states and 167144 transitions. [2019-11-19 22:35:36,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2019-11-19 22:35:36,962 INFO L78 Accepts]: Start accepts. Automaton has 27 states. Word has length 96 [2019-11-19 22:35:36,962 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:35:37,048 INFO L225 Difference]: With dead ends: 63926 [2019-11-19 22:35:37,048 INFO L226 Difference]: Without dead ends: 63926 [2019-11-19 22:35:37,049 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 650 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=378, Invalid=2378, Unknown=0, NotChecked=0, Total=2756 [2019-11-19 22:35:37,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63926 states. [2019-11-19 22:35:38,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63926 to 57611. [2019-11-19 22:35:38,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 57611 states. [2019-11-19 22:35:38,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57611 states to 57611 states and 151632 transitions. [2019-11-19 22:35:38,288 INFO L78 Accepts]: Start accepts. Automaton has 57611 states and 151632 transitions. Word has length 96 [2019-11-19 22:35:38,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:35:38,289 INFO L462 AbstractCegarLoop]: Abstraction has 57611 states and 151632 transitions. [2019-11-19 22:35:38,289 INFO L463 AbstractCegarLoop]: Interpolant automaton has 27 states. [2019-11-19 22:35:38,289 INFO L276 IsEmpty]: Start isEmpty. Operand 57611 states and 151632 transitions. [2019-11-19 22:35:38,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 97 [2019-11-19 22:35:38,319 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:35:38,320 INFO L410 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:35:38,320 INFO L410 AbstractCegarLoop]: === Iteration 27 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:35:38,320 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:35:38,320 INFO L82 PathProgramCache]: Analyzing trace with hash 1926847201, now seen corresponding path program 1 times [2019-11-19 22:35:38,320 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:35:38,321 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [605152044] [2019-11-19 22:35:38,321 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:35:38,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:35:39,193 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-19 22:35:39,193 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [605152044] [2019-11-19 22:35:39,193 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-11-19 22:35:39,193 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [25] imperfect sequences [] total 25 [2019-11-19 22:35:39,194 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701833560] [2019-11-19 22:35:39,194 INFO L442 AbstractCegarLoop]: Interpolant automaton has 25 states [2019-11-19 22:35:39,194 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:35:39,194 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2019-11-19 22:35:39,195 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=69, Invalid=531, Unknown=0, NotChecked=0, Total=600 [2019-11-19 22:35:39,195 INFO L87 Difference]: Start difference. First operand 57611 states and 151632 transitions. Second operand 25 states. [2019-11-19 22:35:42,793 WARN L191 SmtUtils]: Spent 110.00 ms on a formula simplification. DAG size of input: 61 DAG size of output: 57 [2019-11-19 22:35:42,987 WARN L191 SmtUtils]: Spent 117.00 ms on a formula simplification. DAG size of input: 63 DAG size of output: 59 [2019-11-19 22:35:43,146 WARN L191 SmtUtils]: Spent 123.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-11-19 22:35:43,417 WARN L191 SmtUtils]: Spent 124.00 ms on a formula simplification. DAG size of input: 65 DAG size of output: 62 [2019-11-19 22:35:44,508 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:35:44,509 INFO L93 Difference]: Finished difference Result 67874 states and 177291 transitions. [2019-11-19 22:35:44,509 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2019-11-19 22:35:44,509 INFO L78 Accepts]: Start accepts. Automaton has 25 states. Word has length 96 [2019-11-19 22:35:44,509 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:35:44,600 INFO L225 Difference]: With dead ends: 67874 [2019-11-19 22:35:44,600 INFO L226 Difference]: Without dead ends: 67874 [2019-11-19 22:35:44,602 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 5 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1008 ImplicationChecksByTransitivity, 3.8s TimeCoverageRelationStatistics Valid=620, Invalid=3670, Unknown=0, NotChecked=0, Total=4290 [2019-11-19 22:35:44,824 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67874 states. [2019-11-19 22:35:45,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67874 to 59687. [2019-11-19 22:35:45,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59687 states. [2019-11-19 22:35:45,597 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59687 states to 59687 states and 157219 transitions. [2019-11-19 22:35:45,597 INFO L78 Accepts]: Start accepts. Automaton has 59687 states and 157219 transitions. Word has length 96 [2019-11-19 22:35:45,598 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:35:45,598 INFO L462 AbstractCegarLoop]: Abstraction has 59687 states and 157219 transitions. [2019-11-19 22:35:45,598 INFO L463 AbstractCegarLoop]: Interpolant automaton has 25 states. [2019-11-19 22:35:45,598 INFO L276 IsEmpty]: Start isEmpty. Operand 59687 states and 157219 transitions. [2019-11-19 22:35:45,639 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-19 22:35:45,639 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:35:45,639 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:35:45,639 INFO L410 AbstractCegarLoop]: === Iteration 28 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:35:45,640 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:35:45,640 INFO L82 PathProgramCache]: Analyzing trace with hash -444820452, now seen corresponding path program 2 times [2019-11-19 22:35:45,640 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:35:45,640 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394668323] [2019-11-19 22:35:45,640 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:35:45,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:35:45,741 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:35:45,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394668323] [2019-11-19 22:35:45,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [292767642] [2019-11-19 22:35:45,742 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/bin/uautomizer/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:35:45,876 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:35:45,876 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:35:45,878 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:35:45,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:35:45,941 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:35:45,941 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:35:45,942 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-11-19 22:35:45,942 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [89794328] [2019-11-19 22:35:45,943 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:35:45,943 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:35:45,943 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:35:45,943 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:35:45,944 INFO L87 Difference]: Start difference. First operand 59687 states and 157219 transitions. Second operand 9 states. [2019-11-19 22:35:46,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:35:46,286 INFO L93 Difference]: Finished difference Result 69551 states and 182002 transitions. [2019-11-19 22:35:46,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:35:46,287 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2019-11-19 22:35:46,287 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:35:46,377 INFO L225 Difference]: With dead ends: 69551 [2019-11-19 22:35:46,377 INFO L226 Difference]: Without dead ends: 69551 [2019-11-19 22:35:46,378 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:35:46,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69551 states. [2019-11-19 22:35:47,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69551 to 63812. [2019-11-19 22:35:47,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63812 states. [2019-11-19 22:35:47,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63812 states to 63812 states and 168213 transitions. [2019-11-19 22:35:47,398 INFO L78 Accepts]: Start accepts. Automaton has 63812 states and 168213 transitions. Word has length 113 [2019-11-19 22:35:47,398 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:35:47,398 INFO L462 AbstractCegarLoop]: Abstraction has 63812 states and 168213 transitions. [2019-11-19 22:35:47,399 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:35:47,399 INFO L276 IsEmpty]: Start isEmpty. Operand 63812 states and 168213 transitions. [2019-11-19 22:35:47,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-19 22:35:47,440 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:35:47,440 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:35:47,640 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:35:47,641 INFO L410 AbstractCegarLoop]: === Iteration 29 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:35:47,641 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:35:47,641 INFO L82 PathProgramCache]: Analyzing trace with hash -815469603, now seen corresponding path program 2 times [2019-11-19 22:35:47,641 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:35:47,641 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [659332638] [2019-11-19 22:35:47,641 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:35:47,652 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:35:47,744 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:35:47,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [659332638] [2019-11-19 22:35:47,744 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2052579074] [2019-11-19 22:35:47,744 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/bin/uautomizer/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:35:47,857 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:35:47,857 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:35:47,858 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:35:47,865 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:35:47,912 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:35:47,912 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:35:47,912 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-11-19 22:35:47,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1888612248] [2019-11-19 22:35:47,913 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:35:47,913 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:35:47,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:35:47,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:35:47,914 INFO L87 Difference]: Start difference. First operand 63812 states and 168213 transitions. Second operand 9 states. [2019-11-19 22:35:48,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:35:48,427 INFO L93 Difference]: Finished difference Result 73046 states and 191505 transitions. [2019-11-19 22:35:48,428 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:35:48,428 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2019-11-19 22:35:48,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:35:48,558 INFO L225 Difference]: With dead ends: 73046 [2019-11-19 22:35:48,558 INFO L226 Difference]: Without dead ends: 73046 [2019-11-19 22:35:48,560 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:35:49,284 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73046 states. [2019-11-19 22:35:49,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73046 to 67937. [2019-11-19 22:35:49,996 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 67937 states. [2019-11-19 22:35:50,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67937 states to 67937 states and 179207 transitions. [2019-11-19 22:35:50,119 INFO L78 Accepts]: Start accepts. Automaton has 67937 states and 179207 transitions. Word has length 113 [2019-11-19 22:35:50,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:35:50,119 INFO L462 AbstractCegarLoop]: Abstraction has 67937 states and 179207 transitions. [2019-11-19 22:35:50,120 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:35:50,120 INFO L276 IsEmpty]: Start isEmpty. Operand 67937 states and 179207 transitions. [2019-11-19 22:35:50,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 114 [2019-11-19 22:35:50,167 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:35:50,167 INFO L410 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-11-19 22:35:50,367 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:35:50,368 INFO L410 AbstractCegarLoop]: === Iteration 30 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:35:50,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:35:50,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1845060171, now seen corresponding path program 2 times [2019-11-19 22:35:50,369 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:35:50,369 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1884059503] [2019-11-19 22:35:50,369 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:35:50,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:35:50,478 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:35:50,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1884059503] [2019-11-19 22:35:50,478 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [729885544] [2019-11-19 22:35:50,479 INFO L92 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/bin/uautomizer/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:35:50,607 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2019-11-19 22:35:50,607 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2019-11-19 22:35:50,609 INFO L255 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 6 conjunts are in the unsatisfiable core [2019-11-19 22:35:50,614 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:35:50,663 INFO L134 CoverageAnalysis]: Checked inductivity of 62 backedges. 6 proven. 56 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:35:50,665 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2019-11-19 22:35:50,665 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2019-11-19 22:35:50,665 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278016749] [2019-11-19 22:35:50,666 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:35:50,666 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:35:50,667 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:35:50,667 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-11-19 22:35:50,667 INFO L87 Difference]: Start difference. First operand 67937 states and 179207 transitions. Second operand 9 states. [2019-11-19 22:35:51,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:35:51,136 INFO L93 Difference]: Finished difference Result 76205 states and 200160 transitions. [2019-11-19 22:35:51,136 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-11-19 22:35:51,137 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 113 [2019-11-19 22:35:51,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:35:51,253 INFO L225 Difference]: With dead ends: 76205 [2019-11-19 22:35:51,253 INFO L226 Difference]: Without dead ends: 76205 [2019-11-19 22:35:51,253 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 123 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-11-19 22:35:51,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76205 states. [2019-11-19 22:35:52,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76205 to 71396. [2019-11-19 22:35:52,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71396 states. [2019-11-19 22:35:52,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71396 states to 71396 states and 188263 transitions. [2019-11-19 22:35:52,411 INFO L78 Accepts]: Start accepts. Automaton has 71396 states and 188263 transitions. Word has length 113 [2019-11-19 22:35:52,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:35:52,412 INFO L462 AbstractCegarLoop]: Abstraction has 71396 states and 188263 transitions. [2019-11-19 22:35:52,412 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:35:52,412 INFO L276 IsEmpty]: Start isEmpty. Operand 71396 states and 188263 transitions. [2019-11-19 22:35:52,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-19 22:35:52,458 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:35:52,458 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:35:52,659 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:35:52,659 INFO L410 AbstractCegarLoop]: === Iteration 31 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:35:52,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:35:52,660 INFO L82 PathProgramCache]: Analyzing trace with hash -1607285552, now seen corresponding path program 1 times [2019-11-19 22:35:52,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:35:52,660 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809344580] [2019-11-19 22:35:52,660 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:35:52,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:35:52,820 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:35:52,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809344580] [2019-11-19 22:35:52,820 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1362752599] [2019-11-19 22:35:52,821 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/bin/uautomizer/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:35:52,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:35:52,955 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:35:52,959 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:35:53,022 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:35:53,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:35:53,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 11 [2019-11-19 22:35:53,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [66934302] [2019-11-19 22:35:53,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:35:53,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:35:53,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:35:53,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:35:53,024 INFO L87 Difference]: Start difference. First operand 71396 states and 188263 transitions. Second operand 9 states. [2019-11-19 22:35:53,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:35:53,738 INFO L93 Difference]: Finished difference Result 83294 states and 218535 transitions. [2019-11-19 22:35:53,738 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 22:35:53,738 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-11-19 22:35:53,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:35:53,870 INFO L225 Difference]: With dead ends: 83294 [2019-11-19 22:35:53,871 INFO L226 Difference]: Without dead ends: 83294 [2019-11-19 22:35:53,871 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-11-19 22:35:54,135 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83294 states. [2019-11-19 22:35:54,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83294 to 71567. [2019-11-19 22:35:54,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71567 states. [2019-11-19 22:35:55,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71567 states to 71567 states and 188701 transitions. [2019-11-19 22:35:55,087 INFO L78 Accepts]: Start accepts. Automaton has 71567 states and 188701 transitions. Word has length 118 [2019-11-19 22:35:55,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:35:55,087 INFO L462 AbstractCegarLoop]: Abstraction has 71567 states and 188701 transitions. [2019-11-19 22:35:55,087 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:35:55,087 INFO L276 IsEmpty]: Start isEmpty. Operand 71567 states and 188701 transitions. [2019-11-19 22:35:55,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-19 22:35:55,135 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:35:55,135 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:35:55,337 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:35:55,338 INFO L410 AbstractCegarLoop]: === Iteration 32 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:35:55,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:35:55,338 INFO L82 PathProgramCache]: Analyzing trace with hash -2034907311, now seen corresponding path program 1 times [2019-11-19 22:35:55,338 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:35:55,339 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1620155553] [2019-11-19 22:35:55,339 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:35:55,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:35:55,459 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:35:55,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1620155553] [2019-11-19 22:35:55,460 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [432469625] [2019-11-19 22:35:55,460 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/bin/uautomizer/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:35:55,592 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:35:55,593 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:35:55,595 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:35:55,641 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:35:55,642 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:35:55,642 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 11 [2019-11-19 22:35:55,643 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476302411] [2019-11-19 22:35:55,643 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:35:55,643 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:35:55,644 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:35:55,644 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:35:55,644 INFO L87 Difference]: Start difference. First operand 71567 states and 188701 transitions. Second operand 9 states. [2019-11-19 22:35:56,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:35:56,137 INFO L93 Difference]: Finished difference Result 82172 states and 215570 transitions. [2019-11-19 22:35:56,137 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 22:35:56,137 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-11-19 22:35:56,137 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:35:56,245 INFO L225 Difference]: With dead ends: 82172 [2019-11-19 22:35:56,245 INFO L226 Difference]: Without dead ends: 82172 [2019-11-19 22:35:56,246 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-11-19 22:35:56,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82172 states. [2019-11-19 22:35:57,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82172 to 71738. [2019-11-19 22:35:57,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71738 states. [2019-11-19 22:35:57,838 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71738 states to 71738 states and 189139 transitions. [2019-11-19 22:35:57,839 INFO L78 Accepts]: Start accepts. Automaton has 71738 states and 189139 transitions. Word has length 118 [2019-11-19 22:35:57,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:35:57,839 INFO L462 AbstractCegarLoop]: Abstraction has 71738 states and 189139 transitions. [2019-11-19 22:35:57,839 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:35:57,840 INFO L276 IsEmpty]: Start isEmpty. Operand 71738 states and 189139 transitions. [2019-11-19 22:35:57,907 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-19 22:35:57,907 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:35:57,907 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:35:58,111 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:35:58,113 INFO L410 AbstractCegarLoop]: === Iteration 33 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:35:58,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:35:58,114 INFO L82 PathProgramCache]: Analyzing trace with hash -1596998007, now seen corresponding path program 1 times [2019-11-19 22:35:58,114 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:35:58,114 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1742272616] [2019-11-19 22:35:58,114 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:35:58,126 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:35:58,239 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:35:58,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1742272616] [2019-11-19 22:35:58,239 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1535659365] [2019-11-19 22:35:58,239 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/bin/uautomizer/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:35:58,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:35:58,372 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:35:58,374 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:35:58,423 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:35:58,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:35:58,424 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 11 [2019-11-19 22:35:58,424 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [33273368] [2019-11-19 22:35:58,425 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:35:58,425 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:35:58,428 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:35:58,428 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:35:58,428 INFO L87 Difference]: Start difference. First operand 71738 states and 189139 transitions. Second operand 9 states. [2019-11-19 22:35:59,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:35:59,157 INFO L93 Difference]: Finished difference Result 81050 states and 212605 transitions. [2019-11-19 22:35:59,157 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 22:35:59,157 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-11-19 22:35:59,158 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:35:59,276 INFO L225 Difference]: With dead ends: 81050 [2019-11-19 22:35:59,277 INFO L226 Difference]: Without dead ends: 81050 [2019-11-19 22:35:59,277 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-11-19 22:35:59,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81050 states. [2019-11-19 22:36:00,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81050 to 71876. [2019-11-19 22:36:00,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71876 states. [2019-11-19 22:36:00,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71876 states to 71876 states and 189489 transitions. [2019-11-19 22:36:00,471 INFO L78 Accepts]: Start accepts. Automaton has 71876 states and 189489 transitions. Word has length 118 [2019-11-19 22:36:00,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:36:00,471 INFO L462 AbstractCegarLoop]: Abstraction has 71876 states and 189489 transitions. [2019-11-19 22:36:00,471 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:36:00,472 INFO L276 IsEmpty]: Start isEmpty. Operand 71876 states and 189489 transitions. [2019-11-19 22:36:00,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-19 22:36:00,520 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:36:00,520 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:36:00,720 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:36:00,721 INFO L410 AbstractCegarLoop]: === Iteration 34 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:36:00,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:36:00,721 INFO L82 PathProgramCache]: Analyzing trace with hash 1055291207, now seen corresponding path program 1 times [2019-11-19 22:36:00,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:36:00,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [38800010] [2019-11-19 22:36:00,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:36:00,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:36:00,853 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:36:00,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [38800010] [2019-11-19 22:36:00,853 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [526861843] [2019-11-19 22:36:00,854 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/bin/uautomizer/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:36:00,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:36:00,978 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:36:00,980 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:36:01,032 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:36:01,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:36:01,033 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 11 [2019-11-19 22:36:01,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1313306287] [2019-11-19 22:36:01,033 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:36:01,034 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:36:01,034 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:36:01,034 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:36:01,034 INFO L87 Difference]: Start difference. First operand 71876 states and 189489 transitions. Second operand 9 states. [2019-11-19 22:36:01,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:36:01,731 INFO L93 Difference]: Finished difference Result 85643 states and 224643 transitions. [2019-11-19 22:36:01,731 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 22:36:01,732 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-11-19 22:36:01,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:36:01,868 INFO L225 Difference]: With dead ends: 85643 [2019-11-19 22:36:01,868 INFO L226 Difference]: Without dead ends: 85643 [2019-11-19 22:36:01,868 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-11-19 22:36:02,139 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85643 states. [2019-11-19 22:36:02,964 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85643 to 72047. [2019-11-19 22:36:02,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72047 states. [2019-11-19 22:36:03,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72047 states to 72047 states and 189927 transitions. [2019-11-19 22:36:03,098 INFO L78 Accepts]: Start accepts. Automaton has 72047 states and 189927 transitions. Word has length 118 [2019-11-19 22:36:03,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:36:03,098 INFO L462 AbstractCegarLoop]: Abstraction has 72047 states and 189927 transitions. [2019-11-19 22:36:03,098 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:36:03,098 INFO L276 IsEmpty]: Start isEmpty. Operand 72047 states and 189927 transitions. [2019-11-19 22:36:03,145 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-19 22:36:03,145 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:36:03,146 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:36:03,346 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:36:03,347 INFO L410 AbstractCegarLoop]: === Iteration 35 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:36:03,347 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:36:03,347 INFO L82 PathProgramCache]: Analyzing trace with hash -1633437722, now seen corresponding path program 1 times [2019-11-19 22:36:03,347 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:36:03,347 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1312911874] [2019-11-19 22:36:03,347 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:36:03,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:36:03,468 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:36:03,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1312911874] [2019-11-19 22:36:03,469 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [529397509] [2019-11-19 22:36:03,469 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/bin/uautomizer/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:36:03,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:36:03,587 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:36:03,589 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:36:03,630 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:36:03,630 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:36:03,630 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 11 [2019-11-19 22:36:03,630 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1788107504] [2019-11-19 22:36:03,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:36:03,631 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:36:03,631 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:36:03,631 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:36:03,631 INFO L87 Difference]: Start difference. First operand 72047 states and 189927 transitions. Second operand 9 states. [2019-11-19 22:36:04,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:36:04,151 INFO L93 Difference]: Finished difference Result 84521 states and 221678 transitions. [2019-11-19 22:36:04,152 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 22:36:04,152 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-11-19 22:36:04,152 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:36:04,263 INFO L225 Difference]: With dead ends: 84521 [2019-11-19 22:36:04,263 INFO L226 Difference]: Without dead ends: 84521 [2019-11-19 22:36:04,264 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-11-19 22:36:04,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84521 states. [2019-11-19 22:36:05,842 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84521 to 72218. [2019-11-19 22:36:05,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72218 states. [2019-11-19 22:36:05,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72218 states to 72218 states and 190365 transitions. [2019-11-19 22:36:05,975 INFO L78 Accepts]: Start accepts. Automaton has 72218 states and 190365 transitions. Word has length 118 [2019-11-19 22:36:05,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:36:05,975 INFO L462 AbstractCegarLoop]: Abstraction has 72218 states and 190365 transitions. [2019-11-19 22:36:05,975 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:36:05,975 INFO L276 IsEmpty]: Start isEmpty. Operand 72218 states and 190365 transitions. [2019-11-19 22:36:06,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-19 22:36:06,023 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:36:06,023 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:36:06,223 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:36:06,224 INFO L410 AbstractCegarLoop]: === Iteration 36 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:36:06,224 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:36:06,224 INFO L82 PathProgramCache]: Analyzing trace with hash 1701882808, now seen corresponding path program 1 times [2019-11-19 22:36:06,224 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:36:06,224 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231025104] [2019-11-19 22:36:06,224 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:36:06,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:36:06,336 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:36:06,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231025104] [2019-11-19 22:36:06,336 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1042240012] [2019-11-19 22:36:06,341 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/bin/uautomizer/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:36:06,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:36:06,471 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:36:06,473 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:36:06,518 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:36:06,518 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:36:06,518 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 11 [2019-11-19 22:36:06,518 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1259969879] [2019-11-19 22:36:06,519 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:36:06,519 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:36:06,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:36:06,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:36:06,519 INFO L87 Difference]: Start difference. First operand 72218 states and 190365 transitions. Second operand 9 states. [2019-11-19 22:36:07,004 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:36:07,004 INFO L93 Difference]: Finished difference Result 83399 states and 218713 transitions. [2019-11-19 22:36:07,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 22:36:07,004 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-11-19 22:36:07,005 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:36:07,115 INFO L225 Difference]: With dead ends: 83399 [2019-11-19 22:36:07,115 INFO L226 Difference]: Without dead ends: 83399 [2019-11-19 22:36:07,115 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-11-19 22:36:07,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83399 states. [2019-11-19 22:36:08,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83399 to 72356. [2019-11-19 22:36:08,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72356 states. [2019-11-19 22:36:08,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72356 states to 72356 states and 190715 transitions. [2019-11-19 22:36:08,334 INFO L78 Accepts]: Start accepts. Automaton has 72356 states and 190715 transitions. Word has length 118 [2019-11-19 22:36:08,334 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:36:08,334 INFO L462 AbstractCegarLoop]: Abstraction has 72356 states and 190715 transitions. [2019-11-19 22:36:08,334 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:36:08,335 INFO L276 IsEmpty]: Start isEmpty. Operand 72356 states and 190715 transitions. [2019-11-19 22:36:08,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-19 22:36:08,382 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:36:08,382 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:36:08,585 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:36:08,586 INFO L410 AbstractCegarLoop]: === Iteration 37 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:36:08,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:36:08,586 INFO L82 PathProgramCache]: Analyzing trace with hash -1103710921, now seen corresponding path program 1 times [2019-11-19 22:36:08,586 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:36:08,586 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1592629659] [2019-11-19 22:36:08,586 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:36:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:36:08,715 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:36:08,715 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1592629659] [2019-11-19 22:36:08,716 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [762831976] [2019-11-19 22:36:08,716 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/bin/uautomizer/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:36:08,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:36:08,840 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:36:08,841 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:36:08,897 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:36:08,897 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:36:08,897 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 11 [2019-11-19 22:36:08,898 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1951724827] [2019-11-19 22:36:08,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:36:08,898 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:36:08,898 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:36:08,899 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:36:08,899 INFO L87 Difference]: Start difference. First operand 72356 states and 190715 transitions. Second operand 9 states. [2019-11-19 22:36:09,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:36:09,451 INFO L93 Difference]: Finished difference Result 87737 states and 230563 transitions. [2019-11-19 22:36:09,451 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 22:36:09,451 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-11-19 22:36:09,452 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:36:09,571 INFO L225 Difference]: With dead ends: 87737 [2019-11-19 22:36:09,571 INFO L226 Difference]: Without dead ends: 87737 [2019-11-19 22:36:09,571 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-11-19 22:36:09,846 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87737 states. [2019-11-19 22:36:10,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87737 to 72878. [2019-11-19 22:36:10,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 72878 states. [2019-11-19 22:36:10,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72878 states to 72878 states and 192173 transitions. [2019-11-19 22:36:10,815 INFO L78 Accepts]: Start accepts. Automaton has 72878 states and 192173 transitions. Word has length 118 [2019-11-19 22:36:10,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:36:10,816 INFO L462 AbstractCegarLoop]: Abstraction has 72878 states and 192173 transitions. [2019-11-19 22:36:10,816 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:36:10,816 INFO L276 IsEmpty]: Start isEmpty. Operand 72878 states and 192173 transitions. [2019-11-19 22:36:10,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-19 22:36:10,865 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:36:10,865 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:36:11,067 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:36:11,067 INFO L410 AbstractCegarLoop]: === Iteration 38 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:36:11,067 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:36:11,067 INFO L82 PathProgramCache]: Analyzing trace with hash 1992788566, now seen corresponding path program 1 times [2019-11-19 22:36:11,068 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:36:11,068 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1686301349] [2019-11-19 22:36:11,068 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:36:11,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:36:11,202 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:36:11,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1686301349] [2019-11-19 22:36:11,202 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [69815228] [2019-11-19 22:36:11,203 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/bin/uautomizer/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:36:11,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:36:11,325 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:36:11,327 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:36:11,366 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:36:11,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:36:11,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 11 [2019-11-19 22:36:11,367 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [5857486] [2019-11-19 22:36:11,367 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:36:11,367 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:36:11,368 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:36:11,368 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:36:11,368 INFO L87 Difference]: Start difference. First operand 72878 states and 192173 transitions. Second operand 9 states. [2019-11-19 22:36:11,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:36:11,888 INFO L93 Difference]: Finished difference Result 86615 states and 227598 transitions. [2019-11-19 22:36:11,889 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 22:36:11,889 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-11-19 22:36:11,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:36:12,006 INFO L225 Difference]: With dead ends: 86615 [2019-11-19 22:36:12,006 INFO L226 Difference]: Without dead ends: 86615 [2019-11-19 22:36:12,007 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-11-19 22:36:12,278 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86615 states. [2019-11-19 22:36:13,109 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86615 to 73400. [2019-11-19 22:36:13,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73400 states. [2019-11-19 22:36:13,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73400 states to 73400 states and 193631 transitions. [2019-11-19 22:36:13,908 INFO L78 Accepts]: Start accepts. Automaton has 73400 states and 193631 transitions. Word has length 118 [2019-11-19 22:36:13,908 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:36:13,908 INFO L462 AbstractCegarLoop]: Abstraction has 73400 states and 193631 transitions. [2019-11-19 22:36:13,909 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:36:13,909 INFO L276 IsEmpty]: Start isEmpty. Operand 73400 states and 193631 transitions. [2019-11-19 22:36:13,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 119 [2019-11-19 22:36:13,955 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:36:13,955 INFO L410 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 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-19 22:36:14,155 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:36:14,155 INFO L410 AbstractCegarLoop]: === Iteration 39 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:36:14,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:36:14,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1899711154, now seen corresponding path program 1 times [2019-11-19 22:36:14,156 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:36:14,156 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843093122] [2019-11-19 22:36:14,156 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:36:14,165 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:36:14,261 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 8 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:36:14,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843093122] [2019-11-19 22:36:14,262 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [424719947] [2019-11-19 22:36:14,262 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/bin/uautomizer/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:36:14,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-11-19 22:36:14,362 INFO L255 TraceCheckSpWp]: Trace formula consists of 261 conjuncts, 8 conjunts are in the unsatisfiable core [2019-11-19 22:36:14,364 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2019-11-19 22:36:14,406 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 29 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-11-19 22:36:14,407 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 1 imperfect interpolant sequences. [2019-11-19 22:36:14,407 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [9] total 11 [2019-11-19 22:36:14,407 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2004068673] [2019-11-19 22:36:14,407 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-11-19 22:36:14,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-11-19 22:36:14,408 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-11-19 22:36:14,408 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-11-19 22:36:14,408 INFO L87 Difference]: Start difference. First operand 73400 states and 193631 transitions. Second operand 9 states. [2019-11-19 22:36:14,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-11-19 22:36:14,907 INFO L93 Difference]: Finished difference Result 85493 states and 224633 transitions. [2019-11-19 22:36:14,907 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-11-19 22:36:14,907 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 118 [2019-11-19 22:36:14,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-11-19 22:36:15,023 INFO L225 Difference]: With dead ends: 85493 [2019-11-19 22:36:15,023 INFO L226 Difference]: Without dead ends: 85493 [2019-11-19 22:36:15,023 INFO L630 BasicCegarLoop]: 0 DeclaredPredicates, 132 GetRequests, 117 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2019-11-19 22:36:15,291 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85493 states. [2019-11-19 22:36:16,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85493 to 73529. [2019-11-19 22:36:16,093 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 73529 states. [2019-11-19 22:36:16,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73529 states to 73529 states and 193966 transitions. [2019-11-19 22:36:16,225 INFO L78 Accepts]: Start accepts. Automaton has 73529 states and 193966 transitions. Word has length 118 [2019-11-19 22:36:16,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-11-19 22:36:16,226 INFO L462 AbstractCegarLoop]: Abstraction has 73529 states and 193966 transitions. [2019-11-19 22:36:16,226 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-11-19 22:36:16,226 INFO L276 IsEmpty]: Start isEmpty. Operand 73529 states and 193966 transitions. [2019-11-19 22:36:16,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 121 [2019-11-19 22:36:16,273 INFO L402 BasicCegarLoop]: Found error trace [2019-11-19 22:36:16,273 INFO L410 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, 1, 1, 1, 1, 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-19 22:36:16,474 WARN L499 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 z3 -smt2 -in SMTLIB2_COMPLIANT=true [2019-11-19 22:36:16,474 INFO L410 AbstractCegarLoop]: === Iteration 40 === [t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t1Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION, t2Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-11-19 22:36:16,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-11-19 22:36:16,475 INFO L82 PathProgramCache]: Analyzing trace with hash 572403579, now seen corresponding path program 1 times [2019-11-19 22:36:16,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-11-19 22:36:16,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1416546812] [2019-11-19 22:36:16,475 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-11-19 22:36:16,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:36:16,531 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-11-19 22:36:16,586 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-11-19 22:36:16,586 INFO L475 BasicCegarLoop]: Counterexample might be feasible [2019-11-19 22:36:16,770 INFO L304 ceAbstractionStarter]: Did not count any witness invariants because Icfg is not BoogieIcfg [2019-11-19 22:36:16,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 19.11 10:36:16 BasicIcfg [2019-11-19 22:36:16,776 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-11-19 22:36:16,777 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-11-19 22:36:16,777 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-11-19 22:36:16,777 INFO L275 PluginConnector]: Witness Printer initialized [2019-11-19 22:36:16,778 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 10:34:03" (3/4) ... [2019-11-19 22:36:16,780 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2019-11-19 22:36:16,976 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/run_dir_7f073047-448d-458d-a6fd-4ade9e2e7f8c/bin/uautomizer/witness.graphml [2019-11-19 22:36:16,976 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-11-19 22:36:16,978 INFO L168 Benchmark]: Toolchain (without parser) took 135387.40 ms. Allocated memory was 1.0 GB in the beginning and 5.2 GB in the end (delta: 4.1 GB). Free memory was 947.3 MB in the beginning and 3.1 GB in the end (delta: -2.1 GB). Peak memory consumption was 2.0 GB. Max. memory is 11.5 GB. [2019-11-19 22:36:16,978 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 1.0 GB. Free memory is still 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-11-19 22:36:16,978 INFO L168 Benchmark]: CACSL2BoogieTranslator took 875.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -126.1 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. [2019-11-19 22:36:16,979 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.51 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. [2019-11-19 22:36:16,979 INFO L168 Benchmark]: Boogie Preprocessor took 35.61 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: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. [2019-11-19 22:36:16,980 INFO L168 Benchmark]: RCFGBuilder took 773.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. [2019-11-19 22:36:16,980 INFO L168 Benchmark]: TraceAbstraction took 133436.59 ms. Allocated memory was 1.2 GB in the beginning and 5.2 GB in the end (delta: 4.0 GB). Free memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. [2019-11-19 22:36:16,981 INFO L168 Benchmark]: Witness Printer took 199.52 ms. Allocated memory is still 5.2 GB. Free memory was 3.2 GB in the beginning and 3.1 GB in the end (delta: 88.8 MB). Peak memory consumption was 88.8 MB. Max. memory is 11.5 GB. [2019-11-19 22:36:16,984 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 966.2 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 875.03 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 134.2 MB). Free memory was 947.3 MB in the beginning and 1.1 GB in the end (delta: -126.1 MB). Peak memory consumption was 23.9 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.51 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: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 35.61 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: 1.8 MB). Peak memory consumption was 1.8 MB. Max. memory is 11.5 GB. * RCFGBuilder took 773.64 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 38.2 MB). Peak memory consumption was 38.2 MB. Max. memory is 11.5 GB. * TraceAbstraction took 133436.59 ms. Allocated memory was 1.2 GB in the beginning and 5.2 GB in the end (delta: 4.0 GB). Free memory was 1.0 GB in the beginning and 3.2 GB in the end (delta: -2.1 GB). Peak memory consumption was 1.9 GB. Max. memory is 11.5 GB. * Witness Printer took 199.52 ms. Allocated memory is still 5.2 GB. Free memory was 3.2 GB in the beginning and 3.1 GB in the end (delta: 88.8 MB). Peak memory consumption was 88.8 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 919]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L913] 0 static int top=0; VAL [top=0] [L914] 0 static unsigned int arr[(5)]; VAL [arr={3:0}, top=0] [L915] 0 pthread_mutex_t m; VAL [arr={3:0}, m={6:0}, top=0] [L916] 0 _Bool flag=(0); VAL [arr={3:0}, flag=0, m={6:0}, top=0] [L999] 0 pthread_t id1, id2; VAL [arr={3:0}, flag=0, m={6:0}, top=0] [L1001] FCALL, FORK 0 pthread_create(&id1, ((void *)0), t1, ((void *)0)) VAL [arr={3:0}, flag=0, m={6:0}, top=0] [L968] 1 int i; VAL [arr={3:0}, flag=0, m={6:0}, top=0] [L969] 1 unsigned int tmp; VAL [arr={3:0}, flag=0, m={6:0}, top=0] [L970] 1 i=0 VAL [arr={3:0}, flag=0, m={6:0}, top=0] [L970] COND TRUE 1 i<(5) VAL [arr={3:0}, flag=0, m={6:0}, top=0] [L1002] FCALL, FORK 0 pthread_create(&id2, ((void *)0), t2, ((void *)0)) VAL [arr={3:0}, flag=0, m={6:0}, top=0] [L984] 2 int i; VAL [arr={3:0}, flag=0, m={6:0}, top=0] [L985] 2 i=0 VAL [arr={3:0}, flag=0, m={6:0}, top=0] [L985] COND TRUE 2 i<(5) VAL [arr={3:0}, flag=0, m={6:0}, top=0] [L973] 1 tmp = __VERIFIER_nondet_uint() VAL [arr={3:0}, flag=0, m={6:0}, top=0] [L940] COND FALSE 1 !(top==(5)) VAL [arr={3:0}, flag=0, m={6:0}, top=0] [L932] 1 return top; VAL [arr={3:0}, flag=0, m={6:0}, top=0] [L947] 1 stack[get_top()] = x VAL [arr={3:0}, flag=0, m={6:0}, top=0] [L924] 1 top++ VAL [arr={3:0}, flag=0, m={6:0}, top=1] [L950] 1 return 0; VAL [arr={3:0}, flag=0, m={6:0}, top=1] [L975] COND FALSE 1 !(push(arr,tmp)==(-1)) VAL [arr={3:0}, flag=0, m={6:0}, top=1] [L977] 1 flag=(1) VAL [arr={3:0}, flag=1, m={6:0}, top=1] [L988] COND TRUE 2 \read(flag) VAL [arr={3:0}, flag=1, m={6:0}, top=1] [L932] 2 return top; VAL [arr={3:0}, flag=1, m={6:0}, top=1] [L954] COND FALSE 2 !(get_top()==0) VAL [arr={3:0}, flag=1, m={6:0}, top=1] [L928] 2 top-- VAL [arr={3:0}, flag=1, m={6:0}, top=0] [L932] 2 return top; VAL [arr={3:0}, flag=1, m={6:0}, top=0] [L962] EXPR 2 stack[get_top()] VAL [arr={3:0}, flag=1, m={6:0}, top=0] [L962] 2 return stack[get_top()]; VAL [arr={3:0}, flag=1, m={6:0}, top=0] [L990] COND FALSE 2 !(!(pop(arr)!=(-2))) VAL [arr={3:0}, flag=1, m={6:0}, top=0] [L985] 2 i++ VAL [arr={3:0}, flag=1, m={6:0}, top=0] [L985] COND TRUE 2 i<(5) VAL [arr={3:0}, flag=1, m={6:0}, top=0] [L988] COND TRUE 2 \read(flag) VAL [arr={3:0}, flag=1, m={6:0}, top=0] [L932] 2 return top; VAL [arr={3:0}, flag=1, m={6:0}, top=0] [L954] COND TRUE 2 get_top()==0 VAL [arr={3:0}, flag=1, m={6:0}, top=0] [L957] 2 return (-2); VAL [arr={3:0}, flag=1, m={6:0}, top=0] [L990] COND TRUE 2 !(pop(arr)!=(-2)) VAL [arr={3:0}, flag=1, m={6:0}, top=0] [L919] 2 __VERIFIER_error() VAL [arr={3:0}, flag=1, m={6:0}, top=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 9 procedures, 404 locations, 8 error locations. Result: UNSAFE, OverallTime: 133.1s, OverallIterations: 40, TraceHistogramMax: 3, AutomataDifference: 62.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 25206 SDtfs, 33109 SDslu, 174965 SDs, 0 SdLazy, 26934 SolverSat, 476 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 21.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 2439 GetRequests, 1684 SyntacticMatches, 1 SemanticMatches, 754 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5830 ImplicationChecksByTransitivity, 29.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=83267occurred in iteration=8, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 46.3s AutomataMinimizationTime, 39 MinimizatonAttempts, 333624 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 11.0s InterpolantComputationTime, 5407 NumberOfCodeBlocks, 5407 NumberOfCodeBlocksAsserted, 58 NumberOfCheckSat, 5233 ConstructedInterpolants, 0 QuantifiedInterpolants, 2564690 SizeOfPredicates, 87 NumberOfNonLiveVariables, 3678 ConjunctsInSsa, 102 ConjunctsInUnsatCore, 54 InterpolantComputations, 33 PerfectInterpolantSequences, 387/984 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...