/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/mix042_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 17:02:44,492 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 17:02:44,495 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 17:02:44,512 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 17:02:44,513 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 17:02:44,514 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 17:02:44,515 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 17:02:44,517 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 17:02:44,519 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 17:02:44,519 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 17:02:44,520 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 17:02:44,521 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 17:02:44,522 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 17:02:44,523 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 17:02:44,524 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 17:02:44,525 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 17:02:44,526 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 17:02:44,527 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 17:02:44,528 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 17:02:44,530 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 17:02:44,532 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 17:02:44,533 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 17:02:44,534 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 17:02:44,535 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 17:02:44,538 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 17:02:44,538 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 17:02:44,538 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 17:02:44,539 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 17:02:44,540 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 17:02:44,541 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 17:02:44,541 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 17:02:44,542 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 17:02:44,542 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 17:02:44,543 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 17:02:44,544 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 17:02:44,544 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 17:02:44,545 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 17:02:44,545 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 17:02:44,546 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 17:02:44,546 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 17:02:44,547 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 17:02:44,548 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 17:02:44,568 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 17:02:44,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 17:02:44,569 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 17:02:44,570 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 17:02:44,570 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 17:02:44,570 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 17:02:44,570 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 17:02:44,570 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 17:02:44,571 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 17:02:44,571 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 17:02:44,571 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 17:02:44,571 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 17:02:44,571 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 17:02:44,572 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 17:02:44,572 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 17:02:44,572 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 17:02:44,572 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 17:02:44,572 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 17:02:44,572 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 17:02:44,573 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 17:02:44,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 17:02:44,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 17:02:44,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 17:02:44,574 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 17:02:44,574 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 17:02:44,574 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 17:02:44,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 17:02:44,574 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 17:02:44,575 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 17:02:44,575 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 17:02:44,575 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 17:02:44,842 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 17:02:44,855 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 17:02:44,858 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 17:02:44,860 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 17:02:44,860 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 17:02:44,861 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix042_rmo.oepc.i [2019-12-27 17:02:44,920 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a82a6c9/12629ae72d07439dbc01d42286e1a9bf/FLAG59959da19 [2019-12-27 17:02:45,588 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 17:02:45,588 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix042_rmo.oepc.i [2019-12-27 17:02:45,603 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a82a6c9/12629ae72d07439dbc01d42286e1a9bf/FLAG59959da19 [2019-12-27 17:02:45,828 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b7a82a6c9/12629ae72d07439dbc01d42286e1a9bf [2019-12-27 17:02:45,836 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 17:02:45,838 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 17:02:45,839 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 17:02:45,839 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 17:02:45,843 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 17:02:45,844 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:02:45" (1/1) ... [2019-12-27 17:02:45,847 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2cc7de13 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:45, skipping insertion in model container [2019-12-27 17:02:45,847 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 05:02:45" (1/1) ... [2019-12-27 17:02:45,855 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 17:02:45,920 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 17:02:46,459 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:02:46,472 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 17:02:46,544 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 17:02:46,639 INFO L208 MainTranslator]: Completed translation [2019-12-27 17:02:46,639 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:46 WrapperNode [2019-12-27 17:02:46,639 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 17:02:46,640 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 17:02:46,640 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 17:02:46,640 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 17:02:46,651 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:46" (1/1) ... [2019-12-27 17:02:46,674 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:46" (1/1) ... [2019-12-27 17:02:46,705 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 17:02:46,706 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 17:02:46,706 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 17:02:46,706 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 17:02:46,717 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:46" (1/1) ... [2019-12-27 17:02:46,717 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:46" (1/1) ... [2019-12-27 17:02:46,723 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:46" (1/1) ... [2019-12-27 17:02:46,723 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:46" (1/1) ... [2019-12-27 17:02:46,753 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:46" (1/1) ... [2019-12-27 17:02:46,759 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:46" (1/1) ... [2019-12-27 17:02:46,767 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:46" (1/1) ... [2019-12-27 17:02:46,772 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 17:02:46,779 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 17:02:46,779 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 17:02:46,779 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 17:02:46,780 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/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-12-27 17:02:46,834 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 17:02:46,835 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 17:02:46,835 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 17:02:46,835 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 17:02:46,835 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 17:02:46,835 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 17:02:46,836 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 17:02:46,836 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 17:02:46,836 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 17:02:46,836 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 17:02:46,836 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 17:02:46,836 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 17:02:46,837 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 17:02:46,839 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 17:02:47,580 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 17:02:47,580 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 17:02:47,581 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:02:47 BoogieIcfgContainer [2019-12-27 17:02:47,582 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 17:02:47,583 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 17:02:47,583 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 17:02:47,587 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 17:02:47,587 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 05:02:45" (1/3) ... [2019-12-27 17:02:47,588 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6f70d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:02:47, skipping insertion in model container [2019-12-27 17:02:47,588 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 05:02:46" (2/3) ... [2019-12-27 17:02:47,589 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7b6f70d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 05:02:47, skipping insertion in model container [2019-12-27 17:02:47,589 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 05:02:47" (3/3) ... [2019-12-27 17:02:47,591 INFO L109 eAbstractionObserver]: Analyzing ICFG mix042_rmo.oepc.i [2019-12-27 17:02:47,601 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 17:02:47,602 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 17:02:47,610 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 17:02:47,611 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 17:02:47,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,655 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,655 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,656 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,656 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,656 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,657 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,657 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,657 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,658 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,659 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,660 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,661 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,662 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,663 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,664 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,665 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,667 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,668 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,684 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,684 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,685 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,686 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,687 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,688 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,689 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,690 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,691 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,696 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,697 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,697 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,698 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,698 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,699 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,700 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,701 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,702 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,703 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,704 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,705 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,706 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,707 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,708 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,711 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,712 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,716 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,717 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,718 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,719 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,720 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,721 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,722 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,723 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,724 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,725 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,726 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,727 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,728 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,729 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,731 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,732 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,733 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,738 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,741 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,743 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,744 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,748 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,749 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,753 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,754 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,754 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,754 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,755 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,758 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,758 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,758 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,759 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,760 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,763 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 17:02:47,778 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 17:02:47,804 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 17:02:47,804 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 17:02:47,805 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 17:02:47,805 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 17:02:47,805 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 17:02:47,805 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 17:02:47,805 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 17:02:47,805 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 17:02:47,825 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 177 places, 214 transitions [2019-12-27 17:02:47,827 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 17:02:47,932 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 17:02:47,933 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:02:47,951 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 17:02:47,975 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 177 places, 214 transitions [2019-12-27 17:02:48,032 INFO L132 PetriNetUnfolder]: 47/211 cut-off events. [2019-12-27 17:02:48,032 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 17:02:48,041 INFO L76 FinitePrefix]: Finished finitePrefix Result has 221 conditions, 211 events. 47/211 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 435 event pairs. 0/162 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-27 17:02:48,063 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-27 17:02:48,064 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 17:02:53,297 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 17:02:53,409 WARN L192 SmtUtils]: Spent 109.00 ms on a formula simplification that was a NOOP. DAG size: 81 [2019-12-27 17:02:53,703 WARN L192 SmtUtils]: Spent 268.00 ms on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2019-12-27 17:02:53,832 WARN L192 SmtUtils]: Spent 126.00 ms on a formula simplification that was a NOOP. DAG size: 89 [2019-12-27 17:02:53,864 INFO L206 etLargeBlockEncoding]: Checked pairs total: 87212 [2019-12-27 17:02:53,864 INFO L214 etLargeBlockEncoding]: Total number of compositions: 116 [2019-12-27 17:02:53,868 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 92 places, 100 transitions [2019-12-27 17:03:08,228 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 102314 states. [2019-12-27 17:03:08,230 INFO L276 IsEmpty]: Start isEmpty. Operand 102314 states. [2019-12-27 17:03:08,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-27 17:03:08,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:08,235 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-27 17:03:08,236 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:08,242 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:08,243 INFO L82 PathProgramCache]: Analyzing trace with hash 919766, now seen corresponding path program 1 times [2019-12-27 17:03:08,254 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:08,255 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045843381] [2019-12-27 17:03:08,255 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:08,388 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:08,466 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:08,467 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045843381] [2019-12-27 17:03:08,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:08,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:03:08,469 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [546078284] [2019-12-27 17:03:08,470 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:08,474 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:08,487 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 4 states and 3 transitions. [2019-12-27 17:03:08,488 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:08,491 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:08,492 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:03:08,492 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:08,508 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:03:08,508 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:03:08,511 INFO L87 Difference]: Start difference. First operand 102314 states. Second operand 3 states. [2019-12-27 17:03:11,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:11,267 INFO L93 Difference]: Finished difference Result 101544 states and 430594 transitions. [2019-12-27 17:03:11,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:03:11,269 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-27 17:03:11,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:11,922 INFO L225 Difference]: With dead ends: 101544 [2019-12-27 17:03:11,923 INFO L226 Difference]: Without dead ends: 95304 [2019-12-27 17:03:11,926 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-27 17:03:17,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95304 states. [2019-12-27 17:03:19,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95304 to 95304. [2019-12-27 17:03:19,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 95304 states. [2019-12-27 17:03:23,546 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95304 states to 95304 states and 403554 transitions. [2019-12-27 17:03:23,547 INFO L78 Accepts]: Start accepts. Automaton has 95304 states and 403554 transitions. Word has length 3 [2019-12-27 17:03:23,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:23,548 INFO L462 AbstractCegarLoop]: Abstraction has 95304 states and 403554 transitions. [2019-12-27 17:03:23,548 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:03:23,548 INFO L276 IsEmpty]: Start isEmpty. Operand 95304 states and 403554 transitions. [2019-12-27 17:03:23,552 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-27 17:03:23,552 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:23,552 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:03:23,553 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:23,553 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:23,553 INFO L82 PathProgramCache]: Analyzing trace with hash -1982627867, now seen corresponding path program 1 times [2019-12-27 17:03:23,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:23,554 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244043806] [2019-12-27 17:03:23,554 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:23,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:23,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:23,651 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244043806] [2019-12-27 17:03:23,651 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:23,651 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:03:23,651 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1520636927] [2019-12-27 17:03:23,651 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:23,653 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:23,658 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 12 states and 11 transitions. [2019-12-27 17:03:23,660 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:23,660 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:23,661 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:03:23,662 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:23,662 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:03:23,662 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:03:23,662 INFO L87 Difference]: Start difference. First operand 95304 states and 403554 transitions. Second operand 4 states. [2019-12-27 17:03:28,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:28,929 INFO L93 Difference]: Finished difference Result 152040 states and 617140 transitions. [2019-12-27 17:03:28,929 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:03:28,930 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-27 17:03:28,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:29,459 INFO L225 Difference]: With dead ends: 152040 [2019-12-27 17:03:29,459 INFO L226 Difference]: Without dead ends: 151991 [2019-12-27 17:03:29,460 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-27 17:03:33,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151991 states. [2019-12-27 17:03:36,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151991 to 137801. [2019-12-27 17:03:36,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 137801 states. [2019-12-27 17:03:36,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137801 states to 137801 states and 566928 transitions. [2019-12-27 17:03:36,459 INFO L78 Accepts]: Start accepts. Automaton has 137801 states and 566928 transitions. Word has length 11 [2019-12-27 17:03:36,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:36,460 INFO L462 AbstractCegarLoop]: Abstraction has 137801 states and 566928 transitions. [2019-12-27 17:03:36,460 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:03:36,460 INFO L276 IsEmpty]: Start isEmpty. Operand 137801 states and 566928 transitions. [2019-12-27 17:03:36,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 17:03:36,466 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:36,466 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:03:36,467 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:36,467 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:36,467 INFO L82 PathProgramCache]: Analyzing trace with hash -1673757482, now seen corresponding path program 1 times [2019-12-27 17:03:36,468 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:36,468 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1120020595] [2019-12-27 17:03:36,468 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:36,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:36,532 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:36,532 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1120020595] [2019-12-27 17:03:36,533 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:36,533 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:03:36,533 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1300255754] [2019-12-27 17:03:36,533 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:36,535 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:36,536 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 17:03:36,536 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:36,536 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:36,539 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:03:36,539 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:36,539 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:03:36,540 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:03:36,540 INFO L87 Difference]: Start difference. First operand 137801 states and 566928 transitions. Second operand 3 states. [2019-12-27 17:03:40,591 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:40,591 INFO L93 Difference]: Finished difference Result 30915 states and 99823 transitions. [2019-12-27 17:03:40,592 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:03:40,592 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 17:03:40,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:40,652 INFO L225 Difference]: With dead ends: 30915 [2019-12-27 17:03:40,652 INFO L226 Difference]: Without dead ends: 30915 [2019-12-27 17:03:40,653 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:03:40,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30915 states. [2019-12-27 17:03:41,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30915 to 30915. [2019-12-27 17:03:41,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30915 states. [2019-12-27 17:03:41,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30915 states to 30915 states and 99823 transitions. [2019-12-27 17:03:41,357 INFO L78 Accepts]: Start accepts. Automaton has 30915 states and 99823 transitions. Word has length 13 [2019-12-27 17:03:41,357 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:41,357 INFO L462 AbstractCegarLoop]: Abstraction has 30915 states and 99823 transitions. [2019-12-27 17:03:41,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:03:41,358 INFO L276 IsEmpty]: Start isEmpty. Operand 30915 states and 99823 transitions. [2019-12-27 17:03:41,360 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-27 17:03:41,360 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:41,361 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 17:03:41,361 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:41,361 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:41,361 INFO L82 PathProgramCache]: Analyzing trace with hash 841711145, now seen corresponding path program 1 times [2019-12-27 17:03:41,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:41,362 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052932151] [2019-12-27 17:03:41,362 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:41,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:41,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:41,465 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052932151] [2019-12-27 17:03:41,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:41,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:03:41,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1615160481] [2019-12-27 17:03:41,468 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:41,470 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:41,473 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 17 states and 16 transitions. [2019-12-27 17:03:41,473 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:41,474 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:41,474 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:03:41,474 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:41,475 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:03:41,475 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:03:41,475 INFO L87 Difference]: Start difference. First operand 30915 states and 99823 transitions. Second operand 4 states. [2019-12-27 17:03:41,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:41,848 INFO L93 Difference]: Finished difference Result 38538 states and 124019 transitions. [2019-12-27 17:03:41,848 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:03:41,848 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2019-12-27 17:03:41,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:41,920 INFO L225 Difference]: With dead ends: 38538 [2019-12-27 17:03:41,920 INFO L226 Difference]: Without dead ends: 38538 [2019-12-27 17:03:41,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-12-27 17:03:42,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38538 states. [2019-12-27 17:03:42,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38538 to 34473. [2019-12-27 17:03:42,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34473 states. [2019-12-27 17:03:42,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34473 states to 34473 states and 111272 transitions. [2019-12-27 17:03:42,993 INFO L78 Accepts]: Start accepts. Automaton has 34473 states and 111272 transitions. Word has length 16 [2019-12-27 17:03:42,994 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:42,994 INFO L462 AbstractCegarLoop]: Abstraction has 34473 states and 111272 transitions. [2019-12-27 17:03:42,994 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:03:42,994 INFO L276 IsEmpty]: Start isEmpty. Operand 34473 states and 111272 transitions. [2019-12-27 17:03:43,003 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 17:03:43,003 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:43,003 INFO L411 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] [2019-12-27 17:03:43,004 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:43,004 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:43,004 INFO L82 PathProgramCache]: Analyzing trace with hash 361242897, now seen corresponding path program 1 times [2019-12-27 17:03:43,005 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:43,005 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [621451304] [2019-12-27 17:03:43,005 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:43,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:43,099 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:43,099 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [621451304] [2019-12-27 17:03:43,099 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:43,100 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:03:43,100 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [493119609] [2019-12-27 17:03:43,101 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:43,104 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:43,113 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 37 states and 50 transitions. [2019-12-27 17:03:43,113 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:43,232 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:03:43,232 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:03:43,232 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:43,232 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:03:43,233 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:03:43,233 INFO L87 Difference]: Start difference. First operand 34473 states and 111272 transitions. Second operand 7 states. [2019-12-27 17:03:44,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:44,366 INFO L93 Difference]: Finished difference Result 52978 states and 168667 transitions. [2019-12-27 17:03:44,366 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 17:03:44,366 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 22 [2019-12-27 17:03:44,366 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:44,452 INFO L225 Difference]: With dead ends: 52978 [2019-12-27 17:03:44,452 INFO L226 Difference]: Without dead ends: 52971 [2019-12-27 17:03:44,452 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:03:44,651 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52971 states. [2019-12-27 17:03:45,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52971 to 34062. [2019-12-27 17:03:45,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34062 states. [2019-12-27 17:03:45,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34062 states to 34062 states and 109831 transitions. [2019-12-27 17:03:45,150 INFO L78 Accepts]: Start accepts. Automaton has 34062 states and 109831 transitions. Word has length 22 [2019-12-27 17:03:45,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:45,151 INFO L462 AbstractCegarLoop]: Abstraction has 34062 states and 109831 transitions. [2019-12-27 17:03:45,151 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:03:45,151 INFO L276 IsEmpty]: Start isEmpty. Operand 34062 states and 109831 transitions. [2019-12-27 17:03:45,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 17:03:45,163 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:45,163 INFO L411 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] [2019-12-27 17:03:45,163 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:45,164 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:45,164 INFO L82 PathProgramCache]: Analyzing trace with hash -2019660134, now seen corresponding path program 1 times [2019-12-27 17:03:45,164 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:45,165 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [374328259] [2019-12-27 17:03:45,165 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:45,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:45,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:45,227 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [374328259] [2019-12-27 17:03:45,227 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:45,228 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:03:45,228 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [361788579] [2019-12-27 17:03:45,228 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:45,231 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:45,240 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 50 states and 73 transitions. [2019-12-27 17:03:45,240 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:45,254 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:03:45,254 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:03:45,255 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:45,255 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:03:45,255 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:03:45,256 INFO L87 Difference]: Start difference. First operand 34062 states and 109831 transitions. Second operand 5 states. [2019-12-27 17:03:45,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:45,329 INFO L93 Difference]: Finished difference Result 13768 states and 41803 transitions. [2019-12-27 17:03:45,329 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:03:45,330 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2019-12-27 17:03:45,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:45,349 INFO L225 Difference]: With dead ends: 13768 [2019-12-27 17:03:45,349 INFO L226 Difference]: Without dead ends: 13768 [2019-12-27 17:03:45,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:03:45,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13768 states. [2019-12-27 17:03:45,758 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13768 to 13468. [2019-12-27 17:03:45,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13468 states. [2019-12-27 17:03:45,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13468 states to 13468 states and 40947 transitions. [2019-12-27 17:03:45,785 INFO L78 Accepts]: Start accepts. Automaton has 13468 states and 40947 transitions. Word has length 25 [2019-12-27 17:03:45,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:45,785 INFO L462 AbstractCegarLoop]: Abstraction has 13468 states and 40947 transitions. [2019-12-27 17:03:45,785 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:03:45,785 INFO L276 IsEmpty]: Start isEmpty. Operand 13468 states and 40947 transitions. [2019-12-27 17:03:45,795 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:03:45,796 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:45,796 INFO L411 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] [2019-12-27 17:03:45,796 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:45,796 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:45,796 INFO L82 PathProgramCache]: Analyzing trace with hash -1429942457, now seen corresponding path program 1 times [2019-12-27 17:03:45,797 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:45,797 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [930368508] [2019-12-27 17:03:45,797 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:45,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:45,850 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:45,850 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [930368508] [2019-12-27 17:03:45,851 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:45,851 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:03:45,851 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [176203983] [2019-12-27 17:03:45,851 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:45,857 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:45,867 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 17:03:45,867 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:45,868 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:45,868 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:03:45,868 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:45,868 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:03:45,869 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:03:45,870 INFO L87 Difference]: Start difference. First operand 13468 states and 40947 transitions. Second operand 3 states. [2019-12-27 17:03:45,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:45,987 INFO L93 Difference]: Finished difference Result 19309 states and 57773 transitions. [2019-12-27 17:03:45,988 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:03:45,988 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 17:03:45,989 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:46,023 INFO L225 Difference]: With dead ends: 19309 [2019-12-27 17:03:46,024 INFO L226 Difference]: Without dead ends: 19309 [2019-12-27 17:03:46,024 INFO L631 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-12-27 17:03:46,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19309 states. [2019-12-27 17:03:46,241 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19309 to 14214. [2019-12-27 17:03:46,242 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14214 states. [2019-12-27 17:03:46,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14214 states to 14214 states and 43085 transitions. [2019-12-27 17:03:46,266 INFO L78 Accepts]: Start accepts. Automaton has 14214 states and 43085 transitions. Word has length 27 [2019-12-27 17:03:46,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:46,267 INFO L462 AbstractCegarLoop]: Abstraction has 14214 states and 43085 transitions. [2019-12-27 17:03:46,267 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:03:46,267 INFO L276 IsEmpty]: Start isEmpty. Operand 14214 states and 43085 transitions. [2019-12-27 17:03:46,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:03:46,276 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:46,276 INFO L411 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] [2019-12-27 17:03:46,276 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:46,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:46,276 INFO L82 PathProgramCache]: Analyzing trace with hash -535275942, now seen corresponding path program 1 times [2019-12-27 17:03:46,277 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:46,277 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [670989287] [2019-12-27 17:03:46,277 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:46,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:46,318 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:46,319 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [670989287] [2019-12-27 17:03:46,319 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:46,319 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:03:46,319 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [497322123] [2019-12-27 17:03:46,320 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:46,325 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:46,333 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 17:03:46,333 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:46,333 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:46,333 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:03:46,334 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:46,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:03:46,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:03:46,335 INFO L87 Difference]: Start difference. First operand 14214 states and 43085 transitions. Second operand 3 states. [2019-12-27 17:03:46,430 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:46,430 INFO L93 Difference]: Finished difference Result 21037 states and 62324 transitions. [2019-12-27 17:03:46,430 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:03:46,431 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 27 [2019-12-27 17:03:46,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:46,458 INFO L225 Difference]: With dead ends: 21037 [2019-12-27 17:03:46,458 INFO L226 Difference]: Without dead ends: 21037 [2019-12-27 17:03:46,458 INFO L631 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-12-27 17:03:46,523 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21037 states. [2019-12-27 17:03:46,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21037 to 15942. [2019-12-27 17:03:46,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15942 states. [2019-12-27 17:03:46,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15942 states to 15942 states and 47636 transitions. [2019-12-27 17:03:46,709 INFO L78 Accepts]: Start accepts. Automaton has 15942 states and 47636 transitions. Word has length 27 [2019-12-27 17:03:46,709 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:46,709 INFO L462 AbstractCegarLoop]: Abstraction has 15942 states and 47636 transitions. [2019-12-27 17:03:46,710 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:03:46,710 INFO L276 IsEmpty]: Start isEmpty. Operand 15942 states and 47636 transitions. [2019-12-27 17:03:46,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-27 17:03:46,721 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:46,721 INFO L411 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] [2019-12-27 17:03:46,721 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:46,721 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:46,722 INFO L82 PathProgramCache]: Analyzing trace with hash 1457952739, now seen corresponding path program 1 times [2019-12-27 17:03:46,722 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:46,722 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051612401] [2019-12-27 17:03:46,723 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:46,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:46,832 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:46,832 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051612401] [2019-12-27 17:03:46,832 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:46,832 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:03:46,833 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2001596321] [2019-12-27 17:03:46,833 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:46,838 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:46,843 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 28 states and 27 transitions. [2019-12-27 17:03:46,844 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:46,844 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:46,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:03:46,845 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:46,845 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:03:46,845 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:03:46,845 INFO L87 Difference]: Start difference. First operand 15942 states and 47636 transitions. Second operand 6 states. [2019-12-27 17:03:47,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:47,522 INFO L93 Difference]: Finished difference Result 29609 states and 87623 transitions. [2019-12-27 17:03:47,522 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 17:03:47,522 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-27 17:03:47,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:47,564 INFO L225 Difference]: With dead ends: 29609 [2019-12-27 17:03:47,565 INFO L226 Difference]: Without dead ends: 29609 [2019-12-27 17:03:47,565 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:03:47,648 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29609 states. [2019-12-27 17:03:47,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29609 to 18458. [2019-12-27 17:03:47,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18458 states. [2019-12-27 17:03:47,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18458 states to 18458 states and 55021 transitions. [2019-12-27 17:03:47,916 INFO L78 Accepts]: Start accepts. Automaton has 18458 states and 55021 transitions. Word has length 27 [2019-12-27 17:03:47,916 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:47,917 INFO L462 AbstractCegarLoop]: Abstraction has 18458 states and 55021 transitions. [2019-12-27 17:03:47,917 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:03:47,917 INFO L276 IsEmpty]: Start isEmpty. Operand 18458 states and 55021 transitions. [2019-12-27 17:03:47,930 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 17:03:47,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:47,931 INFO L411 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] [2019-12-27 17:03:47,931 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:47,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:47,931 INFO L82 PathProgramCache]: Analyzing trace with hash 294567066, now seen corresponding path program 1 times [2019-12-27 17:03:47,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:47,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126967779] [2019-12-27 17:03:47,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:47,949 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:48,021 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:48,022 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126967779] [2019-12-27 17:03:48,022 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:48,022 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:03:48,022 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [265777058] [2019-12-27 17:03:48,023 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:48,027 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:48,035 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 29 states and 28 transitions. [2019-12-27 17:03:48,036 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:48,036 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:48,036 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 17:03:48,036 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:48,037 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 17:03:48,037 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-27 17:03:48,037 INFO L87 Difference]: Start difference. First operand 18458 states and 55021 transitions. Second operand 6 states. [2019-12-27 17:03:48,797 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:48,797 INFO L93 Difference]: Finished difference Result 28968 states and 85211 transitions. [2019-12-27 17:03:48,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 17:03:48,800 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 28 [2019-12-27 17:03:48,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:48,837 INFO L225 Difference]: With dead ends: 28968 [2019-12-27 17:03:48,838 INFO L226 Difference]: Without dead ends: 28968 [2019-12-27 17:03:48,838 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:03:48,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28968 states. [2019-12-27 17:03:49,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28968 to 18220. [2019-12-27 17:03:49,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18220 states. [2019-12-27 17:03:49,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18220 states to 18220 states and 54222 transitions. [2019-12-27 17:03:49,165 INFO L78 Accepts]: Start accepts. Automaton has 18220 states and 54222 transitions. Word has length 28 [2019-12-27 17:03:49,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:49,165 INFO L462 AbstractCegarLoop]: Abstraction has 18220 states and 54222 transitions. [2019-12-27 17:03:49,165 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 17:03:49,165 INFO L276 IsEmpty]: Start isEmpty. Operand 18220 states and 54222 transitions. [2019-12-27 17:03:49,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 17:03:49,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:49,183 INFO L411 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] [2019-12-27 17:03:49,183 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:49,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:49,183 INFO L82 PathProgramCache]: Analyzing trace with hash 1705939963, now seen corresponding path program 1 times [2019-12-27 17:03:49,183 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:49,184 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [557642385] [2019-12-27 17:03:49,184 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:49,212 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:49,294 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:49,294 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [557642385] [2019-12-27 17:03:49,294 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:49,295 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:03:49,295 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1412532599] [2019-12-27 17:03:49,295 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:49,300 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:49,310 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 48 states and 61 transitions. [2019-12-27 17:03:49,311 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:49,409 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:03:49,409 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:03:49,410 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:49,410 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:03:49,410 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:03:49,410 INFO L87 Difference]: Start difference. First operand 18220 states and 54222 transitions. Second operand 9 states. [2019-12-27 17:03:51,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:51,706 INFO L93 Difference]: Finished difference Result 52157 states and 153796 transitions. [2019-12-27 17:03:51,707 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 17:03:51,707 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 17:03:51,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:51,787 INFO L225 Difference]: With dead ends: 52157 [2019-12-27 17:03:51,787 INFO L226 Difference]: Without dead ends: 52157 [2019-12-27 17:03:51,788 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 89 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-12-27 17:03:51,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52157 states. [2019-12-27 17:03:52,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52157 to 20337. [2019-12-27 17:03:52,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20337 states. [2019-12-27 17:03:52,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20337 states to 20337 states and 60571 transitions. [2019-12-27 17:03:52,313 INFO L78 Accepts]: Start accepts. Automaton has 20337 states and 60571 transitions. Word has length 33 [2019-12-27 17:03:52,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:52,314 INFO L462 AbstractCegarLoop]: Abstraction has 20337 states and 60571 transitions. [2019-12-27 17:03:52,314 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:03:52,314 INFO L276 IsEmpty]: Start isEmpty. Operand 20337 states and 60571 transitions. [2019-12-27 17:03:52,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-27 17:03:52,474 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:52,474 INFO L411 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] [2019-12-27 17:03:52,474 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:52,474 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:52,474 INFO L82 PathProgramCache]: Analyzing trace with hash 1567643153, now seen corresponding path program 2 times [2019-12-27 17:03:52,475 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:52,475 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [412454766] [2019-12-27 17:03:52,476 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:52,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:52,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:52,595 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [412454766] [2019-12-27 17:03:52,595 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:52,595 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:03:52,595 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [963386657] [2019-12-27 17:03:52,596 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:52,601 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:52,621 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 54 states and 73 transitions. [2019-12-27 17:03:52,622 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:52,623 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:03:52,667 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:03:52,667 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:03:52,668 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:52,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:03:52,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:03:52,668 INFO L87 Difference]: Start difference. First operand 20337 states and 60571 transitions. Second operand 9 states. [2019-12-27 17:03:55,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:55,627 INFO L93 Difference]: Finished difference Result 61814 states and 179044 transitions. [2019-12-27 17:03:55,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 38 states. [2019-12-27 17:03:55,628 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 33 [2019-12-27 17:03:55,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:55,730 INFO L225 Difference]: With dead ends: 61814 [2019-12-27 17:03:55,730 INFO L226 Difference]: Without dead ends: 61814 [2019-12-27 17:03:55,730 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 40 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 395 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=327, Invalid=1079, Unknown=0, NotChecked=0, Total=1406 [2019-12-27 17:03:55,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61814 states. [2019-12-27 17:03:56,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61814 to 22796. [2019-12-27 17:03:56,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22796 states. [2019-12-27 17:03:56,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22796 states to 22796 states and 67944 transitions. [2019-12-27 17:03:56,355 INFO L78 Accepts]: Start accepts. Automaton has 22796 states and 67944 transitions. Word has length 33 [2019-12-27 17:03:56,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:56,355 INFO L462 AbstractCegarLoop]: Abstraction has 22796 states and 67944 transitions. [2019-12-27 17:03:56,356 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:03:56,356 INFO L276 IsEmpty]: Start isEmpty. Operand 22796 states and 67944 transitions. [2019-12-27 17:03:56,374 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 17:03:56,375 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:56,375 INFO L411 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] [2019-12-27 17:03:56,375 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:56,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:56,375 INFO L82 PathProgramCache]: Analyzing trace with hash -607763582, now seen corresponding path program 1 times [2019-12-27 17:03:56,376 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:56,376 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [460448753] [2019-12-27 17:03:56,376 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:56,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:56,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:56,573 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [460448753] [2019-12-27 17:03:56,573 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:56,573 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:03:56,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1606582786] [2019-12-27 17:03:56,574 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:56,580 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:56,595 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 62 transitions. [2019-12-27 17:03:56,595 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:56,696 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 17:03:56,697 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:03:56,697 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:56,697 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:03:56,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:03:56,698 INFO L87 Difference]: Start difference. First operand 22796 states and 67944 transitions. Second operand 9 states. [2019-12-27 17:03:59,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:03:59,178 INFO L93 Difference]: Finished difference Result 47036 states and 138916 transitions. [2019-12-27 17:03:59,179 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2019-12-27 17:03:59,179 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-27 17:03:59,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:03:59,248 INFO L225 Difference]: With dead ends: 47036 [2019-12-27 17:03:59,248 INFO L226 Difference]: Without dead ends: 47036 [2019-12-27 17:03:59,248 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 88 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=128, Invalid=378, Unknown=0, NotChecked=0, Total=506 [2019-12-27 17:03:59,376 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47036 states. [2019-12-27 17:03:59,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47036 to 21660. [2019-12-27 17:03:59,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21660 states. [2019-12-27 17:03:59,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21660 states to 21660 states and 64627 transitions. [2019-12-27 17:03:59,745 INFO L78 Accepts]: Start accepts. Automaton has 21660 states and 64627 transitions. Word has length 34 [2019-12-27 17:03:59,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:03:59,745 INFO L462 AbstractCegarLoop]: Abstraction has 21660 states and 64627 transitions. [2019-12-27 17:03:59,745 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:03:59,746 INFO L276 IsEmpty]: Start isEmpty. Operand 21660 states and 64627 transitions. [2019-12-27 17:03:59,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 17:03:59,764 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:03:59,765 INFO L411 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] [2019-12-27 17:03:59,765 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:03:59,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:03:59,765 INFO L82 PathProgramCache]: Analyzing trace with hash 846412022, now seen corresponding path program 2 times [2019-12-27 17:03:59,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:03:59,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2018421567] [2019-12-27 17:03:59,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:03:59,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:03:59,864 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:03:59,864 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2018421567] [2019-12-27 17:03:59,864 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:03:59,865 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:03:59,865 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1265829620] [2019-12-27 17:03:59,865 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:03:59,873 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:03:59,889 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 46 states and 56 transitions. [2019-12-27 17:03:59,890 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:03:59,890 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:03:59,891 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:03:59,891 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:03:59,891 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:03:59,891 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:03:59,891 INFO L87 Difference]: Start difference. First operand 21660 states and 64627 transitions. Second operand 7 states. [2019-12-27 17:04:01,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:01,067 INFO L93 Difference]: Finished difference Result 48473 states and 140571 transitions. [2019-12-27 17:04:01,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-27 17:04:01,067 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 34 [2019-12-27 17:04:01,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:01,134 INFO L225 Difference]: With dead ends: 48473 [2019-12-27 17:04:01,134 INFO L226 Difference]: Without dead ends: 48473 [2019-12-27 17:04:01,134 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=81, Invalid=225, Unknown=0, NotChecked=0, Total=306 [2019-12-27 17:04:01,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48473 states. [2019-12-27 17:04:01,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48473 to 21115. [2019-12-27 17:04:01,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21115 states. [2019-12-27 17:04:01,635 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21115 states to 21115 states and 63019 transitions. [2019-12-27 17:04:01,635 INFO L78 Accepts]: Start accepts. Automaton has 21115 states and 63019 transitions. Word has length 34 [2019-12-27 17:04:01,636 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:01,636 INFO L462 AbstractCegarLoop]: Abstraction has 21115 states and 63019 transitions. [2019-12-27 17:04:01,636 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:04:01,636 INFO L276 IsEmpty]: Start isEmpty. Operand 21115 states and 63019 transitions. [2019-12-27 17:04:01,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2019-12-27 17:04:01,659 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:01,659 INFO L411 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] [2019-12-27 17:04:01,660 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:01,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:01,660 INFO L82 PathProgramCache]: Analyzing trace with hash -211414604, now seen corresponding path program 3 times [2019-12-27 17:04:01,660 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:01,661 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2105226295] [2019-12-27 17:04:01,661 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:01,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:01,768 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:01,769 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2105226295] [2019-12-27 17:04:01,769 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:01,769 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:04:01,769 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1778835421] [2019-12-27 17:04:01,769 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:01,928 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:01,942 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 52 states and 68 transitions. [2019-12-27 17:04:01,942 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:01,943 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 17:04:01,961 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:04:01,961 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:04:01,961 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:01,962 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:04:01,962 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:04:01,962 INFO L87 Difference]: Start difference. First operand 21115 states and 63019 transitions. Second operand 9 states. [2019-12-27 17:04:04,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:04,966 INFO L93 Difference]: Finished difference Result 50749 states and 146300 transitions. [2019-12-27 17:04:04,966 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 17:04:04,966 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 34 [2019-12-27 17:04:04,967 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:05,036 INFO L225 Difference]: With dead ends: 50749 [2019-12-27 17:04:05,036 INFO L226 Difference]: Without dead ends: 50749 [2019-12-27 17:04:05,037 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 345 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=311, Invalid=1021, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 17:04:05,158 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50749 states. [2019-12-27 17:04:05,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50749 to 20235. [2019-12-27 17:04:05,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20235 states. [2019-12-27 17:04:05,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20235 states to 20235 states and 60391 transitions. [2019-12-27 17:04:05,521 INFO L78 Accepts]: Start accepts. Automaton has 20235 states and 60391 transitions. Word has length 34 [2019-12-27 17:04:05,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:05,521 INFO L462 AbstractCegarLoop]: Abstraction has 20235 states and 60391 transitions. [2019-12-27 17:04:05,521 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:04:05,521 INFO L276 IsEmpty]: Start isEmpty. Operand 20235 states and 60391 transitions. [2019-12-27 17:04:05,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 17:04:05,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:05,545 INFO L411 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] [2019-12-27 17:04:05,546 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:05,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:05,546 INFO L82 PathProgramCache]: Analyzing trace with hash -1053586821, now seen corresponding path program 1 times [2019-12-27 17:04:05,547 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:05,547 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225607698] [2019-12-27 17:04:05,547 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:05,563 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:05,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:05,601 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225607698] [2019-12-27 17:04:05,601 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:05,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 17:04:05,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [106303541] [2019-12-27 17:04:05,602 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:05,609 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:05,663 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 170 states and 351 transitions. [2019-12-27 17:04:05,663 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:05,664 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:04:05,664 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:04:05,665 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:05,665 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:04:05,665 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:04:05,665 INFO L87 Difference]: Start difference. First operand 20235 states and 60391 transitions. Second operand 3 states. [2019-12-27 17:04:05,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:05,729 INFO L93 Difference]: Finished difference Result 20234 states and 60389 transitions. [2019-12-27 17:04:05,730 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:04:05,730 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 17:04:05,730 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:05,757 INFO L225 Difference]: With dead ends: 20234 [2019-12-27 17:04:05,757 INFO L226 Difference]: Without dead ends: 20234 [2019-12-27 17:04:05,757 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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-12-27 17:04:05,820 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20234 states. [2019-12-27 17:04:06,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20234 to 20234. [2019-12-27 17:04:06,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20234 states. [2019-12-27 17:04:06,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20234 states to 20234 states and 60389 transitions. [2019-12-27 17:04:06,058 INFO L78 Accepts]: Start accepts. Automaton has 20234 states and 60389 transitions. Word has length 39 [2019-12-27 17:04:06,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:06,058 INFO L462 AbstractCegarLoop]: Abstraction has 20234 states and 60389 transitions. [2019-12-27 17:04:06,058 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:04:06,058 INFO L276 IsEmpty]: Start isEmpty. Operand 20234 states and 60389 transitions. [2019-12-27 17:04:06,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 17:04:06,084 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:06,084 INFO L411 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] [2019-12-27 17:04:06,084 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:06,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:06,084 INFO L82 PathProgramCache]: Analyzing trace with hash -2145844780, now seen corresponding path program 1 times [2019-12-27 17:04:06,085 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:06,085 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1091847071] [2019-12-27 17:04:06,085 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:06,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:06,136 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:06,136 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1091847071] [2019-12-27 17:04:06,136 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:06,136 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:04:06,137 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [958256061] [2019-12-27 17:04:06,137 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:06,145 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:06,381 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 210 states and 423 transitions. [2019-12-27 17:04:06,381 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:06,422 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 17:04:06,422 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:04:06,422 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:06,423 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:04:06,423 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:04:06,423 INFO L87 Difference]: Start difference. First operand 20234 states and 60389 transitions. Second operand 7 states. [2019-12-27 17:04:06,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:06,553 INFO L93 Difference]: Finished difference Result 18998 states and 57570 transitions. [2019-12-27 17:04:06,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 17:04:06,554 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 40 [2019-12-27 17:04:06,554 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:06,589 INFO L225 Difference]: With dead ends: 18998 [2019-12-27 17:04:06,589 INFO L226 Difference]: Without dead ends: 18998 [2019-12-27 17:04:06,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:04:06,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18998 states. [2019-12-27 17:04:06,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18998 to 16550. [2019-12-27 17:04:06,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16550 states. [2019-12-27 17:04:06,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16550 states to 16550 states and 50746 transitions. [2019-12-27 17:04:06,973 INFO L78 Accepts]: Start accepts. Automaton has 16550 states and 50746 transitions. Word has length 40 [2019-12-27 17:04:06,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:06,973 INFO L462 AbstractCegarLoop]: Abstraction has 16550 states and 50746 transitions. [2019-12-27 17:04:06,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:04:06,973 INFO L276 IsEmpty]: Start isEmpty. Operand 16550 states and 50746 transitions. [2019-12-27 17:04:06,997 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:04:06,998 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:06,998 INFO L411 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] [2019-12-27 17:04:06,998 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:06,998 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:06,998 INFO L82 PathProgramCache]: Analyzing trace with hash 914424357, now seen corresponding path program 1 times [2019-12-27 17:04:06,999 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:06,999 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588938590] [2019-12-27 17:04:07,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:07,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:07,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-12-27 17:04:07,194 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588938590] [2019-12-27 17:04:07,194 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:07,194 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:04:07,195 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1002911401] [2019-12-27 17:04:07,195 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:07,221 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:07,482 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 238 states and 458 transitions. [2019-12-27 17:04:07,482 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:07,582 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 17:04:07,583 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 17:04:07,583 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:07,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 17:04:07,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:04:07,583 INFO L87 Difference]: Start difference. First operand 16550 states and 50746 transitions. Second operand 11 states. [2019-12-27 17:04:11,835 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:11,835 INFO L93 Difference]: Finished difference Result 152948 states and 455135 transitions. [2019-12-27 17:04:11,835 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 65 states. [2019-12-27 17:04:11,836 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 17:04:11,836 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:11,992 INFO L225 Difference]: With dead ends: 152948 [2019-12-27 17:04:11,992 INFO L226 Difference]: Without dead ends: 114492 [2019-12-27 17:04:11,994 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 25 SyntacticMatches, 6 SemanticMatches, 66 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1601 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=890, Invalid=3666, Unknown=0, NotChecked=0, Total=4556 [2019-12-27 17:04:12,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114492 states. [2019-12-27 17:04:12,882 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114492 to 20487. [2019-12-27 17:04:12,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20487 states. [2019-12-27 17:04:12,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20487 states to 20487 states and 63320 transitions. [2019-12-27 17:04:12,919 INFO L78 Accepts]: Start accepts. Automaton has 20487 states and 63320 transitions. Word has length 64 [2019-12-27 17:04:12,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:12,920 INFO L462 AbstractCegarLoop]: Abstraction has 20487 states and 63320 transitions. [2019-12-27 17:04:12,920 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 17:04:12,920 INFO L276 IsEmpty]: Start isEmpty. Operand 20487 states and 63320 transitions. [2019-12-27 17:04:12,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:04:12,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:12,942 INFO L411 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] [2019-12-27 17:04:12,942 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:12,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:12,942 INFO L82 PathProgramCache]: Analyzing trace with hash -466762747, now seen corresponding path program 2 times [2019-12-27 17:04:12,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:12,943 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314620059] [2019-12-27 17:04:12,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:12,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:13,040 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:13,040 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314620059] [2019-12-27 17:04:13,041 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:13,041 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:04:13,041 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [664463198] [2019-12-27 17:04:13,041 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:13,062 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:13,206 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 189 states and 337 transitions. [2019-12-27 17:04:13,206 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:13,219 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 17:04:13,219 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 17:04:13,220 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:13,227 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 17:04:13,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2019-12-27 17:04:13,227 INFO L87 Difference]: Start difference. First operand 20487 states and 63320 transitions. Second operand 8 states. [2019-12-27 17:04:15,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:15,269 INFO L93 Difference]: Finished difference Result 78355 states and 233153 transitions. [2019-12-27 17:04:15,270 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 17:04:15,270 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 64 [2019-12-27 17:04:15,270 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:15,355 INFO L225 Difference]: With dead ends: 78355 [2019-12-27 17:04:15,355 INFO L226 Difference]: Without dead ends: 59440 [2019-12-27 17:04:15,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 76 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=105, Invalid=357, Unknown=0, NotChecked=0, Total=462 [2019-12-27 17:04:15,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59440 states. [2019-12-27 17:04:15,952 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59440 to 24492. [2019-12-27 17:04:15,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24492 states. [2019-12-27 17:04:16,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24492 states to 24492 states and 75075 transitions. [2019-12-27 17:04:16,000 INFO L78 Accepts]: Start accepts. Automaton has 24492 states and 75075 transitions. Word has length 64 [2019-12-27 17:04:16,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:16,000 INFO L462 AbstractCegarLoop]: Abstraction has 24492 states and 75075 transitions. [2019-12-27 17:04:16,000 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 17:04:16,001 INFO L276 IsEmpty]: Start isEmpty. Operand 24492 states and 75075 transitions. [2019-12-27 17:04:16,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:04:16,029 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:16,029 INFO L411 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] [2019-12-27 17:04:16,029 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:16,029 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:16,029 INFO L82 PathProgramCache]: Analyzing trace with hash 849472763, now seen corresponding path program 3 times [2019-12-27 17:04:16,030 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:16,030 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057595220] [2019-12-27 17:04:16,030 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:16,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:16,111 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:16,112 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057595220] [2019-12-27 17:04:16,112 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:16,112 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 17:04:16,112 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [168796348] [2019-12-27 17:04:16,112 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:16,147 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:16,320 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 206 states and 377 transitions. [2019-12-27 17:04:16,320 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:16,442 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 16 times. [2019-12-27 17:04:16,443 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 17:04:16,443 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:16,443 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 17:04:16,444 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=82, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:04:16,444 INFO L87 Difference]: Start difference. First operand 24492 states and 75075 transitions. Second operand 11 states. [2019-12-27 17:04:18,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:18,359 INFO L93 Difference]: Finished difference Result 60485 states and 182050 transitions. [2019-12-27 17:04:18,360 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-27 17:04:18,360 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 64 [2019-12-27 17:04:18,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:18,431 INFO L225 Difference]: With dead ends: 60485 [2019-12-27 17:04:18,431 INFO L226 Difference]: Without dead ends: 52035 [2019-12-27 17:04:18,432 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 15 SyntacticMatches, 3 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=388, Unknown=0, NotChecked=0, Total=506 [2019-12-27 17:04:18,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52035 states. [2019-12-27 17:04:18,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52035 to 24796. [2019-12-27 17:04:18,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24796 states. [2019-12-27 17:04:18,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24796 states to 24796 states and 75989 transitions. [2019-12-27 17:04:18,971 INFO L78 Accepts]: Start accepts. Automaton has 24796 states and 75989 transitions. Word has length 64 [2019-12-27 17:04:18,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:18,971 INFO L462 AbstractCegarLoop]: Abstraction has 24796 states and 75989 transitions. [2019-12-27 17:04:18,971 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 17:04:18,971 INFO L276 IsEmpty]: Start isEmpty. Operand 24796 states and 75989 transitions. [2019-12-27 17:04:18,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-27 17:04:18,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:19,000 INFO L411 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] [2019-12-27 17:04:19,000 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:19,000 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:19,000 INFO L82 PathProgramCache]: Analyzing trace with hash -1624619189, now seen corresponding path program 4 times [2019-12-27 17:04:19,001 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:19,001 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093526501] [2019-12-27 17:04:19,001 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:19,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:19,075 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:19,075 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093526501] [2019-12-27 17:04:19,075 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:19,075 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:04:19,076 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [191688338] [2019-12-27 17:04:19,076 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:19,096 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:19,321 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 192 states and 339 transitions. [2019-12-27 17:04:19,322 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:19,323 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 17:04:19,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:04:19,324 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:19,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:04:19,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:04:19,324 INFO L87 Difference]: Start difference. First operand 24796 states and 75989 transitions. Second operand 3 states. [2019-12-27 17:04:19,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:19,495 INFO L93 Difference]: Finished difference Result 28723 states and 87897 transitions. [2019-12-27 17:04:19,495 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:04:19,495 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-27 17:04:19,495 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:19,550 INFO L225 Difference]: With dead ends: 28723 [2019-12-27 17:04:19,550 INFO L226 Difference]: Without dead ends: 28723 [2019-12-27 17:04:19,551 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:04:19,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28723 states. [2019-12-27 17:04:20,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28723 to 25681. [2019-12-27 17:04:20,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25681 states. [2019-12-27 17:04:20,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25681 states to 25681 states and 78915 transitions. [2019-12-27 17:04:20,054 INFO L78 Accepts]: Start accepts. Automaton has 25681 states and 78915 transitions. Word has length 64 [2019-12-27 17:04:20,054 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:20,054 INFO L462 AbstractCegarLoop]: Abstraction has 25681 states and 78915 transitions. [2019-12-27 17:04:20,055 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:04:20,055 INFO L276 IsEmpty]: Start isEmpty. Operand 25681 states and 78915 transitions. [2019-12-27 17:04:20,086 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:04:20,086 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:20,086 INFO L411 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] [2019-12-27 17:04:20,086 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:20,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:20,086 INFO L82 PathProgramCache]: Analyzing trace with hash -998961960, now seen corresponding path program 1 times [2019-12-27 17:04:20,087 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:20,087 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1862093797] [2019-12-27 17:04:20,087 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:20,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:20,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-12-27 17:04:20,144 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1862093797] [2019-12-27 17:04:20,144 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:20,145 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 17:04:20,145 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1140724716] [2019-12-27 17:04:20,145 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:20,165 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:20,741 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 220 states and 412 transitions. [2019-12-27 17:04:20,741 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:20,756 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 17:04:20,756 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 17:04:20,756 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:20,757 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 17:04:20,757 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:04:20,757 INFO L87 Difference]: Start difference. First operand 25681 states and 78915 transitions. Second operand 5 states. [2019-12-27 17:04:21,236 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:21,237 INFO L93 Difference]: Finished difference Result 47226 states and 144838 transitions. [2019-12-27 17:04:21,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 17:04:21,237 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-27 17:04:21,237 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:21,309 INFO L225 Difference]: With dead ends: 47226 [2019-12-27 17:04:21,309 INFO L226 Difference]: Without dead ends: 47226 [2019-12-27 17:04:21,310 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:04:21,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47226 states. [2019-12-27 17:04:21,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47226 to 27909. [2019-12-27 17:04:21,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27909 states. [2019-12-27 17:04:21,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27909 states to 27909 states and 86203 transitions. [2019-12-27 17:04:21,910 INFO L78 Accepts]: Start accepts. Automaton has 27909 states and 86203 transitions. Word has length 65 [2019-12-27 17:04:21,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:21,911 INFO L462 AbstractCegarLoop]: Abstraction has 27909 states and 86203 transitions. [2019-12-27 17:04:21,911 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 17:04:21,911 INFO L276 IsEmpty]: Start isEmpty. Operand 27909 states and 86203 transitions. [2019-12-27 17:04:21,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:04:21,942 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:21,942 INFO L411 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] [2019-12-27 17:04:21,942 INFO L410 AbstractCegarLoop]: === Iteration 23 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:21,943 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:21,943 INFO L82 PathProgramCache]: Analyzing trace with hash 8687464, now seen corresponding path program 2 times [2019-12-27 17:04:21,943 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:21,944 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216687431] [2019-12-27 17:04:21,944 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:21,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:21,986 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:21,987 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216687431] [2019-12-27 17:04:21,987 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:21,987 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:04:21,987 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [482401095] [2019-12-27 17:04:21,987 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:22,009 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:22,326 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 212 states and 392 transitions. [2019-12-27 17:04:22,327 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:22,328 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:04:22,329 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:04:22,329 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:22,329 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:04:22,329 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:04:22,329 INFO L87 Difference]: Start difference. First operand 27909 states and 86203 transitions. Second operand 3 states. [2019-12-27 17:04:22,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:22,652 INFO L93 Difference]: Finished difference Result 37303 states and 115295 transitions. [2019-12-27 17:04:22,652 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:04:22,652 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 17:04:22,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:22,728 INFO L225 Difference]: With dead ends: 37303 [2019-12-27 17:04:22,728 INFO L226 Difference]: Without dead ends: 37303 [2019-12-27 17:04:22,728 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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-12-27 17:04:22,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37303 states. [2019-12-27 17:04:23,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37303 to 28406. [2019-12-27 17:04:23,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28406 states. [2019-12-27 17:04:23,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28406 states to 28406 states and 87754 transitions. [2019-12-27 17:04:23,458 INFO L78 Accepts]: Start accepts. Automaton has 28406 states and 87754 transitions. Word has length 65 [2019-12-27 17:04:23,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:23,458 INFO L462 AbstractCegarLoop]: Abstraction has 28406 states and 87754 transitions. [2019-12-27 17:04:23,458 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:04:23,458 INFO L276 IsEmpty]: Start isEmpty. Operand 28406 states and 87754 transitions. [2019-12-27 17:04:23,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:04:23,490 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:23,493 INFO L411 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] [2019-12-27 17:04:23,493 INFO L410 AbstractCegarLoop]: === Iteration 24 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:23,493 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:23,493 INFO L82 PathProgramCache]: Analyzing trace with hash 405134954, now seen corresponding path program 1 times [2019-12-27 17:04:23,494 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:23,494 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700588042] [2019-12-27 17:04:23,494 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:23,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:23,609 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:23,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700588042] [2019-12-27 17:04:23,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:23,610 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:04:23,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1116748554] [2019-12-27 17:04:23,610 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:23,630 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:23,902 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 212 states and 392 transitions. [2019-12-27 17:04:23,902 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:24,012 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 17:04:24,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 17:04:24,013 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:24,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 17:04:24,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:04:24,013 INFO L87 Difference]: Start difference. First operand 28406 states and 87754 transitions. Second operand 11 states. [2019-12-27 17:04:26,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:26,913 INFO L93 Difference]: Finished difference Result 117480 states and 349351 transitions. [2019-12-27 17:04:26,913 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-27 17:04:26,913 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 65 [2019-12-27 17:04:26,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:27,087 INFO L225 Difference]: With dead ends: 117480 [2019-12-27 17:04:27,087 INFO L226 Difference]: Without dead ends: 109778 [2019-12-27 17:04:27,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 11 SyntacticMatches, 5 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 569 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=455, Invalid=1525, Unknown=0, NotChecked=0, Total=1980 [2019-12-27 17:04:27,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109778 states. [2019-12-27 17:04:28,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109778 to 28066. [2019-12-27 17:04:28,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28066 states. [2019-12-27 17:04:28,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28066 states to 28066 states and 86443 transitions. [2019-12-27 17:04:28,564 INFO L78 Accepts]: Start accepts. Automaton has 28066 states and 86443 transitions. Word has length 65 [2019-12-27 17:04:28,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:28,565 INFO L462 AbstractCegarLoop]: Abstraction has 28066 states and 86443 transitions. [2019-12-27 17:04:28,565 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 17:04:28,565 INFO L276 IsEmpty]: Start isEmpty. Operand 28066 states and 86443 transitions. [2019-12-27 17:04:28,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:04:28,597 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:28,597 INFO L411 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] [2019-12-27 17:04:28,597 INFO L410 AbstractCegarLoop]: === Iteration 25 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:28,597 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:28,597 INFO L82 PathProgramCache]: Analyzing trace with hash 32225569, now seen corresponding path program 1 times [2019-12-27 17:04:28,598 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:28,598 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687685967] [2019-12-27 17:04:28,598 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:28,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:28,689 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:28,689 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687685967] [2019-12-27 17:04:28,690 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:28,690 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 17:04:28,690 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [690568371] [2019-12-27 17:04:28,690 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:28,710 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:28,903 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 186 states and 319 transitions. [2019-12-27 17:04:28,903 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:28,953 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 17:04:28,953 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 17:04:28,954 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:28,954 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 17:04:28,954 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 17:04:28,954 INFO L87 Difference]: Start difference. First operand 28066 states and 86443 transitions. Second operand 7 states. [2019-12-27 17:04:29,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:29,952 INFO L93 Difference]: Finished difference Result 42381 states and 127412 transitions. [2019-12-27 17:04:29,953 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 17:04:29,953 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 65 [2019-12-27 17:04:29,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:30,012 INFO L225 Difference]: With dead ends: 42381 [2019-12-27 17:04:30,012 INFO L226 Difference]: Without dead ends: 42161 [2019-12-27 17:04:30,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 4 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=74, Unknown=0, NotChecked=0, Total=110 [2019-12-27 17:04:30,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42161 states. [2019-12-27 17:04:30,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42161 to 34369. [2019-12-27 17:04:30,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34369 states. [2019-12-27 17:04:30,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34369 states to 34369 states and 104583 transitions. [2019-12-27 17:04:30,958 INFO L78 Accepts]: Start accepts. Automaton has 34369 states and 104583 transitions. Word has length 65 [2019-12-27 17:04:30,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:30,958 INFO L462 AbstractCegarLoop]: Abstraction has 34369 states and 104583 transitions. [2019-12-27 17:04:30,958 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 17:04:30,959 INFO L276 IsEmpty]: Start isEmpty. Operand 34369 states and 104583 transitions. [2019-12-27 17:04:30,999 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:04:30,999 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:30,999 INFO L411 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] [2019-12-27 17:04:30,999 INFO L410 AbstractCegarLoop]: === Iteration 26 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:30,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:31,000 INFO L82 PathProgramCache]: Analyzing trace with hash 1958685575, now seen corresponding path program 2 times [2019-12-27 17:04:31,000 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:31,000 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [687548592] [2019-12-27 17:04:31,000 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:31,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:31,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:31,161 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [687548592] [2019-12-27 17:04:31,161 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:31,162 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:04:31,162 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [145297188] [2019-12-27 17:04:31,162 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:31,181 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:31,389 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 193 states and 337 transitions. [2019-12-27 17:04:31,390 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:31,444 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 11 times. [2019-12-27 17:04:31,444 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 17:04:31,444 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:31,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 17:04:31,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-27 17:04:31,445 INFO L87 Difference]: Start difference. First operand 34369 states and 104583 transitions. Second operand 9 states. [2019-12-27 17:04:34,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:34,984 INFO L93 Difference]: Finished difference Result 83598 states and 250043 transitions. [2019-12-27 17:04:34,984 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-27 17:04:34,984 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 65 [2019-12-27 17:04:34,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:35,113 INFO L225 Difference]: With dead ends: 83598 [2019-12-27 17:04:35,113 INFO L226 Difference]: Without dead ends: 83598 [2019-12-27 17:04:35,114 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 367 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=297, Invalid=1035, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 17:04:35,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83598 states. [2019-12-27 17:04:36,274 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83598 to 34257. [2019-12-27 17:04:36,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34257 states. [2019-12-27 17:04:36,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34257 states to 34257 states and 104277 transitions. [2019-12-27 17:04:36,342 INFO L78 Accepts]: Start accepts. Automaton has 34257 states and 104277 transitions. Word has length 65 [2019-12-27 17:04:36,343 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:36,343 INFO L462 AbstractCegarLoop]: Abstraction has 34257 states and 104277 transitions. [2019-12-27 17:04:36,343 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 17:04:36,343 INFO L276 IsEmpty]: Start isEmpty. Operand 34257 states and 104277 transitions. [2019-12-27 17:04:36,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:04:36,381 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:36,382 INFO L411 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] [2019-12-27 17:04:36,382 INFO L410 AbstractCegarLoop]: === Iteration 27 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:36,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:36,382 INFO L82 PathProgramCache]: Analyzing trace with hash 1949977412, now seen corresponding path program 3 times [2019-12-27 17:04:36,383 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:36,383 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [463720259] [2019-12-27 17:04:36,383 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:36,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:36,450 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:36,450 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [463720259] [2019-12-27 17:04:36,450 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:36,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 17:04:36,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1860705742] [2019-12-27 17:04:36,451 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:36,471 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:36,656 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 180 states and 304 transitions. [2019-12-27 17:04:36,656 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:36,657 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 17:04:36,658 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 17:04:36,658 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:36,658 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 17:04:36,658 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 17:04:36,658 INFO L87 Difference]: Start difference. First operand 34257 states and 104277 transitions. Second operand 4 states. [2019-12-27 17:04:36,812 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:36,812 INFO L93 Difference]: Finished difference Result 33914 states and 103030 transitions. [2019-12-27 17:04:36,813 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 17:04:36,813 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 65 [2019-12-27 17:04:36,813 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:36,860 INFO L225 Difference]: With dead ends: 33914 [2019-12-27 17:04:36,860 INFO L226 Difference]: Without dead ends: 33914 [2019-12-27 17:04:36,860 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 17:04:36,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33914 states. [2019-12-27 17:04:37,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33914 to 30163. [2019-12-27 17:04:37,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30163 states. [2019-12-27 17:04:37,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30163 states to 30163 states and 90883 transitions. [2019-12-27 17:04:37,328 INFO L78 Accepts]: Start accepts. Automaton has 30163 states and 90883 transitions. Word has length 65 [2019-12-27 17:04:37,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:37,329 INFO L462 AbstractCegarLoop]: Abstraction has 30163 states and 90883 transitions. [2019-12-27 17:04:37,329 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 17:04:37,329 INFO L276 IsEmpty]: Start isEmpty. Operand 30163 states and 90883 transitions. [2019-12-27 17:04:37,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:04:37,361 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:37,361 INFO L411 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] [2019-12-27 17:04:37,362 INFO L410 AbstractCegarLoop]: === Iteration 28 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:37,362 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:37,362 INFO L82 PathProgramCache]: Analyzing trace with hash -755298849, now seen corresponding path program 3 times [2019-12-27 17:04:37,362 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:37,363 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949344790] [2019-12-27 17:04:37,363 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:37,380 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:37,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:37,527 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949344790] [2019-12-27 17:04:37,528 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:37,528 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-27 17:04:37,528 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1081888216] [2019-12-27 17:04:37,528 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:37,548 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:37,748 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 164 states and 261 transitions. [2019-12-27 17:04:37,748 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:37,862 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 17:04:37,862 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 17:04:37,862 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:37,863 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 17:04:37,863 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-27 17:04:37,863 INFO L87 Difference]: Start difference. First operand 30163 states and 90883 transitions. Second operand 10 states. [2019-12-27 17:04:41,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:41,844 INFO L93 Difference]: Finished difference Result 67902 states and 200392 transitions. [2019-12-27 17:04:41,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 42 states. [2019-12-27 17:04:41,844 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 65 [2019-12-27 17:04:41,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:41,937 INFO L225 Difference]: With dead ends: 67902 [2019-12-27 17:04:41,937 INFO L226 Difference]: Without dead ends: 67650 [2019-12-27 17:04:41,937 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 40 SyntacticMatches, 7 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 481 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=315, Invalid=1491, Unknown=0, NotChecked=0, Total=1806 [2019-12-27 17:04:42,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67650 states. [2019-12-27 17:04:42,686 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67650 to 32693. [2019-12-27 17:04:42,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32693 states. [2019-12-27 17:04:42,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32693 states to 32693 states and 98294 transitions. [2019-12-27 17:04:42,757 INFO L78 Accepts]: Start accepts. Automaton has 32693 states and 98294 transitions. Word has length 65 [2019-12-27 17:04:42,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:42,757 INFO L462 AbstractCegarLoop]: Abstraction has 32693 states and 98294 transitions. [2019-12-27 17:04:42,757 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 17:04:42,757 INFO L276 IsEmpty]: Start isEmpty. Operand 32693 states and 98294 transitions. [2019-12-27 17:04:42,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-27 17:04:42,798 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:42,798 INFO L411 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] [2019-12-27 17:04:42,798 INFO L410 AbstractCegarLoop]: === Iteration 29 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:42,798 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:42,798 INFO L82 PathProgramCache]: Analyzing trace with hash 1171161157, now seen corresponding path program 4 times [2019-12-27 17:04:42,799 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:42,799 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28105990] [2019-12-27 17:04:42,799 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:42,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:42,859 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:42,859 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28105990] [2019-12-27 17:04:42,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:42,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:04:42,860 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [296355813] [2019-12-27 17:04:42,860 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:42,880 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:43,080 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 171 states and 279 transitions. [2019-12-27 17:04:43,080 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:43,081 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:04:43,081 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:04:43,081 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:43,082 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:04:43,082 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:04:43,082 INFO L87 Difference]: Start difference. First operand 32693 states and 98294 transitions. Second operand 3 states. [2019-12-27 17:04:43,210 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:43,210 INFO L93 Difference]: Finished difference Result 32693 states and 98293 transitions. [2019-12-27 17:04:43,210 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:04:43,211 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-27 17:04:43,211 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:43,254 INFO L225 Difference]: With dead ends: 32693 [2019-12-27 17:04:43,254 INFO L226 Difference]: Without dead ends: 32693 [2019-12-27 17:04:43,254 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:04:43,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32693 states. [2019-12-27 17:04:43,857 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32693 to 25554. [2019-12-27 17:04:43,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25554 states. [2019-12-27 17:04:43,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25554 states to 25554 states and 78463 transitions. [2019-12-27 17:04:43,904 INFO L78 Accepts]: Start accepts. Automaton has 25554 states and 78463 transitions. Word has length 65 [2019-12-27 17:04:43,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:43,905 INFO L462 AbstractCegarLoop]: Abstraction has 25554 states and 78463 transitions. [2019-12-27 17:04:43,905 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:04:43,905 INFO L276 IsEmpty]: Start isEmpty. Operand 25554 states and 78463 transitions. [2019-12-27 17:04:43,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-27 17:04:43,931 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:43,931 INFO L411 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] [2019-12-27 17:04:43,931 INFO L410 AbstractCegarLoop]: === Iteration 30 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:43,931 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:43,932 INFO L82 PathProgramCache]: Analyzing trace with hash -1288264236, now seen corresponding path program 1 times [2019-12-27 17:04:43,932 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:43,932 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1417064369] [2019-12-27 17:04:43,932 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:43,960 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 17:04:43,997 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 17:04:43,997 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1417064369] [2019-12-27 17:04:43,997 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 17:04:43,997 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 17:04:43,998 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [831153420] [2019-12-27 17:04:43,998 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 17:04:44,018 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 17:04:44,195 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 161 states and 247 transitions. [2019-12-27 17:04:44,195 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 17:04:44,195 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 17:04:44,196 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 17:04:44,196 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 17:04:44,196 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 17:04:44,196 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:04:44,196 INFO L87 Difference]: Start difference. First operand 25554 states and 78463 transitions. Second operand 3 states. [2019-12-27 17:04:44,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 17:04:44,282 INFO L93 Difference]: Finished difference Result 20770 states and 62635 transitions. [2019-12-27 17:04:44,282 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 17:04:44,282 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-27 17:04:44,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 17:04:44,307 INFO L225 Difference]: With dead ends: 20770 [2019-12-27 17:04:44,307 INFO L226 Difference]: Without dead ends: 20770 [2019-12-27 17:04:44,308 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 17:04:44,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20770 states. [2019-12-27 17:04:44,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20770 to 18868. [2019-12-27 17:04:44,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18868 states. [2019-12-27 17:04:44,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18868 states to 18868 states and 56853 transitions. [2019-12-27 17:04:44,571 INFO L78 Accepts]: Start accepts. Automaton has 18868 states and 56853 transitions. Word has length 66 [2019-12-27 17:04:44,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 17:04:44,572 INFO L462 AbstractCegarLoop]: Abstraction has 18868 states and 56853 transitions. [2019-12-27 17:04:44,572 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 17:04:44,572 INFO L276 IsEmpty]: Start isEmpty. Operand 18868 states and 56853 transitions. [2019-12-27 17:04:44,589 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-27 17:04:44,589 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 17:04:44,589 INFO L411 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] [2019-12-27 17:04:44,590 INFO L410 AbstractCegarLoop]: === Iteration 31 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 17:04:44,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 17:04:44,590 INFO L82 PathProgramCache]: Analyzing trace with hash 1790496915, now seen corresponding path program 1 times [2019-12-27 17:04:44,590 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 17:04:44,591 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1223931079] [2019-12-27 17:04:44,591 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 17:04:44,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:04:44,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 17:04:44,726 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 17:04:44,727 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 17:04:44,731 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [901] [901] ULTIMATE.startENTRY-->L830: Formula: (let ((.cse0 (store |v_#valid_93| 0 0))) (and (= v_~main$tmp_guard0~0_31 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1117~0.base_55|) (= 0 v_~a$read_delayed_var~0.base_8) (= v_~a$r_buff1_thd3~0_279 0) (= v_~a$flush_delayed~0_36 0) (= 0 v_~a$r_buff1_thd2~0_156) (= v_~a$r_buff0_thd0~0_153 0) (= v_~a$mem_tmp~0_25 0) (= v_~a$r_buff0_thd3~0_364 0) (= (store .cse0 |v_ULTIMATE.start_main_~#t1117~0.base_55| 1) |v_#valid_91|) (= v_~__unbuffered_p2_EBX~0_67 0) (= v_~y~0_75 0) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1117~0.base_55| 4) |v_#length_25|) (= v_~a~0_169 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~main$tmp_guard1~0_56 0) (= 0 v_~a$w_buff1~0_224) (= 0 v_~__unbuffered_cnt~0_98) (= 0 v_~a$w_buff0_used~0_781) (= 0 v_~a$r_buff1_thd1~0_124) (= 0 v_~a$r_buff0_thd2~0_146) (= 0 v_~weak$$choice0~0_21) (= |v_ULTIMATE.start_main_~#t1117~0.offset_34| 0) (= 0 |v_#NULL.base_4|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1117~0.base_55|) 0) (= 0 v_~a$w_buff1_used~0_506) (= 0 v_~__unbuffered_p2_EAX~0_61) (= |v_#NULL.offset_4| 0) (= v_~a$w_buff0~0_325 0) (= 0 v_~__unbuffered_p0_EAX~0_116) (= v_~z~0_20 0) (= v_~a$read_delayed_var~0.offset_8 0) (= v_~x~0_91 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1117~0.base_55| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1117~0.base_55|) |v_ULTIMATE.start_main_~#t1117~0.offset_34| 0)) |v_#memory_int_21|) (= v_~weak$$choice2~0_114 0) (= v_~a$r_buff1_thd0~0_166 0) (= 0 v_~a$r_buff0_thd1~0_224) (= 0 v_~a$read_delayed~0_8))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_93|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_~#t1118~0.base=|v_ULTIMATE.start_main_~#t1118~0.base_41|, ULTIMATE.start_main_~#t1117~0.offset=|v_ULTIMATE.start_main_~#t1117~0.offset_34|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_156, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_28|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_60|, ~a$r_buff0_thd0~0=v_~a$r_buff0_thd0~0_153, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_210|, ~a~0=v_~a~0_169, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_105|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_116, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_61, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_67, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_9|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_279, ULTIMATE.start_main_~#t1117~0.base=|v_ULTIMATE.start_main_~#t1117~0.base_55|, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_781, ~a$r_buff0_thd1~0=v_~a$r_buff0_thd1~0_224, ~weak$$choice0~0=v_~weak$$choice0~0_21, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~a$read_delayed_var~0.offset=v_~a$read_delayed_var~0.offset_8, ~a$w_buff0~0=v_~a$w_buff0~0_325, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_166, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_98, ~x~0=v_~x~0_91, ~a$read_delayed~0=v_~a$read_delayed~0_8, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_146, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_56, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_32|, ~a$mem_tmp~0=v_~a$mem_tmp~0_25, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_44|, ULTIMATE.start_main_~#t1118~0.offset=|v_ULTIMATE.start_main_~#t1118~0.offset_19|, ~a$w_buff1~0=v_~a$w_buff1~0_224, ~y~0=v_~y~0_75, ULTIMATE.start_main_~#t1119~0.offset=|v_ULTIMATE.start_main_~#t1119~0.offset_20|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_28|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_9|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_124, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_364, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_31, #NULL.base=|v_#NULL.base_4|, ~a$flush_delayed~0=v_~a$flush_delayed~0_36, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_37|, #valid=|v_#valid_91|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_20, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_506, ULTIMATE.start_main_~#t1119~0.base=|v_ULTIMATE.start_main_~#t1119~0.base_28|, ~weak$$choice2~0=v_~weak$$choice2~0_114, ~a$read_delayed_var~0.base=v_~a$read_delayed_var~0.base_8} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1118~0.base, ULTIMATE.start_main_~#t1117~0.offset, ~a$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ~a$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite50, ~a~0, ULTIMATE.start_main_#t~ite52, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet45, ~a$r_buff1_thd3~0, ULTIMATE.start_main_~#t1117~0.base, ~a$w_buff0_used~0, ~a$r_buff0_thd1~0, ~weak$$choice0~0, ~a$read_delayed_var~0.offset, ~a$w_buff0~0, ~a$r_buff1_thd0~0, ~__unbuffered_cnt~0, ~x~0, ~a$read_delayed~0, ~a$r_buff0_thd2~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~a$mem_tmp~0, ULTIMATE.start_main_#t~ite51, ULTIMATE.start_main_~#t1118~0.offset, ~a$w_buff1~0, ~y~0, ULTIMATE.start_main_~#t1119~0.offset, ULTIMATE.start_main_#t~nondet46, ULTIMATE.start_main_#t~nondet44, ~a$r_buff1_thd1~0, ~a$r_buff0_thd3~0, ~main$tmp_guard0~0, #NULL.base, ~a$flush_delayed~0, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~a$w_buff1_used~0, ULTIMATE.start_main_~#t1119~0.base, ~weak$$choice2~0, ~a$read_delayed_var~0.base] because there is no mapped edge [2019-12-27 17:04:44,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [880] [880] L4-->L748: Formula: (and (= ~a$r_buff1_thd0~0_Out1277589751 ~a$r_buff0_thd0~0_In1277589751) (= ~a$r_buff0_thd1~0_In1277589751 ~a$r_buff1_thd1~0_Out1277589751) (not (= 0 P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1277589751)) (= ~a$r_buff0_thd1~0_Out1277589751 1) (= ~a$r_buff0_thd2~0_In1277589751 ~a$r_buff1_thd2~0_Out1277589751) (= ~__unbuffered_p0_EAX~0_Out1277589751 ~x~0_In1277589751) (= ~a$r_buff1_thd3~0_Out1277589751 ~a$r_buff0_thd3~0_In1277589751)) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1277589751, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1277589751, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1277589751, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In1277589751, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1277589751, ~x~0=~x~0_In1277589751} OutVars{~__unbuffered_p0_EAX~0=~__unbuffered_p0_EAX~0_Out1277589751, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_Out1277589751, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_Out1277589751, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_Out1277589751, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_Out1277589751, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1277589751, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In1277589751, P0Thread1of1ForFork1___VERIFIER_assert_~expression=P0Thread1of1ForFork1___VERIFIER_assert_~expression_In1277589751, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out1277589751, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1277589751, ~x~0=~x~0_In1277589751} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~a$r_buff1_thd1~0, ~a$r_buff1_thd3~0, ~a$r_buff1_thd2~0, ~a$r_buff1_thd0~0, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:04:44,733 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L830-1-->L832: Formula: (and (= |v_#memory_int_11| (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1118~0.base_9| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1118~0.base_9|) |v_ULTIMATE.start_main_~#t1118~0.offset_7| 1))) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1118~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t1118~0.base_9| 0)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t1118~0.base_9| 4) |v_#length_15|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t1118~0.base_9| 1) |v_#valid_34|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t1118~0.base_9|)) (= |v_ULTIMATE.start_main_~#t1118~0.offset_7| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{ULTIMATE.start_main_~#t1118~0.base=|v_ULTIMATE.start_main_~#t1118~0.base_9|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1118~0.offset=|v_ULTIMATE.start_main_~#t1118~0.offset_7|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_4|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1118~0.base, ULTIMATE.start_main_~#t1118~0.offset, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length] because there is no mapped edge [2019-12-27 17:04:44,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [858] [858] L832-1-->L834: Formula: (and (= |v_ULTIMATE.start_main_~#t1119~0.offset_8| 0) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t1119~0.base_9| 4)) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1119~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1119~0.base_9|) |v_ULTIMATE.start_main_~#t1119~0.offset_8| 2)) |v_#memory_int_9|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t1119~0.base_9|) (not (= |v_ULTIMATE.start_main_~#t1119~0.base_9| 0)) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t1119~0.base_9|)) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t1119~0.base_9| 1) |v_#valid_32|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, ULTIMATE.start_main_~#t1119~0.offset=|v_ULTIMATE.start_main_~#t1119~0.offset_8|, #valid=|v_#valid_32|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_4|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1119~0.base=|v_ULTIMATE.start_main_~#t1119~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1119~0.offset, #valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1119~0.base] because there is no mapped edge [2019-12-27 17:04:44,737 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [826] [826] L768-2-->L768-5: Formula: (let ((.cse0 (= |P1Thread1of1ForFork2_#t~ite10_Out640236180| |P1Thread1of1ForFork2_#t~ite9_Out640236180|)) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In640236180 256))) (.cse2 (= (mod ~a$r_buff1_thd2~0_In640236180 256) 0))) (or (and .cse0 (= ~a~0_In640236180 |P1Thread1of1ForFork2_#t~ite9_Out640236180|) (or .cse1 .cse2)) (and .cse0 (not .cse1) (not .cse2) (= |P1Thread1of1ForFork2_#t~ite9_Out640236180| ~a$w_buff1~0_In640236180)))) InVars {~a~0=~a~0_In640236180, ~a$w_buff1~0=~a$w_buff1~0_In640236180, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In640236180, ~a$w_buff1_used~0=~a$w_buff1_used~0_In640236180} OutVars{~a~0=~a~0_In640236180, P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out640236180|, ~a$w_buff1~0=~a$w_buff1~0_In640236180, ~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In640236180, P1Thread1of1ForFork2_#t~ite10=|P1Thread1of1ForFork2_#t~ite10_Out640236180|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In640236180} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10] because there is no mapped edge [2019-12-27 17:04:44,742 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L769-->L769-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In1520239143 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1520239143 256)))) (or (and (= |P1Thread1of1ForFork2_#t~ite11_Out1520239143| ~a$w_buff0_used~0_In1520239143) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P1Thread1of1ForFork2_#t~ite11_Out1520239143| 0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1520239143, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1520239143} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1520239143, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1520239143, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out1520239143|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 17:04:44,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff1_thd2~0_In-219387632 256))) (.cse0 (= (mod ~a$w_buff1_used~0_In-219387632 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-219387632 256))) (.cse2 (= (mod ~a$r_buff0_thd2~0_In-219387632 256) 0))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-219387632|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~a$w_buff1_used~0_In-219387632 |P1Thread1of1ForFork2_#t~ite12_Out-219387632|)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-219387632, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-219387632, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-219387632, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-219387632} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-219387632, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-219387632, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-219387632, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-219387632|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-219387632} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-27 17:04:44,743 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [877] [877] L796-->L796-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-364140551 256)))) (or (and .cse0 (= |P2Thread1of1ForFork0_#t~ite20_Out-364140551| |P2Thread1of1ForFork0_#t~ite21_Out-364140551|) (let ((.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-364140551 256)))) (or (and (= 0 (mod ~a$r_buff1_thd3~0_In-364140551 256)) .cse1) (and .cse1 (= (mod ~a$w_buff1_used~0_In-364140551 256) 0)) (= 0 (mod ~a$w_buff0_used~0_In-364140551 256)))) (= |P2Thread1of1ForFork0_#t~ite20_Out-364140551| ~a$w_buff0~0_In-364140551)) (and (= |P2Thread1of1ForFork0_#t~ite20_In-364140551| |P2Thread1of1ForFork0_#t~ite20_Out-364140551|) (= |P2Thread1of1ForFork0_#t~ite21_Out-364140551| ~a$w_buff0~0_In-364140551) (not .cse0)))) InVars {~a$w_buff0~0=~a$w_buff0~0_In-364140551, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-364140551, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-364140551, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-364140551, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-364140551, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_In-364140551|, ~weak$$choice2~0=~weak$$choice2~0_In-364140551} OutVars{P2Thread1of1ForFork0_#t~ite21=|P2Thread1of1ForFork0_#t~ite21_Out-364140551|, ~a$w_buff0~0=~a$w_buff0~0_In-364140551, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-364140551, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-364140551, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-364140551, P2Thread1of1ForFork0_#t~ite20=|P2Thread1of1ForFork0_#t~ite20_Out-364140551|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-364140551, ~weak$$choice2~0=~weak$$choice2~0_In-364140551} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite21, P2Thread1of1ForFork0_#t~ite20] because there is no mapped edge [2019-12-27 17:04:44,745 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L771-->L771-2: Formula: (let ((.cse1 (= 0 (mod ~a$r_buff0_thd2~0_In1296050919 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In1296050919 256) 0))) (or (and (= ~a$r_buff0_thd2~0_In1296050919 |P1Thread1of1ForFork2_#t~ite13_Out1296050919|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P1Thread1of1ForFork2_#t~ite13_Out1296050919| 0)))) InVars {~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1296050919, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1296050919} OutVars{~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In1296050919, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1296050919, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1296050919|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-27 17:04:44,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [838] [838] L772-->L772-2: Formula: (let ((.cse2 (= 0 (mod ~a$r_buff0_thd2~0_In-1279991306 256))) (.cse3 (= (mod ~a$w_buff0_used~0_In-1279991306 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd2~0_In-1279991306 256))) (.cse1 (= 0 (mod ~a$w_buff1_used~0_In-1279991306 256)))) (or (and (= 0 |P1Thread1of1ForFork2_#t~ite14_Out-1279991306|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$r_buff1_thd2~0_In-1279991306 |P1Thread1of1ForFork2_#t~ite14_Out-1279991306|) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1279991306, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1279991306, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1279991306, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1279991306} OutVars{~a$r_buff1_thd2~0=~a$r_buff1_thd2~0_In-1279991306, ~a$r_buff0_thd2~0=~a$r_buff0_thd2~0_In-1279991306, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1279991306, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1279991306, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out-1279991306|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 17:04:44,746 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L772-2-->P1EXIT: Formula: (and (= |v_P1Thread1of1ForFork2_#t~ite14_50| v_~a$r_buff1_thd2~0_119) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_84 1) v_~__unbuffered_cnt~0_83) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_84, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_50|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_119, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_49|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~a$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-27 17:04:44,747 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L797-->L797-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-552891993 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite23_In-552891993| |P2Thread1of1ForFork0_#t~ite23_Out-552891993|) (not .cse0) (= ~a$w_buff1~0_In-552891993 |P2Thread1of1ForFork0_#t~ite24_Out-552891993|)) (and (let ((.cse1 (= (mod ~a$r_buff0_thd3~0_In-552891993 256) 0))) (or (and .cse1 (= (mod ~a$r_buff1_thd3~0_In-552891993 256) 0)) (and (= 0 (mod ~a$w_buff1_used~0_In-552891993 256)) .cse1) (= 0 (mod ~a$w_buff0_used~0_In-552891993 256)))) (= |P2Thread1of1ForFork0_#t~ite24_Out-552891993| |P2Thread1of1ForFork0_#t~ite23_Out-552891993|) .cse0 (= ~a$w_buff1~0_In-552891993 |P2Thread1of1ForFork0_#t~ite23_Out-552891993|)))) InVars {~a$w_buff1~0=~a$w_buff1~0_In-552891993, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_In-552891993|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-552891993, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-552891993, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-552891993, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-552891993, ~weak$$choice2~0=~weak$$choice2~0_In-552891993} OutVars{~a$w_buff1~0=~a$w_buff1~0_In-552891993, P2Thread1of1ForFork0_#t~ite23=|P2Thread1of1ForFork0_#t~ite23_Out-552891993|, P2Thread1of1ForFork0_#t~ite24=|P2Thread1of1ForFork0_#t~ite24_Out-552891993|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-552891993, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-552891993, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-552891993, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-552891993, ~weak$$choice2~0=~weak$$choice2~0_In-552891993} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite23, P2Thread1of1ForFork0_#t~ite24] because there is no mapped edge [2019-12-27 17:04:44,748 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [878] [878] L798-->L798-8: Formula: (let ((.cse1 (= 0 (mod ~weak$$choice2~0_In-1042847082 256)))) (or (and (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In-1042847082 256)))) (or (and (= (mod ~a$r_buff1_thd3~0_In-1042847082 256) 0) .cse0) (and .cse0 (= (mod ~a$w_buff1_used~0_In-1042847082 256) 0)) (= (mod ~a$w_buff0_used~0_In-1042847082 256) 0))) (= |P2Thread1of1ForFork0_#t~ite26_Out-1042847082| ~a$w_buff0_used~0_In-1042847082) .cse1 (= |P2Thread1of1ForFork0_#t~ite26_Out-1042847082| |P2Thread1of1ForFork0_#t~ite27_Out-1042847082|)) (and (= ~a$w_buff0_used~0_In-1042847082 |P2Thread1of1ForFork0_#t~ite27_Out-1042847082|) (= |P2Thread1of1ForFork0_#t~ite26_In-1042847082| |P2Thread1of1ForFork0_#t~ite26_Out-1042847082|) (not .cse1)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1042847082|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1042847082, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1042847082, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1042847082, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1042847082, ~weak$$choice2~0=~weak$$choice2~0_In-1042847082} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1042847082|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1042847082|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-1042847082, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1042847082, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-1042847082, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1042847082, ~weak$$choice2~0=~weak$$choice2~0_In-1042847082} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-27 17:04:44,751 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L800-->L801: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_16 256))) (= v_~a$r_buff0_thd3~0_71 v_~a$r_buff0_thd3~0_70)) InVars {~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_71, ~weak$$choice2~0=v_~weak$$choice2~0_16} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~a$r_buff0_thd3~0=v_~a$r_buff0_thd3~0_70, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_16} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~a$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 17:04:44,754 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L803-->L807: Formula: (and (not (= 0 (mod v_~a$flush_delayed~0_8 256))) (= v_~a$flush_delayed~0_7 0) (= v_~a~0_39 v_~a$mem_tmp~0_5)) InVars {~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~a~0=v_~a~0_39, ~a$mem_tmp~0=v_~a$mem_tmp~0_5, ~a$flush_delayed~0=v_~a$flush_delayed~0_7} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~a~0, ~a$flush_delayed~0] because there is no mapped edge [2019-12-27 17:04:44,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [820] [820] L807-2-->L807-4: Formula: (let ((.cse0 (= (mod ~a$r_buff1_thd3~0_In2048043352 256) 0)) (.cse1 (= (mod ~a$w_buff1_used~0_In2048043352 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite38_Out2048043352| ~a~0_In2048043352)) (and (not .cse0) (= |P2Thread1of1ForFork0_#t~ite38_Out2048043352| ~a$w_buff1~0_In2048043352) (not .cse1)))) InVars {~a~0=~a~0_In2048043352, ~a$w_buff1~0=~a$w_buff1~0_In2048043352, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2048043352, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2048043352} OutVars{~a~0=~a~0_In2048043352, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out2048043352|, ~a$w_buff1~0=~a$w_buff1~0_In2048043352, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2048043352, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2048043352} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 17:04:44,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L807-4-->L808: Formula: (= v_~a~0_19 |v_P2Thread1of1ForFork0_#t~ite38_12|) InVars {P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_12|} OutVars{~a~0=v_~a~0_19, P2Thread1of1ForFork0_#t~ite39=|v_P2Thread1of1ForFork0_#t~ite39_7|, P2Thread1of1ForFork0_#t~ite38=|v_P2Thread1of1ForFork0_#t~ite38_11|} AuxVars[] AssignedVars[~a~0, P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-27 17:04:44,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L808-->L808-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In-133049075 256))) (.cse0 (= (mod ~a$r_buff0_thd3~0_In-133049075 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-133049075|) (not .cse1)) (and (or .cse1 .cse0) (= ~a$w_buff0_used~0_In-133049075 |P2Thread1of1ForFork0_#t~ite40_Out-133049075|)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-133049075, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-133049075} OutVars{P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-133049075|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-133049075, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-133049075} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-27 17:04:44,756 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L749-->L749-2: Formula: (let ((.cse1 (= (mod ~a$w_buff0_used~0_In-1548015825 256) 0)) (.cse0 (= (mod ~a$r_buff0_thd1~0_In-1548015825 256) 0))) (or (and (= ~a$w_buff0_used~0_In-1548015825 |P0Thread1of1ForFork1_#t~ite5_Out-1548015825|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |P0Thread1of1ForFork1_#t~ite5_Out-1548015825| 0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-1548015825, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1548015825} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-1548015825|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1548015825, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1548015825} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-27 17:04:44,757 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [829] [829] L750-->L750-2: Formula: (let ((.cse2 (= 0 (mod ~a$w_buff0_used~0_In-1710124203 256))) (.cse3 (= 0 (mod ~a$r_buff0_thd1~0_In-1710124203 256))) (.cse1 (= (mod ~a$r_buff1_thd1~0_In-1710124203 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-1710124203 256) 0))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite6_Out-1710124203| ~a$w_buff1_used~0_In-1710124203) (or .cse2 .cse3)) (and (= 0 |P0Thread1of1ForFork1_#t~ite6_Out-1710124203|) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1710124203, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1710124203, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1710124203, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1710124203} OutVars{P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out-1710124203|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-1710124203, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-1710124203, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-1710124203, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-1710124203} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-27 17:04:44,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L751-->L752: Formula: (let ((.cse0 (= (mod ~a$r_buff0_thd1~0_In-518996439 256) 0)) (.cse1 (= (mod ~a$w_buff0_used~0_In-518996439 256) 0))) (or (and (not .cse0) (= 0 ~a$r_buff0_thd1~0_Out-518996439) (not .cse1)) (and (or .cse0 .cse1) (= ~a$r_buff0_thd1~0_In-518996439 ~a$r_buff0_thd1~0_Out-518996439)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-518996439, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-518996439} OutVars{P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out-518996439|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-518996439, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_Out-518996439} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~a$r_buff0_thd1~0] because there is no mapped edge [2019-12-27 17:04:44,758 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L752-->L752-2: Formula: (let ((.cse2 (= (mod ~a$r_buff0_thd1~0_In-763918699 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-763918699 256))) (.cse1 (= 0 (mod ~a$r_buff1_thd1~0_In-763918699 256))) (.cse0 (= 0 (mod ~a$w_buff1_used~0_In-763918699 256)))) (or (and (or .cse0 .cse1) (= |P0Thread1of1ForFork1_#t~ite8_Out-763918699| ~a$r_buff1_thd1~0_In-763918699) (or .cse2 .cse3)) (and (= |P0Thread1of1ForFork1_#t~ite8_Out-763918699| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse1) (not .cse0)))))) InVars {~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-763918699, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-763918699, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-763918699, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-763918699} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out-763918699|, ~a$r_buff1_thd1~0=~a$r_buff1_thd1~0_In-763918699, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-763918699, ~a$r_buff0_thd1~0=~a$r_buff0_thd1~0_In-763918699, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-763918699} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-27 17:04:44,759 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [867] [867] L752-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= v_~a$r_buff1_thd1~0_67 |v_P0Thread1of1ForFork1_#t~ite8_28|) (= (+ v_~__unbuffered_cnt~0_48 1) v_~__unbuffered_cnt~0_47) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_27|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~a$r_buff1_thd1~0=v_~a$r_buff1_thd1~0_67, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_47} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~a$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-27 17:04:44,760 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L809-->L809-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In-442458 256))) (.cse2 (= (mod ~a$w_buff1_used~0_In-442458 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd3~0_In-442458 256))) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In-442458 256)))) (or (and (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-442458|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~a$w_buff1_used~0_In-442458 |P2Thread1of1ForFork0_#t~ite41_Out-442458|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-442458, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-442458, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-442458, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-442458} OutVars{~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In-442458, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-442458, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-442458, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-442458, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-442458|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-27 17:04:44,761 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [832] [832] L810-->L810-2: Formula: (let ((.cse0 (= (mod ~a$w_buff0_used~0_In-46144599 256) 0)) (.cse1 (= (mod ~a$r_buff0_thd3~0_In-46144599 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork0_#t~ite42_Out-46144599|)) (and (= ~a$r_buff0_thd3~0_In-46144599 |P2Thread1of1ForFork0_#t~ite42_Out-46144599|) (or .cse0 .cse1)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In-46144599, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-46144599} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In-46144599, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In-46144599, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-46144599|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-27 17:04:44,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [844] [844] L811-->L811-2: Formula: (let ((.cse0 (= 0 (mod ~a$r_buff0_thd3~0_In2062263137 256))) (.cse1 (= 0 (mod ~a$w_buff0_used~0_In2062263137 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In2062263137 256))) (.cse3 (= 0 (mod ~a$r_buff1_thd3~0_In2062263137 256)))) (or (and (= ~a$r_buff1_thd3~0_In2062263137 |P2Thread1of1ForFork0_#t~ite43_Out2062263137|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P2Thread1of1ForFork0_#t~ite43_Out2062263137|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2062263137, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2062263137, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2062263137, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2062263137} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out2062263137|, ~a$r_buff1_thd3~0=~a$r_buff1_thd3~0_In2062263137, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2062263137, ~a$r_buff0_thd3~0=~a$r_buff0_thd3~0_In2062263137, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2062263137} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-27 17:04:44,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [850] [850] L811-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_38 1) v_~__unbuffered_cnt~0_37) (= |v_P2Thread1of1ForFork0_#res.base_5| 0) (= v_~a$r_buff1_thd3~0_120 |v_P2Thread1of1ForFork0_#t~ite43_30|)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_38} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~a$r_buff1_thd3~0=v_~a$r_buff1_thd3~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_37, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~a$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-27 17:04:44,762 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L834-1-->L840: Formula: (and (= 3 v_~__unbuffered_cnt~0_24) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_24, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 17:04:44,764 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L840-2-->L840-5: Formula: (let ((.cse2 (= (mod ~a$r_buff1_thd0~0_In-411901626 256) 0)) (.cse0 (= (mod ~a$w_buff1_used~0_In-411901626 256) 0)) (.cse1 (= |ULTIMATE.start_main_#t~ite48_Out-411901626| |ULTIMATE.start_main_#t~ite47_Out-411901626|))) (or (and (not .cse0) (= ~a$w_buff1~0_In-411901626 |ULTIMATE.start_main_#t~ite47_Out-411901626|) .cse1 (not .cse2)) (and (= ~a~0_In-411901626 |ULTIMATE.start_main_#t~ite47_Out-411901626|) (or .cse2 .cse0) .cse1))) InVars {~a~0=~a~0_In-411901626, ~a$w_buff1~0=~a$w_buff1~0_In-411901626, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-411901626, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-411901626} OutVars{~a~0=~a~0_In-411901626, ~a$w_buff1~0=~a$w_buff1~0_In-411901626, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-411901626|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-411901626, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-411901626|, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-411901626} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-27 17:04:44,765 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [831] [831] L841-->L841-2: Formula: (let ((.cse1 (= 0 (mod ~a$w_buff0_used~0_In1108686907 256))) (.cse0 (= 0 (mod ~a$r_buff0_thd0~0_In1108686907 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite49_Out1108686907|)) (and (= |ULTIMATE.start_main_#t~ite49_Out1108686907| ~a$w_buff0_used~0_In1108686907) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1108686907, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1108686907} OutVars{~a$w_buff0_used~0=~a$w_buff0_used~0_In1108686907, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out1108686907|, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1108686907} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-27 17:04:44,766 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [835] [835] L842-->L842-2: Formula: (let ((.cse3 (= 0 (mod ~a$r_buff1_thd0~0_In2141346002 256))) (.cse2 (= 0 (mod ~a$w_buff1_used~0_In2141346002 256))) (.cse0 (= (mod ~a$w_buff0_used~0_In2141346002 256) 0)) (.cse1 (= 0 (mod ~a$r_buff0_thd0~0_In2141346002 256)))) (or (and (= |ULTIMATE.start_main_#t~ite50_Out2141346002| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse3 .cse2) (= ~a$w_buff1_used~0_In2141346002 |ULTIMATE.start_main_#t~ite50_Out2141346002|) (or .cse0 .cse1)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2141346002, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2141346002, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2141346002, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2141346002} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out2141346002|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In2141346002, ~a$w_buff0_used~0=~a$w_buff0_used~0_In2141346002, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In2141346002, ~a$w_buff1_used~0=~a$w_buff1_used~0_In2141346002} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-27 17:04:44,767 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L843-->L843-2: Formula: (let ((.cse1 (= (mod ~a$r_buff0_thd0~0_In1455688333 256) 0)) (.cse0 (= 0 (mod ~a$w_buff0_used~0_In1455688333 256)))) (or (and (not .cse0) (not .cse1) (= 0 |ULTIMATE.start_main_#t~ite51_Out1455688333|)) (and (= ~a$r_buff0_thd0~0_In1455688333 |ULTIMATE.start_main_#t~ite51_Out1455688333|) (or .cse1 .cse0)))) InVars {~a$w_buff0_used~0=~a$w_buff0_used~0_In1455688333, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1455688333} OutVars{ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1455688333|, ~a$w_buff0_used~0=~a$w_buff0_used~0_In1455688333, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In1455688333} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-27 17:04:44,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L844-->L844-2: Formula: (let ((.cse1 (= (mod ~a$w_buff1_used~0_In-2060771251 256) 0)) (.cse0 (= 0 (mod ~a$r_buff1_thd0~0_In-2060771251 256))) (.cse2 (= (mod ~a$r_buff0_thd0~0_In-2060771251 256) 0)) (.cse3 (= 0 (mod ~a$w_buff0_used~0_In-2060771251 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite52_Out-2060771251|)) (and (or .cse1 .cse0) (= ~a$r_buff1_thd0~0_In-2060771251 |ULTIMATE.start_main_#t~ite52_Out-2060771251|) (or .cse2 .cse3)))) InVars {~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2060771251, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2060771251, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2060771251, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2060771251} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out-2060771251|, ~a$r_buff1_thd0~0=~a$r_buff1_thd0~0_In-2060771251, ~a$w_buff0_used~0=~a$w_buff0_used~0_In-2060771251, ~a$r_buff0_thd0~0=~a$r_buff0_thd0~0_In-2060771251, ~a$w_buff1_used~0=~a$w_buff1_used~0_In-2060771251} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-27 17:04:44,768 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [887] [887] L844-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= (mod v_~main$tmp_guard1~0_19 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~a$r_buff1_thd0~0_109 |v_ULTIMATE.start_main_#t~ite52_38|) (= 0 v_~__unbuffered_p0_EAX~0_66) (= v_~main$tmp_guard1~0_19 0) (= v_~__unbuffered_p2_EBX~0_30 0) (= v_~y~0_31 2) (= 1 v_~__unbuffered_p2_EAX~0_23)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_38|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y~0=v_~y~0_31} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_66, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_37|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_30, ~a$r_buff1_thd0~0=v_~a$r_buff1_thd0~0_109, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_19, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_23, ~y~0=v_~y~0_31, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ULTIMATE.start___VERIFIER_assert_~expression, ~a$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 17:04:44,858 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 05:04:44 BasicIcfg [2019-12-27 17:04:44,860 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 17:04:44,861 INFO L168 Benchmark]: Toolchain (without parser) took 119023.70 ms. Allocated memory was 138.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 100.2 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.7 GB. Max. memory is 7.1 GB. [2019-12-27 17:04:44,862 INFO L168 Benchmark]: CDTParser took 0.20 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-27 17:04:44,862 INFO L168 Benchmark]: CACSL2BoogieTranslator took 800.50 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.0 MB in the beginning and 154.5 MB in the end (delta: -54.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. [2019-12-27 17:04:44,863 INFO L168 Benchmark]: Boogie Procedure Inliner took 65.31 ms. Allocated memory is still 202.4 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 17:04:44,863 INFO L168 Benchmark]: Boogie Preprocessor took 66.68 ms. Allocated memory is still 202.4 MB. Free memory was 151.8 MB in the beginning and 149.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 17:04:44,865 INFO L168 Benchmark]: RCFGBuilder took 802.91 ms. Allocated memory is still 202.4 MB. Free memory was 149.8 MB in the beginning and 99.1 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. [2019-12-27 17:04:44,866 INFO L168 Benchmark]: TraceAbstraction took 117276.93 ms. Allocated memory was 202.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 98.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. [2019-12-27 17:04:44,869 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.20 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 800.50 ms. Allocated memory was 138.4 MB in the beginning and 202.4 MB in the end (delta: 64.0 MB). Free memory was 100.0 MB in the beginning and 154.5 MB in the end (delta: -54.5 MB). Peak memory consumption was 24.6 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 65.31 ms. Allocated memory is still 202.4 MB. Free memory was 154.5 MB in the beginning and 151.8 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 66.68 ms. Allocated memory is still 202.4 MB. Free memory was 151.8 MB in the beginning and 149.8 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 802.91 ms. Allocated memory is still 202.4 MB. Free memory was 149.8 MB in the beginning and 99.1 MB in the end (delta: 50.7 MB). Peak memory consumption was 50.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 117276.93 ms. Allocated memory was 202.4 MB in the beginning and 3.2 GB in the end (delta: 3.0 GB). Free memory was 98.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.6 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 177 ProgramPointsBefore, 92 ProgramPointsAfterwards, 214 TransitionsBefore, 100 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 8 FixpointIterations, 34 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 33 ChoiceCompositions, 7302 VarBasedMoverChecksPositive, 250 VarBasedMoverChecksNegative, 40 SemBasedMoverChecksPositive, 286 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.7s, 0 MoverChecksTotal, 87212 CheckedPairsTotal, 116 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L830] FCALL, FORK 0 pthread_create(&t1117, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L733] 1 a$w_buff1 = a$w_buff0 [L734] 1 a$w_buff0 = 1 [L735] 1 a$w_buff1_used = a$w_buff0_used [L736] 1 a$w_buff0_used = (_Bool)1 [L832] FCALL, FORK 0 pthread_create(&t1118, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L762] 2 x = 1 [L765] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L768] EXPR 2 a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L768] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L834] FCALL, FORK 0 pthread_create(&t1119, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=0] [L782] 3 y = 2 [L785] 3 z = 1 [L788] 3 __unbuffered_p2_EAX = z [L791] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L792] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L793] 3 a$flush_delayed = weak$$choice2 [L794] 3 a$mem_tmp = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L795] EXPR 3 !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) VAL [!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L795] 3 a = !a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff1) [L769] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L796] 3 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : a$w_buff0)) [L770] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L771] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L748] EXPR 1 a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L797] 3 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff1 : a$w_buff1)) [L798] 3 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used)) [L799] EXPR 3 weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=1] [L799] 3 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L801] EXPR 3 weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=2, z=1] [L801] 3 a$r_buff1_thd3 = weak$$choice2 ? a$r_buff1_thd3 : (!a$w_buff0_used || !a$r_buff0_thd3 && !a$w_buff1_used || !a$r_buff0_thd3 && !a$r_buff1_thd3 ? a$r_buff1_thd3 : (a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L802] 3 __unbuffered_p2_EBX = a VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=1, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L748] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L807] 3 a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L749] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L750] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L808] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L809] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L810] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L840] EXPR 0 a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=0, a=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=8, weak$$choice2=1, x=1, y=2, z=1] [L840] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L841] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L842] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L843] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 168 locations, 2 error locations. Result: UNSAFE, OverallTime: 116.9s, OverallIterations: 31, TraceHistogramMax: 1, AutomataDifference: 51.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 7694 SDtfs, 12696 SDslu, 21347 SDs, 0 SdLazy, 19522 SolverSat, 832 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 20.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 667 GetRequests, 210 SyntacticMatches, 39 SemanticMatches, 418 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4143 ImplicationChecksByTransitivity, 8.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=137801occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 35.7s AutomataMinimizationTime, 30 MinimizatonAttempts, 600129 StatesRemovedByMinimization, 27 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 2.1s InterpolantComputationTime, 1355 NumberOfCodeBlocks, 1355 NumberOfCodeBlocksAsserted, 31 NumberOfCheckSat, 1258 ConstructedInterpolants, 0 QuantifiedInterpolants, 216767 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 30 InterpolantComputations, 30 PerfectInterpolantSequences, 0/0 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...