/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/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf -i ../../../trunk/examples/svcomp/pthread-wmm/podwr001_power.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 23:06:46,398 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 23:06:46,401 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 23:06:46,413 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 23:06:46,413 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 23:06:46,415 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 23:06:46,416 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 23:06:46,418 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 23:06:46,419 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 23:06:46,420 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 23:06:46,421 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 23:06:46,422 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 23:06:46,422 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 23:06:46,423 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 23:06:46,424 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 23:06:46,426 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 23:06:46,426 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 23:06:46,427 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 23:06:46,429 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 23:06:46,431 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 23:06:46,432 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 23:06:46,433 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 23:06:46,435 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 23:06:46,435 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 23:06:46,438 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 23:06:46,438 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 23:06:46,438 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 23:06:46,439 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 23:06:46,440 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 23:06:46,440 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 23:06:46,441 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 23:06:46,441 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 23:06:46,442 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 23:06:46,443 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 23:06:46,444 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 23:06:46,444 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 23:06:46,445 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 23:06:46,445 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 23:06:46,445 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 23:06:46,446 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 23:06:46,447 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 23:06:46,447 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 23:06:46,466 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 23:06:46,467 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 23:06:46,469 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 23:06:46,469 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 23:06:46,469 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 23:06:46,470 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 23:06:46,470 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 23:06:46,470 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 23:06:46,470 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 23:06:46,470 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 23:06:46,471 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 23:06:46,472 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 23:06:46,472 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 23:06:46,472 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 23:06:46,473 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 23:06:46,473 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 23:06:46,473 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 23:06:46,473 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 23:06:46,473 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 23:06:46,474 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 23:06:46,474 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 23:06:46,474 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 23:06:46,474 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 23:06:46,475 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 23:06:46,475 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 23:06:46,475 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 23:06:46,475 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 23:06:46,475 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 23:06:46,476 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 23:06:46,476 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 23:06:46,797 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 23:06:46,810 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 23:06:46,814 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 23:06:46,815 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 23:06:46,816 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 23:06:46,816 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/podwr001_power.oepc.i [2019-12-26 23:06:46,877 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfa2c8e59/d81a599424a54329baec5bf33aa0b995/FLAGaddb3ac75 [2019-12-26 23:06:47,354 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 23:06:47,355 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/podwr001_power.oepc.i [2019-12-26 23:06:47,394 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfa2c8e59/d81a599424a54329baec5bf33aa0b995/FLAGaddb3ac75 [2019-12-26 23:06:47,711 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/dfa2c8e59/d81a599424a54329baec5bf33aa0b995 [2019-12-26 23:06:47,722 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 23:06:47,724 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 23:06:47,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 23:06:47,726 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 23:06:47,729 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 23:06:47,730 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:06:47" (1/1) ... [2019-12-26 23:06:47,733 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@45b1d233 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:47, skipping insertion in model container [2019-12-26 23:06:47,734 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 11:06:47" (1/1) ... [2019-12-26 23:06:47,742 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 23:06:47,794 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 23:06:48,451 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:06:48,464 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 23:06:48,533 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 23:06:48,644 INFO L208 MainTranslator]: Completed translation [2019-12-26 23:06:48,645 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:48 WrapperNode [2019-12-26 23:06:48,645 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 23:06:48,646 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 23:06:48,646 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 23:06:48,646 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 23:06:48,655 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:48" (1/1) ... [2019-12-26 23:06:48,703 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:48" (1/1) ... [2019-12-26 23:06:48,749 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 23:06:48,749 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 23:06:48,750 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 23:06:48,750 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 23:06:48,760 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:48" (1/1) ... [2019-12-26 23:06:48,761 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:48" (1/1) ... [2019-12-26 23:06:48,781 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:48" (1/1) ... [2019-12-26 23:06:48,782 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:48" (1/1) ... [2019-12-26 23:06:48,804 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:48" (1/1) ... [2019-12-26 23:06:48,813 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:48" (1/1) ... [2019-12-26 23:06:48,816 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:48" (1/1) ... [2019-12-26 23:06:48,823 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 23:06:48,830 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 23:06:48,830 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 23:06:48,830 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 23:06:48,831 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:48" (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-26 23:06:48,905 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 23:06:48,905 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 23:06:48,906 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 23:06:48,906 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 23:06:48,907 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 23:06:48,907 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 23:06:48,907 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 23:06:48,908 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 23:06:48,909 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 23:06:48,909 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 23:06:48,910 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 23:06:48,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 23:06:48,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 23:06:48,912 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 23:06:49,707 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 23:06:49,708 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 23:06:49,709 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:06:49 BoogieIcfgContainer [2019-12-26 23:06:49,710 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 23:06:49,711 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 23:06:49,711 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 23:06:49,714 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 23:06:49,714 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 11:06:47" (1/3) ... [2019-12-26 23:06:49,716 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd47522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:06:49, skipping insertion in model container [2019-12-26 23:06:49,716 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 11:06:48" (2/3) ... [2019-12-26 23:06:49,717 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7cd47522 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 11:06:49, skipping insertion in model container [2019-12-26 23:06:49,717 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 11:06:49" (3/3) ... [2019-12-26 23:06:49,719 INFO L109 eAbstractionObserver]: Analyzing ICFG podwr001_power.oepc.i [2019-12-26 23:06:49,727 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 23:06:49,728 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 23:06:49,734 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 23:06:49,735 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 23:06:49,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,776 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,776 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,776 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,777 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,777 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,777 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,778 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,778 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,779 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,780 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,781 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,782 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,783 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,784 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,785 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,785 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,786 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,786 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,787 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,788 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,789 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,790 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,791 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,792 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,793 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,794 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,794 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,794 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,795 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,796 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,797 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,798 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,799 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,800 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,801 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,802 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,803 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,804 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,822 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,823 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,824 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,825 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,826 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,827 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,828 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,829 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,830 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,831 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,832 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,833 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,834 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,835 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,836 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,837 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite40| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,840 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite42| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite41| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,841 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,841 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,842 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite43| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,843 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,844 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~nondet16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,844 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite39| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite38| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,845 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,846 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork0_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,849 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,850 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,851 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,851 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,851 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,852 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,853 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,854 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,854 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,855 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 23:06:49,870 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-26 23:06:49,889 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 23:06:49,890 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 23:06:49,890 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 23:06:49,890 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 23:06:49,890 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 23:06:49,890 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 23:06:49,890 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 23:06:49,891 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 23:06:49,908 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 176 places, 213 transitions [2019-12-26 23:06:49,910 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-26 23:06:50,019 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-26 23:06:50,019 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:06:50,036 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:06:50,065 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 176 places, 213 transitions [2019-12-26 23:06:50,122 INFO L132 PetriNetUnfolder]: 47/210 cut-off events. [2019-12-26 23:06:50,122 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 23:06:50,130 INFO L76 FinitePrefix]: Finished finitePrefix Result has 220 conditions, 210 events. 47/210 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 427 event pairs. 0/161 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-26 23:06:50,153 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 19004 [2019-12-26 23:06:50,155 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 23:06:55,397 WARN L192 SmtUtils]: Spent 277.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-26 23:06:55,525 WARN L192 SmtUtils]: Spent 125.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-26 23:06:55,952 INFO L206 etLargeBlockEncoding]: Checked pairs total: 130045 [2019-12-26 23:06:55,952 INFO L214 etLargeBlockEncoding]: Total number of compositions: 121 [2019-12-26 23:06:55,956 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 95 places, 107 transitions [2019-12-26 23:07:19,900 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 126452 states. [2019-12-26 23:07:19,902 INFO L276 IsEmpty]: Start isEmpty. Operand 126452 states. [2019-12-26 23:07:19,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-26 23:07:19,908 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:07:19,909 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-26 23:07:19,909 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-26 23:07:19,913 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:07:19,914 INFO L82 PathProgramCache]: Analyzing trace with hash 913925, now seen corresponding path program 1 times [2019-12-26 23:07:19,921 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:07:19,922 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [843970459] [2019-12-26 23:07:19,922 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:07:20,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:07:20,154 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-26 23:07:20,154 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [843970459] [2019-12-26 23:07:20,155 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:07:20,155 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 23:07:20,156 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [606270315] [2019-12-26 23:07:20,160 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:07:20,160 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:07:20,170 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:07:20,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:07:20,173 INFO L87 Difference]: Start difference. First operand 126452 states. Second operand 3 states. [2019-12-26 23:07:23,926 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:07:23,926 INFO L93 Difference]: Finished difference Result 125570 states and 538788 transitions. [2019-12-26 23:07:23,927 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:07:23,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-26 23:07:23,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:07:24,598 INFO L225 Difference]: With dead ends: 125570 [2019-12-26 23:07:24,598 INFO L226 Difference]: Without dead ends: 111010 [2019-12-26 23:07:24,600 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-26 23:07:29,630 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111010 states. [2019-12-26 23:07:34,779 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111010 to 111010. [2019-12-26 23:07:34,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111010 states. [2019-12-26 23:07:35,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111010 states to 111010 states and 475060 transitions. [2019-12-26 23:07:35,277 INFO L78 Accepts]: Start accepts. Automaton has 111010 states and 475060 transitions. Word has length 3 [2019-12-26 23:07:35,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:07:35,277 INFO L462 AbstractCegarLoop]: Abstraction has 111010 states and 475060 transitions. [2019-12-26 23:07:35,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:07:35,277 INFO L276 IsEmpty]: Start isEmpty. Operand 111010 states and 475060 transitions. [2019-12-26 23:07:35,281 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-26 23:07:35,282 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:07:35,282 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:07:35,282 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-26 23:07:35,283 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:07:35,283 INFO L82 PathProgramCache]: Analyzing trace with hash -1753094800, now seen corresponding path program 1 times [2019-12-26 23:07:35,283 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:07:35,283 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [841860227] [2019-12-26 23:07:35,284 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:07:35,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:07:35,403 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-26 23:07:35,404 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [841860227] [2019-12-26 23:07:35,404 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:07:35,404 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:07:35,405 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455891045] [2019-12-26 23:07:35,406 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:07:35,407 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:07:35,407 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:07:35,407 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:07:35,408 INFO L87 Difference]: Start difference. First operand 111010 states and 475060 transitions. Second operand 4 states. [2019-12-26 23:07:41,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:07:41,918 INFO L93 Difference]: Finished difference Result 172646 states and 710109 transitions. [2019-12-26 23:07:41,918 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:07:41,918 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-26 23:07:41,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:07:42,577 INFO L225 Difference]: With dead ends: 172646 [2019-12-26 23:07:42,577 INFO L226 Difference]: Without dead ends: 172548 [2019-12-26 23:07:42,578 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-26 23:07:48,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172548 states. [2019-12-26 23:07:52,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172548 to 158936. [2019-12-26 23:07:52,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 158936 states. [2019-12-26 23:07:52,710 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158936 states to 158936 states and 661803 transitions. [2019-12-26 23:07:52,711 INFO L78 Accepts]: Start accepts. Automaton has 158936 states and 661803 transitions. Word has length 11 [2019-12-26 23:07:52,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:07:52,711 INFO L462 AbstractCegarLoop]: Abstraction has 158936 states and 661803 transitions. [2019-12-26 23:07:52,711 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:07:52,711 INFO L276 IsEmpty]: Start isEmpty. Operand 158936 states and 661803 transitions. [2019-12-26 23:07:52,717 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-26 23:07:52,717 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:07:52,717 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:07:52,717 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-26 23:07:52,718 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:07:52,718 INFO L82 PathProgramCache]: Analyzing trace with hash 216434073, now seen corresponding path program 1 times [2019-12-26 23:07:52,718 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:07:52,718 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1601358151] [2019-12-26 23:07:52,718 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:07:52,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:07:52,764 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-26 23:07:52,765 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1601358151] [2019-12-26 23:07:52,765 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:07:52,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:07:52,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [554584497] [2019-12-26 23:07:52,766 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:07:52,766 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:07:52,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:07:52,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:07:52,767 INFO L87 Difference]: Start difference. First operand 158936 states and 661803 transitions. Second operand 3 states. [2019-12-26 23:07:52,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:07:52,901 INFO L93 Difference]: Finished difference Result 34208 states and 111904 transitions. [2019-12-26 23:07:52,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:07:52,902 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-26 23:07:52,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:07:52,960 INFO L225 Difference]: With dead ends: 34208 [2019-12-26 23:07:52,961 INFO L226 Difference]: Without dead ends: 34208 [2019-12-26 23:07:52,961 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-26 23:07:53,189 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34208 states. [2019-12-26 23:07:53,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34208 to 34208. [2019-12-26 23:07:53,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34208 states. [2019-12-26 23:07:53,836 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34208 states to 34208 states and 111904 transitions. [2019-12-26 23:07:53,836 INFO L78 Accepts]: Start accepts. Automaton has 34208 states and 111904 transitions. Word has length 13 [2019-12-26 23:07:53,837 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:07:53,837 INFO L462 AbstractCegarLoop]: Abstraction has 34208 states and 111904 transitions. [2019-12-26 23:07:53,837 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:07:53,837 INFO L276 IsEmpty]: Start isEmpty. Operand 34208 states and 111904 transitions. [2019-12-26 23:07:53,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 23:07:53,840 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:07:53,840 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:07:53,841 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-26 23:07:53,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:07:53,841 INFO L82 PathProgramCache]: Analyzing trace with hash -1948590504, now seen corresponding path program 1 times [2019-12-26 23:07:53,841 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:07:53,841 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [278014855] [2019-12-26 23:07:53,842 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:07:53,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:07:53,912 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-26 23:07:53,913 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [278014855] [2019-12-26 23:07:53,913 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:07:53,913 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:07:53,913 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1049715455] [2019-12-26 23:07:53,914 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:07:53,914 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:07:53,914 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:07:53,914 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:07:53,914 INFO L87 Difference]: Start difference. First operand 34208 states and 111904 transitions. Second operand 3 states. [2019-12-26 23:07:54,218 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:07:54,218 INFO L93 Difference]: Finished difference Result 51809 states and 168645 transitions. [2019-12-26 23:07:54,219 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:07:54,219 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 16 [2019-12-26 23:07:54,219 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:07:54,344 INFO L225 Difference]: With dead ends: 51809 [2019-12-26 23:07:54,344 INFO L226 Difference]: Without dead ends: 51809 [2019-12-26 23:07:54,345 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-26 23:07:54,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51809 states. [2019-12-26 23:07:55,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51809 to 38969. [2019-12-26 23:07:55,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 38969 states. [2019-12-26 23:07:55,622 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38969 states to 38969 states and 128499 transitions. [2019-12-26 23:07:55,622 INFO L78 Accepts]: Start accepts. Automaton has 38969 states and 128499 transitions. Word has length 16 [2019-12-26 23:07:55,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:07:55,623 INFO L462 AbstractCegarLoop]: Abstraction has 38969 states and 128499 transitions. [2019-12-26 23:07:55,623 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:07:55,623 INFO L276 IsEmpty]: Start isEmpty. Operand 38969 states and 128499 transitions. [2019-12-26 23:07:55,626 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2019-12-26 23:07:55,627 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:07:55,627 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 23:07:55,627 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-26 23:07:55,627 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:07:55,627 INFO L82 PathProgramCache]: Analyzing trace with hash -1821591471, now seen corresponding path program 1 times [2019-12-26 23:07:55,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:07:55,628 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28083285] [2019-12-26 23:07:55,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:07:55,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:07:55,736 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-26 23:07:55,737 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28083285] [2019-12-26 23:07:55,737 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:07:55,737 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:07:55,738 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1609164851] [2019-12-26 23:07:55,738 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:07:55,739 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:07:55,739 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:07:55,739 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:07:55,739 INFO L87 Difference]: Start difference. First operand 38969 states and 128499 transitions. Second operand 5 states. [2019-12-26 23:07:56,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:07:56,382 INFO L93 Difference]: Finished difference Result 53507 states and 173644 transitions. [2019-12-26 23:07:56,382 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 23:07:56,382 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 16 [2019-12-26 23:07:56,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:07:56,532 INFO L225 Difference]: With dead ends: 53507 [2019-12-26 23:07:56,532 INFO L226 Difference]: Without dead ends: 53507 [2019-12-26 23:07:56,533 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:07:56,870 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53507 states. [2019-12-26 23:07:57,415 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53507 to 44557. [2019-12-26 23:07:57,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44557 states. [2019-12-26 23:07:57,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44557 states to 44557 states and 146077 transitions. [2019-12-26 23:07:57,509 INFO L78 Accepts]: Start accepts. Automaton has 44557 states and 146077 transitions. Word has length 16 [2019-12-26 23:07:57,509 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:07:57,509 INFO L462 AbstractCegarLoop]: Abstraction has 44557 states and 146077 transitions. [2019-12-26 23:07:57,510 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:07:57,510 INFO L276 IsEmpty]: Start isEmpty. Operand 44557 states and 146077 transitions. [2019-12-26 23:07:57,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-26 23:07:57,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:07:57,524 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-26 23:07:57,524 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-26 23:07:57,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:07:57,524 INFO L82 PathProgramCache]: Analyzing trace with hash -187432510, now seen corresponding path program 1 times [2019-12-26 23:07:57,525 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:07:57,525 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [244373308] [2019-12-26 23:07:57,525 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:07:57,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:07:57,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-26 23:07:57,609 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [244373308] [2019-12-26 23:07:57,609 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:07:57,609 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:07:57,610 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2037406326] [2019-12-26 23:07:57,610 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:07:57,610 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:07:57,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:07:57,611 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:07:57,611 INFO L87 Difference]: Start difference. First operand 44557 states and 146077 transitions. Second operand 6 states. [2019-12-26 23:07:58,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:07:58,917 INFO L93 Difference]: Finished difference Result 66834 states and 212729 transitions. [2019-12-26 23:07:58,917 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 23:07:58,918 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2019-12-26 23:07:58,918 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:07:59,031 INFO L225 Difference]: With dead ends: 66834 [2019-12-26 23:07:59,031 INFO L226 Difference]: Without dead ends: 66820 [2019-12-26 23:07:59,032 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=54, Invalid=102, Unknown=0, NotChecked=0, Total=156 [2019-12-26 23:07:59,334 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66820 states. [2019-12-26 23:07:59,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66820 to 44208. [2019-12-26 23:07:59,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44208 states. [2019-12-26 23:07:59,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44208 states to 44208 states and 144750 transitions. [2019-12-26 23:07:59,996 INFO L78 Accepts]: Start accepts. Automaton has 44208 states and 144750 transitions. Word has length 22 [2019-12-26 23:07:59,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:07:59,996 INFO L462 AbstractCegarLoop]: Abstraction has 44208 states and 144750 transitions. [2019-12-26 23:07:59,996 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:07:59,996 INFO L276 IsEmpty]: Start isEmpty. Operand 44208 states and 144750 transitions. [2019-12-26 23:08:00,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-26 23:08:00,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:00,014 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-26 23:08:00,014 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-26 23:08:00,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:00,015 INFO L82 PathProgramCache]: Analyzing trace with hash -200714255, now seen corresponding path program 1 times [2019-12-26 23:08:00,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:00,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493807835] [2019-12-26 23:08:00,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:00,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:00,069 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-26 23:08:00,069 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493807835] [2019-12-26 23:08:00,070 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:00,070 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:08:00,070 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109945119] [2019-12-26 23:08:00,070 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:08:00,071 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:00,071 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:08:00,071 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:08:00,071 INFO L87 Difference]: Start difference. First operand 44208 states and 144750 transitions. Second operand 4 states. [2019-12-26 23:08:00,164 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:00,165 INFO L93 Difference]: Finished difference Result 18127 states and 56319 transitions. [2019-12-26 23:08:00,165 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:08:00,165 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-26 23:08:00,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:00,199 INFO L225 Difference]: With dead ends: 18127 [2019-12-26 23:08:00,199 INFO L226 Difference]: Without dead ends: 18127 [2019-12-26 23:08:00,200 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:08:00,305 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18127 states. [2019-12-26 23:08:00,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18127 to 17799. [2019-12-26 23:08:00,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17799 states. [2019-12-26 23:08:00,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17799 states to 17799 states and 55383 transitions. [2019-12-26 23:08:00,508 INFO L78 Accepts]: Start accepts. Automaton has 17799 states and 55383 transitions. Word has length 25 [2019-12-26 23:08:00,508 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:00,509 INFO L462 AbstractCegarLoop]: Abstraction has 17799 states and 55383 transitions. [2019-12-26 23:08:00,509 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:08:00,509 INFO L276 IsEmpty]: Start isEmpty. Operand 17799 states and 55383 transitions. [2019-12-26 23:08:00,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2019-12-26 23:08:00,523 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:00,523 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-26 23:08:00,523 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-26 23:08:00,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:00,524 INFO L82 PathProgramCache]: Analyzing trace with hash 611460705, now seen corresponding path program 1 times [2019-12-26 23:08:00,524 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:00,524 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [478538490] [2019-12-26 23:08:00,524 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:00,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:00,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-26 23:08:00,600 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [478538490] [2019-12-26 23:08:00,600 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:00,601 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:08:00,601 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106732121] [2019-12-26 23:08:00,601 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 23:08:00,601 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:00,602 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 23:08:00,602 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 23:08:00,602 INFO L87 Difference]: Start difference. First operand 17799 states and 55383 transitions. Second operand 6 states. [2019-12-26 23:08:01,237 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:01,237 INFO L93 Difference]: Finished difference Result 25206 states and 75658 transitions. [2019-12-26 23:08:01,237 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-26 23:08:01,238 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 27 [2019-12-26 23:08:01,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:01,278 INFO L225 Difference]: With dead ends: 25206 [2019-12-26 23:08:01,278 INFO L226 Difference]: Without dead ends: 25206 [2019-12-26 23:08:01,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:08:01,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25206 states. [2019-12-26 23:08:01,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25206 to 20596. [2019-12-26 23:08:01,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20596 states. [2019-12-26 23:08:01,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20596 states to 20596 states and 63178 transitions. [2019-12-26 23:08:01,932 INFO L78 Accepts]: Start accepts. Automaton has 20596 states and 63178 transitions. Word has length 27 [2019-12-26 23:08:01,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:01,933 INFO L462 AbstractCegarLoop]: Abstraction has 20596 states and 63178 transitions. [2019-12-26 23:08:01,933 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 23:08:01,933 INFO L276 IsEmpty]: Start isEmpty. Operand 20596 states and 63178 transitions. [2019-12-26 23:08:01,954 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2019-12-26 23:08:01,954 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:01,954 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-26 23:08:01,954 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-26 23:08:01,955 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:01,955 INFO L82 PathProgramCache]: Analyzing trace with hash -1170391984, now seen corresponding path program 1 times [2019-12-26 23:08:01,955 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:01,955 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1957020767] [2019-12-26 23:08:01,955 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:01,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:02,067 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-26 23:08:02,068 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1957020767] [2019-12-26 23:08:02,068 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:02,068 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 23:08:02,069 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1853844947] [2019-12-26 23:08:02,069 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:08:02,069 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:02,069 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:08:02,070 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:08:02,070 INFO L87 Difference]: Start difference. First operand 20596 states and 63178 transitions. Second operand 7 states. [2019-12-26 23:08:03,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:03,302 INFO L93 Difference]: Finished difference Result 28185 states and 83945 transitions. [2019-12-26 23:08:03,303 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 23:08:03,303 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 33 [2019-12-26 23:08:03,304 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:03,343 INFO L225 Difference]: With dead ends: 28185 [2019-12-26 23:08:03,343 INFO L226 Difference]: Without dead ends: 28185 [2019-12-26 23:08:03,344 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=252, Unknown=0, NotChecked=0, Total=342 [2019-12-26 23:08:03,458 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28185 states. [2019-12-26 23:08:03,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28185 to 19533. [2019-12-26 23:08:03,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19533 states. [2019-12-26 23:08:03,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19533 states to 19533 states and 59996 transitions. [2019-12-26 23:08:03,736 INFO L78 Accepts]: Start accepts. Automaton has 19533 states and 59996 transitions. Word has length 33 [2019-12-26 23:08:03,736 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:03,736 INFO L462 AbstractCegarLoop]: Abstraction has 19533 states and 59996 transitions. [2019-12-26 23:08:03,736 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:08:03,737 INFO L276 IsEmpty]: Start isEmpty. Operand 19533 states and 59996 transitions. [2019-12-26 23:08:03,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-26 23:08:03,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:03,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, 1, 1, 1, 1, 1] [2019-12-26 23:08:03,765 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-26 23:08:03,766 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:03,766 INFO L82 PathProgramCache]: Analyzing trace with hash -471967596, now seen corresponding path program 1 times [2019-12-26 23:08:03,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:03,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [452310839] [2019-12-26 23:08:03,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:03,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:03,841 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-26 23:08:03,842 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [452310839] [2019-12-26 23:08:03,842 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:03,842 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 23:08:03,842 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822780403] [2019-12-26 23:08:03,844 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 23:08:03,844 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:03,844 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 23:08:03,844 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-26 23:08:03,844 INFO L87 Difference]: Start difference. First operand 19533 states and 59996 transitions. Second operand 5 states. [2019-12-26 23:08:03,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:03,962 INFO L93 Difference]: Finished difference Result 18279 states and 57074 transitions. [2019-12-26 23:08:03,962 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 23:08:03,962 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 39 [2019-12-26 23:08:03,963 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:04,001 INFO L225 Difference]: With dead ends: 18279 [2019-12-26 23:08:04,001 INFO L226 Difference]: Without dead ends: 18279 [2019-12-26 23:08:04,001 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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-26 23:08:04,107 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18279 states. [2019-12-26 23:08:04,296 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18279 to 17698. [2019-12-26 23:08:04,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17698 states. [2019-12-26 23:08:04,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17698 states to 17698 states and 55505 transitions. [2019-12-26 23:08:04,330 INFO L78 Accepts]: Start accepts. Automaton has 17698 states and 55505 transitions. Word has length 39 [2019-12-26 23:08:04,330 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:04,330 INFO L462 AbstractCegarLoop]: Abstraction has 17698 states and 55505 transitions. [2019-12-26 23:08:04,330 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 23:08:04,330 INFO L276 IsEmpty]: Start isEmpty. Operand 17698 states and 55505 transitions. [2019-12-26 23:08:04,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:08:04,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:04,354 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-26 23:08:04,354 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-26 23:08:04,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:04,355 INFO L82 PathProgramCache]: Analyzing trace with hash -2116688157, now seen corresponding path program 1 times [2019-12-26 23:08:04,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:04,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1667767087] [2019-12-26 23:08:04,355 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:04,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:04,492 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-26 23:08:04,493 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1667767087] [2019-12-26 23:08:04,493 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:04,493 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:08:04,493 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1308633935] [2019-12-26 23:08:04,494 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:08:04,494 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:04,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:08:04,494 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:08:04,496 INFO L87 Difference]: Start difference. First operand 17698 states and 55505 transitions. Second operand 7 states. [2019-12-26 23:08:05,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:05,084 INFO L93 Difference]: Finished difference Result 48537 states and 151835 transitions. [2019-12-26 23:08:05,084 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 23:08:05,084 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 23:08:05,085 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:05,158 INFO L225 Difference]: With dead ends: 48537 [2019-12-26 23:08:05,159 INFO L226 Difference]: Without dead ends: 38006 [2019-12-26 23:08:05,159 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:08:05,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38006 states. [2019-12-26 23:08:05,652 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38006 to 21047. [2019-12-26 23:08:05,652 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21047 states. [2019-12-26 23:08:05,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21047 states to 21047 states and 66538 transitions. [2019-12-26 23:08:05,694 INFO L78 Accepts]: Start accepts. Automaton has 21047 states and 66538 transitions. Word has length 64 [2019-12-26 23:08:05,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:05,694 INFO L462 AbstractCegarLoop]: Abstraction has 21047 states and 66538 transitions. [2019-12-26 23:08:05,694 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:08:05,694 INFO L276 IsEmpty]: Start isEmpty. Operand 21047 states and 66538 transitions. [2019-12-26 23:08:05,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:08:05,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:05,720 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-26 23:08:05,720 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-26 23:08:05,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:05,720 INFO L82 PathProgramCache]: Analyzing trace with hash -978914267, now seen corresponding path program 2 times [2019-12-26 23:08:05,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:05,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600598932] [2019-12-26 23:08:05,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:05,740 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:05,815 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-26 23:08:05,815 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600598932] [2019-12-26 23:08:05,816 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:05,816 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:08:05,816 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [41536891] [2019-12-26 23:08:05,817 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:08:05,817 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:05,817 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:08:05,817 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:08:05,818 INFO L87 Difference]: Start difference. First operand 21047 states and 66538 transitions. Second operand 7 states. [2019-12-26 23:08:06,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:06,624 INFO L93 Difference]: Finished difference Result 57554 states and 178145 transitions. [2019-12-26 23:08:06,624 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-26 23:08:06,625 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 23:08:06,625 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:06,683 INFO L225 Difference]: With dead ends: 57554 [2019-12-26 23:08:06,684 INFO L226 Difference]: Without dead ends: 41745 [2019-12-26 23:08:06,684 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:08:06,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41745 states. [2019-12-26 23:08:07,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41745 to 24743. [2019-12-26 23:08:07,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24743 states. [2019-12-26 23:08:07,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24743 states to 24743 states and 78318 transitions. [2019-12-26 23:08:07,256 INFO L78 Accepts]: Start accepts. Automaton has 24743 states and 78318 transitions. Word has length 64 [2019-12-26 23:08:07,256 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:07,257 INFO L462 AbstractCegarLoop]: Abstraction has 24743 states and 78318 transitions. [2019-12-26 23:08:07,257 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:08:07,257 INFO L276 IsEmpty]: Start isEmpty. Operand 24743 states and 78318 transitions. [2019-12-26 23:08:07,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:08:07,294 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:07,294 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-26 23:08:07,294 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-26 23:08:07,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:07,295 INFO L82 PathProgramCache]: Analyzing trace with hash -423923923, now seen corresponding path program 3 times [2019-12-26 23:08:07,295 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:07,295 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136501298] [2019-12-26 23:08:07,295 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:07,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:07,393 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-26 23:08:07,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136501298] [2019-12-26 23:08:07,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:07,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 23:08:07,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [750041176] [2019-12-26 23:08:07,394 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 23:08:07,395 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:07,395 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 23:08:07,395 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-26 23:08:07,395 INFO L87 Difference]: Start difference. First operand 24743 states and 78318 transitions. Second operand 7 states. [2019-12-26 23:08:07,872 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:07,872 INFO L93 Difference]: Finished difference Result 51247 states and 161421 transitions. [2019-12-26 23:08:07,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-26 23:08:07,873 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 64 [2019-12-26 23:08:07,873 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:07,942 INFO L225 Difference]: With dead ends: 51247 [2019-12-26 23:08:07,943 INFO L226 Difference]: Without dead ends: 47407 [2019-12-26 23:08:07,944 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=48, Invalid=134, Unknown=0, NotChecked=0, Total=182 [2019-12-26 23:08:08,111 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47407 states. [2019-12-26 23:08:08,502 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47407 to 24923. [2019-12-26 23:08:08,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24923 states. [2019-12-26 23:08:08,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24923 states to 24923 states and 79050 transitions. [2019-12-26 23:08:08,551 INFO L78 Accepts]: Start accepts. Automaton has 24923 states and 79050 transitions. Word has length 64 [2019-12-26 23:08:08,551 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:08,552 INFO L462 AbstractCegarLoop]: Abstraction has 24923 states and 79050 transitions. [2019-12-26 23:08:08,552 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 23:08:08,552 INFO L276 IsEmpty]: Start isEmpty. Operand 24923 states and 79050 transitions. [2019-12-26 23:08:08,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2019-12-26 23:08:08,594 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:08,594 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-26 23:08:08,594 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-26 23:08:08,594 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:08,595 INFO L82 PathProgramCache]: Analyzing trace with hash -314768521, now seen corresponding path program 4 times [2019-12-26 23:08:08,595 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:08,595 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978609886] [2019-12-26 23:08:08,595 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:08,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:08,674 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-26 23:08:08,675 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978609886] [2019-12-26 23:08:08,675 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:08,675 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:08:08,675 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [684861173] [2019-12-26 23:08:08,676 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:08:08,676 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:08,676 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:08:08,676 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:08:08,676 INFO L87 Difference]: Start difference. First operand 24923 states and 79050 transitions. Second operand 3 states. [2019-12-26 23:08:08,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:08,772 INFO L93 Difference]: Finished difference Result 20919 states and 64986 transitions. [2019-12-26 23:08:08,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:08:08,772 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 64 [2019-12-26 23:08:08,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:08,809 INFO L225 Difference]: With dead ends: 20919 [2019-12-26 23:08:08,809 INFO L226 Difference]: Without dead ends: 20919 [2019-12-26 23:08:08,810 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-26 23:08:08,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20919 states. [2019-12-26 23:08:09,288 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20919 to 19827. [2019-12-26 23:08:09,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19827 states. [2019-12-26 23:08:09,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19827 states to 19827 states and 61272 transitions. [2019-12-26 23:08:09,347 INFO L78 Accepts]: Start accepts. Automaton has 19827 states and 61272 transitions. Word has length 64 [2019-12-26 23:08:09,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:09,347 INFO L462 AbstractCegarLoop]: Abstraction has 19827 states and 61272 transitions. [2019-12-26 23:08:09,347 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:08:09,347 INFO L276 IsEmpty]: Start isEmpty. Operand 19827 states and 61272 transitions. [2019-12-26 23:08:09,380 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-26 23:08:09,380 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:09,381 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-26 23:08:09,381 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-26 23:08:09,381 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:09,381 INFO L82 PathProgramCache]: Analyzing trace with hash 231413698, now seen corresponding path program 1 times [2019-12-26 23:08:09,381 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:09,382 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188397860] [2019-12-26 23:08:09,382 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:09,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:09,503 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-26 23:08:09,504 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188397860] [2019-12-26 23:08:09,504 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:09,504 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:08:09,504 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937738262] [2019-12-26 23:08:09,504 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:08:09,505 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:09,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:08:09,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:08:09,505 INFO L87 Difference]: Start difference. First operand 19827 states and 61272 transitions. Second operand 3 states. [2019-12-26 23:08:09,623 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:09,623 INFO L93 Difference]: Finished difference Result 24197 states and 74265 transitions. [2019-12-26 23:08:09,623 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:08:09,623 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-26 23:08:09,623 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:09,654 INFO L225 Difference]: With dead ends: 24197 [2019-12-26 23:08:09,654 INFO L226 Difference]: Without dead ends: 24197 [2019-12-26 23:08:09,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:08:09,753 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24197 states. [2019-12-26 23:08:10,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24197 to 21036. [2019-12-26 23:08:10,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21036 states. [2019-12-26 23:08:10,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21036 states to 21036 states and 65069 transitions. [2019-12-26 23:08:10,227 INFO L78 Accepts]: Start accepts. Automaton has 21036 states and 65069 transitions. Word has length 65 [2019-12-26 23:08:10,227 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:10,228 INFO L462 AbstractCegarLoop]: Abstraction has 21036 states and 65069 transitions. [2019-12-26 23:08:10,228 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:08:10,228 INFO L276 IsEmpty]: Start isEmpty. Operand 21036 states and 65069 transitions. [2019-12-26 23:08:10,251 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:08:10,251 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:10,252 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-26 23:08:10,252 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-26 23:08:10,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:10,252 INFO L82 PathProgramCache]: Analyzing trace with hash 198410648, now seen corresponding path program 1 times [2019-12-26 23:08:10,252 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:10,253 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1424348932] [2019-12-26 23:08:10,253 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:10,272 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:10,334 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-26 23:08:10,335 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1424348932] [2019-12-26 23:08:10,335 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:10,335 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 23:08:10,335 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74394027] [2019-12-26 23:08:10,336 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 23:08:10,336 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:10,336 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 23:08:10,336 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 23:08:10,336 INFO L87 Difference]: Start difference. First operand 21036 states and 65069 transitions. Second operand 4 states. [2019-12-26 23:08:10,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:10,554 INFO L93 Difference]: Finished difference Result 24621 states and 75632 transitions. [2019-12-26 23:08:10,555 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 23:08:10,555 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 66 [2019-12-26 23:08:10,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:10,617 INFO L225 Difference]: With dead ends: 24621 [2019-12-26 23:08:10,617 INFO L226 Difference]: Without dead ends: 24621 [2019-12-26 23:08:10,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 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-26 23:08:10,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24621 states. [2019-12-26 23:08:11,244 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24621 to 21144. [2019-12-26 23:08:11,244 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21144 states. [2019-12-26 23:08:11,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21144 states to 21144 states and 65300 transitions. [2019-12-26 23:08:11,310 INFO L78 Accepts]: Start accepts. Automaton has 21144 states and 65300 transitions. Word has length 66 [2019-12-26 23:08:11,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:11,310 INFO L462 AbstractCegarLoop]: Abstraction has 21144 states and 65300 transitions. [2019-12-26 23:08:11,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 23:08:11,310 INFO L276 IsEmpty]: Start isEmpty. Operand 21144 states and 65300 transitions. [2019-12-26 23:08:11,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:08:11,343 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:11,343 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-26 23:08:11,343 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-26 23:08:11,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:11,344 INFO L82 PathProgramCache]: Analyzing trace with hash 745619748, now seen corresponding path program 1 times [2019-12-26 23:08:11,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:11,344 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328240407] [2019-12-26 23:08:11,344 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:11,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:11,535 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-26 23:08:11,535 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328240407] [2019-12-26 23:08:11,536 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:11,536 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:08:11,536 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1696259280] [2019-12-26 23:08:11,536 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:08:11,537 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:11,537 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:08:11,537 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=72, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:08:11,537 INFO L87 Difference]: Start difference. First operand 21144 states and 65300 transitions. Second operand 10 states. [2019-12-26 23:08:13,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:13,566 INFO L93 Difference]: Finished difference Result 38488 states and 118451 transitions. [2019-12-26 23:08:13,566 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 23:08:13,567 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 23:08:13,567 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:13,627 INFO L225 Difference]: With dead ends: 38488 [2019-12-26 23:08:13,627 INFO L226 Difference]: Without dead ends: 30672 [2019-12-26 23:08:13,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=94, Invalid=368, Unknown=0, NotChecked=0, Total=462 [2019-12-26 23:08:13,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30672 states. [2019-12-26 23:08:14,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30672 to 21745. [2019-12-26 23:08:14,336 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21745 states. [2019-12-26 23:08:14,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21745 states to 21745 states and 67061 transitions. [2019-12-26 23:08:14,419 INFO L78 Accepts]: Start accepts. Automaton has 21745 states and 67061 transitions. Word has length 66 [2019-12-26 23:08:14,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:14,420 INFO L462 AbstractCegarLoop]: Abstraction has 21745 states and 67061 transitions. [2019-12-26 23:08:14,420 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:08:14,420 INFO L276 IsEmpty]: Start isEmpty. Operand 21745 states and 67061 transitions. [2019-12-26 23:08:14,461 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:08:14,462 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:14,462 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-26 23:08:14,462 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-26 23:08:14,463 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:14,463 INFO L82 PathProgramCache]: Analyzing trace with hash -1421968206, now seen corresponding path program 2 times [2019-12-26 23:08:14,463 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:14,464 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050173110] [2019-12-26 23:08:14,464 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:14,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:14,732 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-26 23:08:14,732 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050173110] [2019-12-26 23:08:14,735 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:14,735 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2019-12-26 23:08:14,737 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327095727] [2019-12-26 23:08:14,737 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-26 23:08:14,738 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:14,738 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-26 23:08:14,738 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2019-12-26 23:08:14,738 INFO L87 Difference]: Start difference. First operand 21745 states and 67061 transitions. Second operand 10 states. [2019-12-26 23:08:16,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:16,641 INFO L93 Difference]: Finished difference Result 37884 states and 115944 transitions. [2019-12-26 23:08:16,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-26 23:08:16,641 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 66 [2019-12-26 23:08:16,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:16,703 INFO L225 Difference]: With dead ends: 37884 [2019-12-26 23:08:16,704 INFO L226 Difference]: Without dead ends: 31924 [2019-12-26 23:08:16,706 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=65, Invalid=241, Unknown=0, NotChecked=0, Total=306 [2019-12-26 23:08:16,854 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31924 states. [2019-12-26 23:08:17,345 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31924 to 22197. [2019-12-26 23:08:17,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22197 states. [2019-12-26 23:08:17,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22197 states to 22197 states and 68309 transitions. [2019-12-26 23:08:17,384 INFO L78 Accepts]: Start accepts. Automaton has 22197 states and 68309 transitions. Word has length 66 [2019-12-26 23:08:17,385 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:17,385 INFO L462 AbstractCegarLoop]: Abstraction has 22197 states and 68309 transitions. [2019-12-26 23:08:17,385 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-26 23:08:17,385 INFO L276 IsEmpty]: Start isEmpty. Operand 22197 states and 68309 transitions. [2019-12-26 23:08:17,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:08:17,407 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:17,407 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-26 23:08:17,407 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-26 23:08:17,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:17,407 INFO L82 PathProgramCache]: Analyzing trace with hash 765284024, now seen corresponding path program 3 times [2019-12-26 23:08:17,408 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:17,408 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599853959] [2019-12-26 23:08:17,408 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:17,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:17,568 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 23:08:17,569 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599853959] [2019-12-26 23:08:17,569 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:17,569 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:08:17,569 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1039691648] [2019-12-26 23:08:17,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 23:08:17,570 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:17,570 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 23:08:17,570 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:08:17,570 INFO L87 Difference]: Start difference. First operand 22197 states and 68309 transitions. Second operand 11 states. [2019-12-26 23:08:19,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:19,420 INFO L93 Difference]: Finished difference Result 34983 states and 107283 transitions. [2019-12-26 23:08:19,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 23:08:19,421 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 23:08:19,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:19,464 INFO L225 Difference]: With dead ends: 34983 [2019-12-26 23:08:19,464 INFO L226 Difference]: Without dead ends: 31500 [2019-12-26 23:08:19,465 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 46 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=341, Unknown=0, NotChecked=0, Total=420 [2019-12-26 23:08:19,581 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31500 states. [2019-12-26 23:08:19,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31500 to 21765. [2019-12-26 23:08:19,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21765 states. [2019-12-26 23:08:19,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21765 states to 21765 states and 66977 transitions. [2019-12-26 23:08:19,884 INFO L78 Accepts]: Start accepts. Automaton has 21765 states and 66977 transitions. Word has length 66 [2019-12-26 23:08:19,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:19,884 INFO L462 AbstractCegarLoop]: Abstraction has 21765 states and 66977 transitions. [2019-12-26 23:08:19,885 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 23:08:19,885 INFO L276 IsEmpty]: Start isEmpty. Operand 21765 states and 66977 transitions. [2019-12-26 23:08:19,909 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:08:19,909 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:19,909 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-26 23:08:19,909 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-26 23:08:19,909 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:19,909 INFO L82 PathProgramCache]: Analyzing trace with hash 53330666, now seen corresponding path program 4 times [2019-12-26 23:08:19,910 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:19,910 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1899889527] [2019-12-26 23:08:19,910 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:19,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:20,043 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-26 23:08:20,044 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1899889527] [2019-12-26 23:08:20,044 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:20,044 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:08:20,045 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [76510871] [2019-12-26 23:08:20,045 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 23:08:20,045 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:20,045 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 23:08:20,045 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2019-12-26 23:08:20,046 INFO L87 Difference]: Start difference. First operand 21765 states and 66977 transitions. Second operand 9 states. [2019-12-26 23:08:23,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:23,133 INFO L93 Difference]: Finished difference Result 38482 states and 114926 transitions. [2019-12-26 23:08:23,133 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 44 states. [2019-12-26 23:08:23,134 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 66 [2019-12-26 23:08:23,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:23,186 INFO L225 Difference]: With dead ends: 38482 [2019-12-26 23:08:23,186 INFO L226 Difference]: Without dead ends: 38162 [2019-12-26 23:08:23,186 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 16 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 547 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=285, Invalid=1607, Unknown=0, NotChecked=0, Total=1892 [2019-12-26 23:08:23,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38162 states. [2019-12-26 23:08:23,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38162 to 26436. [2019-12-26 23:08:23,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26436 states. [2019-12-26 23:08:23,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26436 states to 26436 states and 80840 transitions. [2019-12-26 23:08:23,721 INFO L78 Accepts]: Start accepts. Automaton has 26436 states and 80840 transitions. Word has length 66 [2019-12-26 23:08:23,721 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:23,722 INFO L462 AbstractCegarLoop]: Abstraction has 26436 states and 80840 transitions. [2019-12-26 23:08:23,722 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 23:08:23,722 INFO L276 IsEmpty]: Start isEmpty. Operand 26436 states and 80840 transitions. [2019-12-26 23:08:24,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:08:24,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:24,055 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-26 23:08:24,056 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-26 23:08:24,056 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:24,056 INFO L82 PathProgramCache]: Analyzing trace with hash 1722915508, now seen corresponding path program 5 times [2019-12-26 23:08:24,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:24,057 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [857257174] [2019-12-26 23:08:24,057 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:24,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:24,545 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-26 23:08:24,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [857257174] [2019-12-26 23:08:24,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:24,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-26 23:08:24,545 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132736539] [2019-12-26 23:08:24,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-26 23:08:24,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:24,546 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-26 23:08:24,546 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=329, Unknown=0, NotChecked=0, Total=380 [2019-12-26 23:08:24,547 INFO L87 Difference]: Start difference. First operand 26436 states and 80840 transitions. Second operand 20 states. [2019-12-26 23:08:39,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:39,630 INFO L93 Difference]: Finished difference Result 50929 states and 153795 transitions. [2019-12-26 23:08:39,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 138 states. [2019-12-26 23:08:39,630 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2019-12-26 23:08:39,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:39,693 INFO L225 Difference]: With dead ends: 50929 [2019-12-26 23:08:39,693 INFO L226 Difference]: Without dead ends: 46992 [2019-12-26 23:08:39,697 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 142 GetRequests, 2 SyntacticMatches, 3 SemanticMatches, 137 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7144 ImplicationChecksByTransitivity, 3.7s TimeCoverageRelationStatistics Valid=1800, Invalid=17382, Unknown=0, NotChecked=0, Total=19182 [2019-12-26 23:08:39,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46992 states. [2019-12-26 23:08:40,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46992 to 28128. [2019-12-26 23:08:40,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28128 states. [2019-12-26 23:08:40,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28128 states to 28128 states and 86303 transitions. [2019-12-26 23:08:40,292 INFO L78 Accepts]: Start accepts. Automaton has 28128 states and 86303 transitions. Word has length 66 [2019-12-26 23:08:40,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:40,292 INFO L462 AbstractCegarLoop]: Abstraction has 28128 states and 86303 transitions. [2019-12-26 23:08:40,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-26 23:08:40,292 INFO L276 IsEmpty]: Start isEmpty. Operand 28128 states and 86303 transitions. [2019-12-26 23:08:40,322 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:08:40,322 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:40,323 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-26 23:08:40,323 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-26 23:08:40,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:40,323 INFO L82 PathProgramCache]: Analyzing trace with hash -1721003244, now seen corresponding path program 6 times [2019-12-26 23:08:40,323 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:40,324 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1147288607] [2019-12-26 23:08:40,324 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:40,342 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:40,522 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-26 23:08:40,522 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1147288607] [2019-12-26 23:08:40,522 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:40,523 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:08:40,523 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132247683] [2019-12-26 23:08:40,524 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 23:08:40,524 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:40,524 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 23:08:40,525 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=90, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:08:40,527 INFO L87 Difference]: Start difference. First operand 28128 states and 86303 transitions. Second operand 11 states. [2019-12-26 23:08:42,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:42,612 INFO L93 Difference]: Finished difference Result 40967 states and 125971 transitions. [2019-12-26 23:08:42,612 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 23:08:42,613 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 23:08:42,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:42,665 INFO L225 Difference]: With dead ends: 40967 [2019-12-26 23:08:42,665 INFO L226 Difference]: Without dead ends: 37735 [2019-12-26 23:08:42,666 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=382, Unknown=0, NotChecked=0, Total=462 [2019-12-26 23:08:42,801 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37735 states. [2019-12-26 23:08:43,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37735 to 29312. [2019-12-26 23:08:43,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29312 states. [2019-12-26 23:08:43,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29312 states to 29312 states and 89704 transitions. [2019-12-26 23:08:43,189 INFO L78 Accepts]: Start accepts. Automaton has 29312 states and 89704 transitions. Word has length 66 [2019-12-26 23:08:43,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:43,189 INFO L462 AbstractCegarLoop]: Abstraction has 29312 states and 89704 transitions. [2019-12-26 23:08:43,189 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 23:08:43,190 INFO L276 IsEmpty]: Start isEmpty. Operand 29312 states and 89704 transitions. [2019-12-26 23:08:43,219 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:08:43,219 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:43,220 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-26 23:08:43,220 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-26 23:08:43,220 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:43,220 INFO L82 PathProgramCache]: Analyzing trace with hash 742453144, now seen corresponding path program 7 times [2019-12-26 23:08:43,220 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:43,220 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1543871228] [2019-12-26 23:08:43,220 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:43,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:43,378 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-26 23:08:43,379 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1543871228] [2019-12-26 23:08:43,379 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:43,379 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-26 23:08:43,379 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298729788] [2019-12-26 23:08:43,379 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-26 23:08:43,380 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:43,380 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-26 23:08:43,380 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=89, Unknown=0, NotChecked=0, Total=110 [2019-12-26 23:08:43,380 INFO L87 Difference]: Start difference. First operand 29312 states and 89704 transitions. Second operand 11 states. [2019-12-26 23:08:45,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:45,449 INFO L93 Difference]: Finished difference Result 45146 states and 137396 transitions. [2019-12-26 23:08:45,450 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-26 23:08:45,450 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 66 [2019-12-26 23:08:45,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:45,501 INFO L225 Difference]: With dead ends: 45146 [2019-12-26 23:08:45,501 INFO L226 Difference]: Without dead ends: 40337 [2019-12-26 23:08:45,502 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 33 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=308, Unknown=0, NotChecked=0, Total=380 [2019-12-26 23:08:45,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40337 states. [2019-12-26 23:08:45,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40337 to 28170. [2019-12-26 23:08:45,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28170 states. [2019-12-26 23:08:46,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28170 states to 28170 states and 86305 transitions. [2019-12-26 23:08:46,021 INFO L78 Accepts]: Start accepts. Automaton has 28170 states and 86305 transitions. Word has length 66 [2019-12-26 23:08:46,021 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:46,022 INFO L462 AbstractCegarLoop]: Abstraction has 28170 states and 86305 transitions. [2019-12-26 23:08:46,022 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-26 23:08:46,022 INFO L276 IsEmpty]: Start isEmpty. Operand 28170 states and 86305 transitions. [2019-12-26 23:08:46,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:08:46,053 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:46,053 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-26 23:08:46,053 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-26 23:08:46,053 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:46,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1833986216, now seen corresponding path program 8 times [2019-12-26 23:08:46,053 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:46,053 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [37490407] [2019-12-26 23:08:46,054 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:46,071 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:46,623 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-26 23:08:46,623 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [37490407] [2019-12-26 23:08:46,623 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:46,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-26 23:08:46,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252451462] [2019-12-26 23:08:46,624 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-26 23:08:46,624 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:46,624 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-26 23:08:46,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=327, Unknown=0, NotChecked=0, Total=380 [2019-12-26 23:08:46,625 INFO L87 Difference]: Start difference. First operand 28170 states and 86305 transitions. Second operand 20 states. [2019-12-26 23:08:50,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:50,831 INFO L93 Difference]: Finished difference Result 29069 states and 88348 transitions. [2019-12-26 23:08:50,831 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 39 states. [2019-12-26 23:08:50,831 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2019-12-26 23:08:50,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:50,871 INFO L225 Difference]: With dead ends: 29069 [2019-12-26 23:08:50,871 INFO L226 Difference]: Without dead ends: 28194 [2019-12-26 23:08:50,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 266 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=256, Invalid=1384, Unknown=0, NotChecked=0, Total=1640 [2019-12-26 23:08:50,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28194 states. [2019-12-26 23:08:51,258 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28194 to 27230. [2019-12-26 23:08:51,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27230 states. [2019-12-26 23:08:51,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27230 states to 27230 states and 83196 transitions. [2019-12-26 23:08:51,310 INFO L78 Accepts]: Start accepts. Automaton has 27230 states and 83196 transitions. Word has length 66 [2019-12-26 23:08:51,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:51,310 INFO L462 AbstractCegarLoop]: Abstraction has 27230 states and 83196 transitions. [2019-12-26 23:08:51,310 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-26 23:08:51,310 INFO L276 IsEmpty]: Start isEmpty. Operand 27230 states and 83196 transitions. [2019-12-26 23:08:51,341 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:08:51,341 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:51,341 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-26 23:08:51,341 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-26 23:08:51,341 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:51,341 INFO L82 PathProgramCache]: Analyzing trace with hash -1135339270, now seen corresponding path program 9 times [2019-12-26 23:08:51,342 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:51,342 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760268081] [2019-12-26 23:08:51,342 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:51,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:51,921 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-26 23:08:51,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760268081] [2019-12-26 23:08:51,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:51,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2019-12-26 23:08:51,922 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [791856328] [2019-12-26 23:08:51,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 20 states [2019-12-26 23:08:51,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:51,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2019-12-26 23:08:51,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2019-12-26 23:08:51,923 INFO L87 Difference]: Start difference. First operand 27230 states and 83196 transitions. Second operand 20 states. [2019-12-26 23:08:55,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:55,681 INFO L93 Difference]: Finished difference Result 29366 states and 89100 transitions. [2019-12-26 23:08:55,681 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 37 states. [2019-12-26 23:08:55,681 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 66 [2019-12-26 23:08:55,681 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:55,721 INFO L225 Difference]: With dead ends: 29366 [2019-12-26 23:08:55,721 INFO L226 Difference]: Without dead ends: 28406 [2019-12-26 23:08:55,721 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 224 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=256, Invalid=1226, Unknown=0, NotChecked=0, Total=1482 [2019-12-26 23:08:55,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28406 states. [2019-12-26 23:08:56,105 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28406 to 27220. [2019-12-26 23:08:56,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27220 states. [2019-12-26 23:08:56,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27220 states to 27220 states and 83146 transitions. [2019-12-26 23:08:56,155 INFO L78 Accepts]: Start accepts. Automaton has 27220 states and 83146 transitions. Word has length 66 [2019-12-26 23:08:56,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:08:56,156 INFO L462 AbstractCegarLoop]: Abstraction has 27220 states and 83146 transitions. [2019-12-26 23:08:56,156 INFO L463 AbstractCegarLoop]: Interpolant automaton has 20 states. [2019-12-26 23:08:56,156 INFO L276 IsEmpty]: Start isEmpty. Operand 27220 states and 83146 transitions. [2019-12-26 23:08:56,184 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:08:56,184 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:08:56,184 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-26 23:08:56,184 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-26 23:08:56,184 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:08:56,184 INFO L82 PathProgramCache]: Analyzing trace with hash -294442978, now seen corresponding path program 10 times [2019-12-26 23:08:56,185 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:08:56,185 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [29101558] [2019-12-26 23:08:56,185 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:08:56,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:08:56,545 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-26 23:08:56,546 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [29101558] [2019-12-26 23:08:56,546 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:08:56,546 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [14] imperfect sequences [] total 14 [2019-12-26 23:08:56,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827870039] [2019-12-26 23:08:56,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-26 23:08:56,547 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:08:56,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-26 23:08:56,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=200, Unknown=0, NotChecked=0, Total=240 [2019-12-26 23:08:56,547 INFO L87 Difference]: Start difference. First operand 27220 states and 83146 transitions. Second operand 16 states. [2019-12-26 23:08:59,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:08:59,877 INFO L93 Difference]: Finished difference Result 31983 states and 96660 transitions. [2019-12-26 23:08:59,877 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2019-12-26 23:08:59,878 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 66 [2019-12-26 23:08:59,878 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:08:59,922 INFO L225 Difference]: With dead ends: 31983 [2019-12-26 23:08:59,922 INFO L226 Difference]: Without dead ends: 30920 [2019-12-26 23:08:59,923 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 35 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=181, Invalid=941, Unknown=0, NotChecked=0, Total=1122 [2019-12-26 23:09:00,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30920 states. [2019-12-26 23:09:00,358 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30920 to 27279. [2019-12-26 23:09:00,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27279 states. [2019-12-26 23:09:00,408 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27279 states to 27279 states and 83342 transitions. [2019-12-26 23:09:00,408 INFO L78 Accepts]: Start accepts. Automaton has 27279 states and 83342 transitions. Word has length 66 [2019-12-26 23:09:00,408 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:09:00,408 INFO L462 AbstractCegarLoop]: Abstraction has 27279 states and 83342 transitions. [2019-12-26 23:09:00,408 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-26 23:09:00,408 INFO L276 IsEmpty]: Start isEmpty. Operand 27279 states and 83342 transitions. [2019-12-26 23:09:00,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:09:00,439 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:09:00,439 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-26 23:09:00,439 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-26 23:09:00,439 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:09:00,440 INFO L82 PathProgramCache]: Analyzing trace with hash -1314652352, now seen corresponding path program 11 times [2019-12-26 23:09:00,440 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:09:00,440 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1048215558] [2019-12-26 23:09:00,440 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:09:00,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:09:00,610 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-26 23:09:00,610 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1048215558] [2019-12-26 23:09:00,611 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:09:00,611 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 23:09:00,611 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186876462] [2019-12-26 23:09:00,611 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:09:00,611 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:09:00,611 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:09:00,612 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:09:00,612 INFO L87 Difference]: Start difference. First operand 27279 states and 83342 transitions. Second operand 12 states. [2019-12-26 23:09:02,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:09:02,439 INFO L93 Difference]: Finished difference Result 42222 states and 128032 transitions. [2019-12-26 23:09:02,439 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-26 23:09:02,439 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 66 [2019-12-26 23:09:02,440 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:09:02,497 INFO L225 Difference]: With dead ends: 42222 [2019-12-26 23:09:02,497 INFO L226 Difference]: Without dead ends: 40112 [2019-12-26 23:09:02,497 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2019-12-26 23:09:02,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40112 states. [2019-12-26 23:09:03,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40112 to 27027. [2019-12-26 23:09:03,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27027 states. [2019-12-26 23:09:03,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27027 states to 27027 states and 82688 transitions. [2019-12-26 23:09:03,313 INFO L78 Accepts]: Start accepts. Automaton has 27027 states and 82688 transitions. Word has length 66 [2019-12-26 23:09:03,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:09:03,313 INFO L462 AbstractCegarLoop]: Abstraction has 27027 states and 82688 transitions. [2019-12-26 23:09:03,313 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:09:03,313 INFO L276 IsEmpty]: Start isEmpty. Operand 27027 states and 82688 transitions. [2019-12-26 23:09:03,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:09:03,344 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:09:03,344 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-26 23:09:03,344 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-26 23:09:03,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:09:03,344 INFO L82 PathProgramCache]: Analyzing trace with hash 1354348786, now seen corresponding path program 12 times [2019-12-26 23:09:03,344 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:09:03,345 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540575299] [2019-12-26 23:09:03,345 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:09:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:09:04,010 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-26 23:09:04,011 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540575299] [2019-12-26 23:09:04,011 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:09:04,011 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-26 23:09:04,011 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729601131] [2019-12-26 23:09:04,012 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-26 23:09:04,012 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:09:04,012 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-26 23:09:04,012 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=294, Unknown=0, NotChecked=0, Total=342 [2019-12-26 23:09:04,013 INFO L87 Difference]: Start difference. First operand 27027 states and 82688 transitions. Second operand 19 states. [2019-12-26 23:09:09,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:09:09,454 INFO L93 Difference]: Finished difference Result 29338 states and 89231 transitions. [2019-12-26 23:09:09,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-26 23:09:09,455 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2019-12-26 23:09:09,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:09:09,495 INFO L225 Difference]: With dead ends: 29338 [2019-12-26 23:09:09,495 INFO L226 Difference]: Without dead ends: 28379 [2019-12-26 23:09:09,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 408 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=305, Invalid=1951, Unknown=0, NotChecked=0, Total=2256 [2019-12-26 23:09:09,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28379 states. [2019-12-26 23:09:09,885 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28379 to 27306. [2019-12-26 23:09:09,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27306 states. [2019-12-26 23:09:09,934 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27306 states to 27306 states and 83501 transitions. [2019-12-26 23:09:09,934 INFO L78 Accepts]: Start accepts. Automaton has 27306 states and 83501 transitions. Word has length 66 [2019-12-26 23:09:09,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:09:09,935 INFO L462 AbstractCegarLoop]: Abstraction has 27306 states and 83501 transitions. [2019-12-26 23:09:09,935 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-26 23:09:09,935 INFO L276 IsEmpty]: Start isEmpty. Operand 27306 states and 83501 transitions. [2019-12-26 23:09:09,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:09:09,962 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:09:09,962 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-26 23:09:09,962 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-26 23:09:09,962 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:09:09,962 INFO L82 PathProgramCache]: Analyzing trace with hash 2052995732, now seen corresponding path program 13 times [2019-12-26 23:09:09,962 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:09:09,963 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1835362140] [2019-12-26 23:09:09,963 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:09:09,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:09:10,508 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-26 23:09:10,508 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1835362140] [2019-12-26 23:09:10,508 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:09:10,509 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [] total 17 [2019-12-26 23:09:10,509 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [493423692] [2019-12-26 23:09:10,509 INFO L442 AbstractCegarLoop]: Interpolant automaton has 19 states [2019-12-26 23:09:10,509 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:09:10,509 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2019-12-26 23:09:10,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=291, Unknown=0, NotChecked=0, Total=342 [2019-12-26 23:09:10,510 INFO L87 Difference]: Start difference. First operand 27306 states and 83501 transitions. Second operand 19 states. [2019-12-26 23:09:15,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:09:15,794 INFO L93 Difference]: Finished difference Result 29713 states and 90192 transitions. [2019-12-26 23:09:15,795 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 41 states. [2019-12-26 23:09:15,795 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 66 [2019-12-26 23:09:15,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:09:15,833 INFO L225 Difference]: With dead ends: 29713 [2019-12-26 23:09:15,833 INFO L226 Difference]: Without dead ends: 28498 [2019-12-26 23:09:15,834 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 284 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=269, Invalid=1537, Unknown=0, NotChecked=0, Total=1806 [2019-12-26 23:09:15,943 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28498 states. [2019-12-26 23:09:16,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28498 to 27284. [2019-12-26 23:09:16,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27284 states. [2019-12-26 23:09:16,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27284 states to 27284 states and 83401 transitions. [2019-12-26 23:09:16,246 INFO L78 Accepts]: Start accepts. Automaton has 27284 states and 83401 transitions. Word has length 66 [2019-12-26 23:09:16,246 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:09:16,246 INFO L462 AbstractCegarLoop]: Abstraction has 27284 states and 83401 transitions. [2019-12-26 23:09:16,246 INFO L463 AbstractCegarLoop]: Interpolant automaton has 19 states. [2019-12-26 23:09:16,246 INFO L276 IsEmpty]: Start isEmpty. Operand 27284 states and 83401 transitions. [2019-12-26 23:09:16,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-26 23:09:16,275 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:09:16,275 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-26 23:09:16,275 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-26 23:09:16,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:09:16,275 INFO L82 PathProgramCache]: Analyzing trace with hash -1401075272, now seen corresponding path program 14 times [2019-12-26 23:09:16,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:09:16,275 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2104302468] [2019-12-26 23:09:16,275 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:09:16,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:09:16,339 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-26 23:09:16,340 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2104302468] [2019-12-26 23:09:16,340 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:09:16,340 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 23:09:16,340 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630246990] [2019-12-26 23:09:16,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 23:09:16,341 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:09:16,341 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 23:09:16,341 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 23:09:16,341 INFO L87 Difference]: Start difference. First operand 27284 states and 83401 transitions. Second operand 3 states. [2019-12-26 23:09:16,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:09:16,480 INFO L93 Difference]: Finished difference Result 27284 states and 83400 transitions. [2019-12-26 23:09:16,480 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 23:09:16,480 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-26 23:09:16,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:09:16,541 INFO L225 Difference]: With dead ends: 27284 [2019-12-26 23:09:16,541 INFO L226 Difference]: Without dead ends: 27284 [2019-12-26 23:09:16,542 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-26 23:09:16,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27284 states. [2019-12-26 23:09:16,939 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27284 to 22831. [2019-12-26 23:09:16,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22831 states. [2019-12-26 23:09:16,983 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22831 states to 22831 states and 70582 transitions. [2019-12-26 23:09:16,984 INFO L78 Accepts]: Start accepts. Automaton has 22831 states and 70582 transitions. Word has length 66 [2019-12-26 23:09:16,984 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:09:16,984 INFO L462 AbstractCegarLoop]: Abstraction has 22831 states and 70582 transitions. [2019-12-26 23:09:16,984 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 23:09:16,984 INFO L276 IsEmpty]: Start isEmpty. Operand 22831 states and 70582 transitions. [2019-12-26 23:09:17,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:09:17,011 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:09:17,011 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-26 23:09:17,011 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-26 23:09:17,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:09:17,011 INFO L82 PathProgramCache]: Analyzing trace with hash 1857250972, now seen corresponding path program 1 times [2019-12-26 23:09:17,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:09:17,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251976228] [2019-12-26 23:09:17,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:09:17,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:09:17,197 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-26 23:09:17,198 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251976228] [2019-12-26 23:09:17,198 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:09:17,198 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 23:09:17,198 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1655470558] [2019-12-26 23:09:17,199 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:09:17,199 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:09:17,199 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:09:17,199 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:09:17,199 INFO L87 Difference]: Start difference. First operand 22831 states and 70582 transitions. Second operand 12 states. [2019-12-26 23:09:20,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:09:20,067 INFO L93 Difference]: Finished difference Result 40453 states and 123100 transitions. [2019-12-26 23:09:20,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2019-12-26 23:09:20,067 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-26 23:09:20,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:09:20,117 INFO L225 Difference]: With dead ends: 40453 [2019-12-26 23:09:20,117 INFO L226 Difference]: Without dead ends: 34128 [2019-12-26 23:09:20,117 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 36 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 203 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=196, Invalid=926, Unknown=0, NotChecked=0, Total=1122 [2019-12-26 23:09:20,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34128 states. [2019-12-26 23:09:20,541 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34128 to 22201. [2019-12-26 23:09:20,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22201 states. [2019-12-26 23:09:20,582 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22201 states to 22201 states and 68486 transitions. [2019-12-26 23:09:20,583 INFO L78 Accepts]: Start accepts. Automaton has 22201 states and 68486 transitions. Word has length 67 [2019-12-26 23:09:20,583 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:09:20,583 INFO L462 AbstractCegarLoop]: Abstraction has 22201 states and 68486 transitions. [2019-12-26 23:09:20,583 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:09:20,583 INFO L276 IsEmpty]: Start isEmpty. Operand 22201 states and 68486 transitions. [2019-12-26 23:09:20,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:09:20,607 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:09:20,608 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-26 23:09:20,608 INFO L410 AbstractCegarLoop]: === Iteration 32 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:09:20,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:09:20,608 INFO L82 PathProgramCache]: Analyzing trace with hash 1823504856, now seen corresponding path program 2 times [2019-12-26 23:09:20,608 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:09:20,608 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549308233] [2019-12-26 23:09:20,609 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:09:20,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 23:09:20,788 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-26 23:09:20,788 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549308233] [2019-12-26 23:09:20,788 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 23:09:20,788 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 23:09:20,789 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1734585927] [2019-12-26 23:09:20,789 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 23:09:20,789 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 23:09:20,789 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 23:09:20,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2019-12-26 23:09:20,790 INFO L87 Difference]: Start difference. First operand 22201 states and 68486 transitions. Second operand 12 states. [2019-12-26 23:09:23,612 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 23:09:23,613 INFO L93 Difference]: Finished difference Result 34048 states and 103837 transitions. [2019-12-26 23:09:23,613 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2019-12-26 23:09:23,613 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 67 [2019-12-26 23:09:23,613 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 23:09:23,661 INFO L225 Difference]: With dead ends: 34048 [2019-12-26 23:09:23,662 INFO L226 Difference]: Without dead ends: 33137 [2019-12-26 23:09:23,662 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=130, Invalid=520, Unknown=0, NotChecked=0, Total=650 [2019-12-26 23:09:23,785 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33137 states. [2019-12-26 23:09:24,069 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33137 to 22121. [2019-12-26 23:09:24,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22121 states. [2019-12-26 23:09:24,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22121 states to 22121 states and 68266 transitions. [2019-12-26 23:09:24,109 INFO L78 Accepts]: Start accepts. Automaton has 22121 states and 68266 transitions. Word has length 67 [2019-12-26 23:09:24,109 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 23:09:24,109 INFO L462 AbstractCegarLoop]: Abstraction has 22121 states and 68266 transitions. [2019-12-26 23:09:24,109 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 23:09:24,109 INFO L276 IsEmpty]: Start isEmpty. Operand 22121 states and 68266 transitions. [2019-12-26 23:09:24,131 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-26 23:09:24,131 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 23:09:24,131 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-26 23:09:24,131 INFO L410 AbstractCegarLoop]: === Iteration 33 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 23:09:24,132 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 23:09:24,132 INFO L82 PathProgramCache]: Analyzing trace with hash -1154306208, now seen corresponding path program 3 times [2019-12-26 23:09:24,132 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 23:09:24,132 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [110369282] [2019-12-26 23:09:24,132 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 23:09:24,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:09:24,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 23:09:24,253 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 23:09:24,253 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 23:09:24,258 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [895] [895] ULTIMATE.startENTRY-->L822: Formula: (let ((.cse0 (store |v_#valid_62| 0 0))) (and (= 0 v_~z$flush_delayed~0_27) (= 0 v_~x~0_129) (= 0 v_~__unbuffered_p1_EAX~0_44) (= v_~weak$$choice2~0_125 0) (= v_~z$read_delayed_var~0.offset_6 0) (= v_~z$r_buff0_thd1~0_274 0) (= |v_#NULL.offset_7| 0) (= v_~z$mem_tmp~0_16 0) (= v_~z$r_buff1_thd0~0_203 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1561~0.base_23|)) (= v_~main$tmp_guard1~0_48 0) (= 0 v_~z$r_buff0_thd3~0_416) (= |v_#valid_60| (store .cse0 |v_ULTIMATE.start_main_~#t1561~0.base_23| 1)) (= v_~z$w_buff1_used~0_618 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~__unbuffered_p2_EAX~0_39) (= v_~z$r_buff0_thd0~0_208 0) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$w_buff1~0_350 0) (= v_~z$w_buff0_used~0_900 0) (= 0 v_~__unbuffered_p0_EAX~0_137) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1561~0.base_23|) (= 0 |v_ULTIMATE.start_main_~#t1561~0.offset_17|) (= v_~z$read_delayed~0_7 0) (= v_~z$r_buff1_thd2~0_170 0) (= |v_#length_21| (store |v_#length_22| |v_ULTIMATE.start_main_~#t1561~0.base_23| 4)) (= 0 |v_#NULL.base_7|) (= 0 v_~z$r_buff1_thd3~0_300) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1561~0.base_23| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1561~0.base_23|) |v_ULTIMATE.start_main_~#t1561~0.offset_17| 0)) |v_#memory_int_17|) (= v_~z$r_buff1_thd1~0_166 0) (= v_~z$w_buff0~0_454 0) (= 0 v_~weak$$choice0~0_13) (= v_~z~0_160 0) (= v_~main$tmp_guard0~0_24 0) (= 0 v_~__unbuffered_cnt~0_97) (= v_~z$r_buff0_thd2~0_191 0) (= v_~y~0_31 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_18|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1562~0.base=|v_ULTIMATE.start_main_~#t1562~0.base_19|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_170, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_69|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_175|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_81|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_208, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_137, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_44, #length=|v_#length_21|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_39, ~z$mem_tmp~0=v_~z$mem_tmp~0_16, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_7|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_618, ~z$flush_delayed~0=v_~z$flush_delayed~0_27, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_166, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_416, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_97, ~x~0=v_~x~0_129, ULTIMATE.start_main_~#t1561~0.base=|v_ULTIMATE.start_main_~#t1561~0.base_23|, ~z$read_delayed~0=v_~z$read_delayed~0_7, ~z$w_buff1~0=v_~z$w_buff1~0_350, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_48, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_37|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_52|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_203, ~y~0=v_~y~0_31, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_191, ULTIMATE.start_main_~#t1563~0.offset=|v_ULTIMATE.start_main_~#t1563~0.offset_14|, ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_900, ~z$w_buff0~0=v_~z$w_buff0~0_454, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_8|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_300, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ULTIMATE.start_main_~#t1562~0.offset=|v_ULTIMATE.start_main_~#t1562~0.offset_12|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_~#t1563~0.base=|v_ULTIMATE.start_main_~#t1563~0.base_17|, ULTIMATE.start_main_~#t1561~0.offset=|v_ULTIMATE.start_main_~#t1561~0.offset_17|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_22|, #valid=|v_#valid_60|, #memory_int=|v_#memory_int_17|, ~z~0=v_~z~0_160, ~weak$$choice2~0=v_~weak$$choice2~0_125, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_274} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1562~0.base, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet45, ~z$w_buff1_used~0, ~z$flush_delayed~0, ~weak$$choice0~0, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1561~0.base, ~z$read_delayed~0, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_~#t1563~0.offset, ULTIMATE.start_main_#t~nondet46, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~nondet44, ~z$r_buff1_thd3~0, ~main$tmp_guard0~0, ULTIMATE.start_main_~#t1562~0.offset, #NULL.base, ULTIMATE.start_main_~#t1563~0.base, ULTIMATE.start_main_~#t1561~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:09:24,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [874] [874] L822-1-->L824: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1562~0.base_11| 0)) (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1562~0.base_11|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1562~0.base_11| 4)) (= |v_ULTIMATE.start_main_~#t1562~0.offset_9| 0) (= |v_#valid_38| (store |v_#valid_39| |v_ULTIMATE.start_main_~#t1562~0.base_11| 1)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1562~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1562~0.base_11|) |v_ULTIMATE.start_main_~#t1562~0.offset_9| 1)) |v_#memory_int_13|) (= 0 (select |v_#valid_39| |v_ULTIMATE.start_main_~#t1562~0.base_11|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_39|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1562~0.base=|v_ULTIMATE.start_main_~#t1562~0.base_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet44=|v_ULTIMATE.start_main_#t~nondet44_6|, #valid=|v_#valid_38|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|, ULTIMATE.start_main_~#t1562~0.offset=|v_ULTIMATE.start_main_~#t1562~0.offset_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1562~0.base, ULTIMATE.start_main_#t~nondet44, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1562~0.offset] because there is no mapped edge [2019-12-26 23:09:24,260 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L4-->L746: Formula: (and (= v_~z$r_buff0_thd2~0_29 v_~z$r_buff1_thd2~0_21) (= v_~__unbuffered_p0_EAX~0_8 v_~x~0_8) (= v_~z$r_buff0_thd0~0_28 v_~z$r_buff1_thd0~0_16) (= v_~z$r_buff0_thd1~0_26 1) (= v_~z$r_buff0_thd1~0_27 v_~z$r_buff1_thd1~0_15) (not (= v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20 0)) (= v_~z$r_buff0_thd3~0_67 v_~z$r_buff1_thd3~0_43)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_27, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_8, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_28, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_43, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_16, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_21, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_15, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_67, P0Thread1of1ForFork1___VERIFIER_assert_~expression=v_P0Thread1of1ForFork1___VERIFIER_assert_~expression_20, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_26, ~x~0=v_~x~0_8, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_29} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:09:24,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [833] [833] L766-2-->L766-4: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In239676308 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd2~0_In239676308 256)))) (or (and (= ~z$w_buff1~0_In239676308 |P1Thread1of1ForFork2_#t~ite9_Out239676308|) (not .cse0) (not .cse1)) (and (= ~z~0_In239676308 |P1Thread1of1ForFork2_#t~ite9_Out239676308|) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In239676308, ~z$w_buff1_used~0=~z$w_buff1_used~0_In239676308, ~z$w_buff1~0=~z$w_buff1~0_In239676308, ~z~0=~z~0_In239676308} OutVars{P1Thread1of1ForFork2_#t~ite9=|P1Thread1of1ForFork2_#t~ite9_Out239676308|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In239676308, ~z$w_buff1_used~0=~z$w_buff1_used~0_In239676308, ~z$w_buff1~0=~z$w_buff1~0_In239676308, ~z~0=~z~0_In239676308} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-26 23:09:24,262 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L766-4-->L767: Formula: (= v_~z~0_16 |v_P1Thread1of1ForFork2_#t~ite9_8|) InVars {P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_8|} OutVars{P1Thread1of1ForFork2_#t~ite9=|v_P1Thread1of1ForFork2_#t~ite9_7|, P1Thread1of1ForFork2_#t~ite10=|v_P1Thread1of1ForFork2_#t~ite10_7|, ~z~0=v_~z~0_16} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite9, P1Thread1of1ForFork2_#t~ite10, ~z~0] because there is no mapped edge [2019-12-26 23:09:24,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [871] [871] L824-1-->L826: Formula: (and (= (store |v_#valid_37| |v_ULTIMATE.start_main_~#t1563~0.base_13| 1) |v_#valid_36|) (not (= 0 |v_ULTIMATE.start_main_~#t1563~0.base_13|)) (= |v_ULTIMATE.start_main_~#t1563~0.offset_11| 0) (= 0 (select |v_#valid_37| |v_ULTIMATE.start_main_~#t1563~0.base_13|)) (= |v_#length_15| (store |v_#length_16| |v_ULTIMATE.start_main_~#t1563~0.base_13| 4)) (= (store |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1563~0.base_13| (store (select |v_#memory_int_12| |v_ULTIMATE.start_main_~#t1563~0.base_13|) |v_ULTIMATE.start_main_~#t1563~0.offset_11| 2)) |v_#memory_int_11|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1563~0.base_13|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_37|, #memory_int=|v_#memory_int_12|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, ULTIMATE.start_main_#t~nondet45=|v_ULTIMATE.start_main_#t~nondet45_5|, #memory_int=|v_#memory_int_11|, #length=|v_#length_15|, ULTIMATE.start_main_~#t1563~0.base=|v_ULTIMATE.start_main_~#t1563~0.base_13|, ULTIMATE.start_main_~#t1563~0.offset=|v_ULTIMATE.start_main_~#t1563~0.offset_11|} AuxVars[] AssignedVars[#valid, ULTIMATE.start_main_#t~nondet45, #memory_int, #length, ULTIMATE.start_main_~#t1563~0.base, ULTIMATE.start_main_~#t1563~0.offset] because there is no mapped edge [2019-12-26 23:09:24,263 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [841] [841] L767-->L767-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1468621749 256))) (.cse0 (= (mod ~z$r_buff0_thd2~0_In-1468621749 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1468621749 |P1Thread1of1ForFork2_#t~ite11_Out-1468621749|) (or .cse0 .cse1)) (and (= 0 |P1Thread1of1ForFork2_#t~ite11_Out-1468621749|) (not .cse1) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1468621749, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1468621749} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1468621749, P1Thread1of1ForFork2_#t~ite11=|P1Thread1of1ForFork2_#t~ite11_Out-1468621749|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1468621749} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-26 23:09:24,264 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] L768-->L768-2: Formula: (let ((.cse3 (= (mod ~z$r_buff0_thd2~0_In-1105854765 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In-1105854765 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1105854765 256))) (.cse0 (= (mod ~z$r_buff1_thd2~0_In-1105854765 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In-1105854765 |P1Thread1of1ForFork2_#t~ite12_Out-1105854765|)) (and (= 0 |P1Thread1of1ForFork2_#t~ite12_Out-1105854765|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1105854765, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1105854765, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1105854765, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1105854765} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1105854765, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In-1105854765, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1105854765, P1Thread1of1ForFork2_#t~ite12=|P1Thread1of1ForFork2_#t~ite12_Out-1105854765|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-1105854765} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite12] because there is no mapped edge [2019-12-26 23:09:24,268 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [842] [842] L769-->L769-2: Formula: (let ((.cse0 (= 0 (mod ~z$r_buff0_thd2~0_In1325484193 256))) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In1325484193 256)))) (or (and (= ~z$r_buff0_thd2~0_In1325484193 |P1Thread1of1ForFork2_#t~ite13_Out1325484193|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |P1Thread1of1ForFork2_#t~ite13_Out1325484193|) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1325484193, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1325484193} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1325484193, P1Thread1of1ForFork2_#t~ite13=|P1Thread1of1ForFork2_#t~ite13_Out1325484193|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1325484193} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite13] because there is no mapped edge [2019-12-26 23:09:24,271 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [875] [875] L790-->L790-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1679143859 256) 0))) (or (and (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1679143859 256) 0))) (or (and (= (mod ~z$r_buff1_thd3~0_In-1679143859 256) 0) .cse0) (and (= (mod ~z$w_buff1_used~0_In-1679143859 256) 0) .cse0) (= (mod ~z$w_buff0_used~0_In-1679143859 256) 0))) .cse1 (= |P2Thread1of1ForFork0_#t~ite27_Out-1679143859| |P2Thread1of1ForFork0_#t~ite26_Out-1679143859|) (= ~z$w_buff0_used~0_In-1679143859 |P2Thread1of1ForFork0_#t~ite26_Out-1679143859|)) (and (not .cse1) (= |P2Thread1of1ForFork0_#t~ite26_In-1679143859| |P2Thread1of1ForFork0_#t~ite26_Out-1679143859|) (= |P2Thread1of1ForFork0_#t~ite27_Out-1679143859| ~z$w_buff0_used~0_In-1679143859)))) InVars {P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_In-1679143859|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1679143859, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1679143859, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1679143859, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1679143859, ~weak$$choice2~0=~weak$$choice2~0_In-1679143859} OutVars{P2Thread1of1ForFork0_#t~ite26=|P2Thread1of1ForFork0_#t~ite26_Out-1679143859|, P2Thread1of1ForFork0_#t~ite27=|P2Thread1of1ForFork0_#t~ite27_Out-1679143859|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1679143859, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1679143859, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1679143859, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1679143859, ~weak$$choice2~0=~weak$$choice2~0_In-1679143859} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite26, P2Thread1of1ForFork0_#t~ite27] because there is no mapped edge [2019-12-26 23:09:24,273 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [810] [810] L792-->L793: Formula: (and (= v_~z$r_buff0_thd3~0_99 v_~z$r_buff0_thd3~0_100) (not (= 0 (mod v_~weak$$choice2~0_30 256)))) InVars {~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_100, ~weak$$choice2~0=v_~weak$$choice2~0_30} OutVars{P2Thread1of1ForFork0_#t~ite33=|v_P2Thread1of1ForFork0_#t~ite33_9|, P2Thread1of1ForFork0_#t~ite32=|v_P2Thread1of1ForFork0_#t~ite32_11|, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_99, P2Thread1of1ForFork0_#t~ite31=|v_P2Thread1of1ForFork0_#t~ite31_8|, ~weak$$choice2~0=v_~weak$$choice2~0_30} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite33, P2Thread1of1ForFork0_#t~ite32, ~z$r_buff0_thd3~0, P2Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-26 23:09:24,275 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [828] [828] L747-->L747-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-240970949 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-240970949 256)))) (or (and (or .cse0 .cse1) (= ~z$w_buff0_used~0_In-240970949 |P0Thread1of1ForFork1_#t~ite5_Out-240970949|)) (and (not .cse1) (= 0 |P0Thread1of1ForFork1_#t~ite5_Out-240970949|) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-240970949, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-240970949} OutVars{P0Thread1of1ForFork1_#t~ite5=|P0Thread1of1ForFork1_#t~ite5_Out-240970949|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-240970949, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-240970949} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite5] because there is no mapped edge [2019-12-26 23:09:24,276 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [814] [814] L795-->L799: Formula: (and (not (= (mod v_~z$flush_delayed~0_8 256) 0)) (= 0 v_~z$flush_delayed~0_7) (= v_~z~0_50 v_~z$mem_tmp~0_5)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_8} OutVars{P2Thread1of1ForFork0_#t~ite37=|v_P2Thread1of1ForFork0_#t~ite37_7|, ~z$mem_tmp~0=v_~z$mem_tmp~0_5, ~z$flush_delayed~0=v_~z$flush_delayed~0_7, ~z~0=v_~z~0_50} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite37, ~z$flush_delayed~0, ~z~0] because there is no mapped edge [2019-12-26 23:09:24,277 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [827] [827] L799-2-->L799-5: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In-361660620 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In-361660620 256))) (.cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out-361660620| |P2Thread1of1ForFork0_#t~ite39_Out-361660620|))) (or (and .cse0 (not .cse1) (not .cse2) (= |P2Thread1of1ForFork0_#t~ite38_Out-361660620| ~z$w_buff1~0_In-361660620)) (and (or .cse1 .cse2) .cse0 (= |P2Thread1of1ForFork0_#t~ite38_Out-361660620| ~z~0_In-361660620)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-361660620, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-361660620, ~z$w_buff1~0=~z$w_buff1~0_In-361660620, ~z~0=~z~0_In-361660620} OutVars{P2Thread1of1ForFork0_#t~ite39=|P2Thread1of1ForFork0_#t~ite39_Out-361660620|, P2Thread1of1ForFork0_#t~ite38=|P2Thread1of1ForFork0_#t~ite38_Out-361660620|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-361660620, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-361660620, ~z$w_buff1~0=~z$w_buff1~0_In-361660620, ~z~0=~z~0_In-361660620} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite39, P2Thread1of1ForFork0_#t~ite38] because there is no mapped edge [2019-12-26 23:09:24,278 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [843] [843] L800-->L800-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1405764287 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1405764287 256)))) (or (and (= ~z$w_buff0_used~0_In-1405764287 |P2Thread1of1ForFork0_#t~ite40_Out-1405764287|) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= 0 |P2Thread1of1ForFork0_#t~ite40_Out-1405764287|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1405764287, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1405764287} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1405764287, P2Thread1of1ForFork0_#t~ite40=|P2Thread1of1ForFork0_#t~ite40_Out-1405764287|, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1405764287} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite40] because there is no mapped edge [2019-12-26 23:09:24,279 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [836] [836] L801-->L801-2: Formula: (let ((.cse2 (= (mod ~z$r_buff0_thd3~0_In-836841246 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-836841246 256))) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-836841246 256))) (.cse0 (= (mod ~z$r_buff1_thd3~0_In-836841246 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork0_#t~ite41_Out-836841246|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~z$w_buff1_used~0_In-836841246 |P2Thread1of1ForFork0_#t~ite41_Out-836841246|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-836841246, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-836841246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-836841246, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-836841246} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-836841246, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-836841246, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-836841246, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-836841246, P2Thread1of1ForFork0_#t~ite41=|P2Thread1of1ForFork0_#t~ite41_Out-836841246|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite41] because there is no mapped edge [2019-12-26 23:09:24,280 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [824] [824] L802-->L802-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1484270622 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In-1484270622 256)))) (or (and (= |P2Thread1of1ForFork0_#t~ite42_Out-1484270622| 0) (not .cse0) (not .cse1)) (and (or .cse1 .cse0) (= |P2Thread1of1ForFork0_#t~ite42_Out-1484270622| ~z$r_buff0_thd3~0_In-1484270622)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1484270622, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1484270622} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1484270622, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1484270622, P2Thread1of1ForFork0_#t~ite42=|P2Thread1of1ForFork0_#t~ite42_Out-1484270622|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite42] because there is no mapped edge [2019-12-26 23:09:24,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [846] [846] L803-->L803-2: Formula: (let ((.cse2 (= 0 (mod ~z$w_buff0_used~0_In998153640 256))) (.cse3 (= 0 (mod ~z$r_buff0_thd3~0_In998153640 256))) (.cse0 (= (mod ~z$w_buff1_used~0_In998153640 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd3~0_In998153640 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork0_#t~ite43_Out998153640| ~z$r_buff1_thd3~0_In998153640) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork0_#t~ite43_Out998153640| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In998153640, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In998153640, ~z$w_buff1_used~0=~z$w_buff1_used~0_In998153640, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In998153640} OutVars{P2Thread1of1ForFork0_#t~ite43=|P2Thread1of1ForFork0_#t~ite43_Out998153640|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In998153640, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In998153640, ~z$w_buff1_used~0=~z$w_buff1_used~0_In998153640, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In998153640} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#t~ite43] because there is no mapped edge [2019-12-26 23:09:24,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [859] [859] L803-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd3~0_143 |v_P2Thread1of1ForFork0_#t~ite43_30|) (= (+ v_~__unbuffered_cnt~0_49 1) v_~__unbuffered_cnt~0_48) (= |v_P2Thread1of1ForFork0_#res.base_5| 0)) InVars {P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_30|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_49} OutVars{P2Thread1of1ForFork0_#res.base=|v_P2Thread1of1ForFork0_#res.base_5|, P2Thread1of1ForFork0_#t~ite43=|v_P2Thread1of1ForFork0_#t~ite43_29|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_143, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_48, P2Thread1of1ForFork0_#res.offset=|v_P2Thread1of1ForFork0_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork0_#res.base, P2Thread1of1ForFork0_#t~ite43, ~z$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork0_#res.offset] because there is no mapped edge [2019-12-26 23:09:24,281 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [847] [847] L748-->L748-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In1486685777 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd1~0_In1486685777 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1486685777 256))) (.cse3 (= (mod ~z$r_buff0_thd1~0_In1486685777 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In1486685777 |P0Thread1of1ForFork1_#t~ite6_Out1486685777|)) (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite6_Out1486685777|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1486685777, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1486685777, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1486685777, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1486685777} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1486685777, P0Thread1of1ForFork1_#t~ite6=|P0Thread1of1ForFork1_#t~ite6_Out1486685777|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1486685777, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1486685777, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1486685777} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite6] because there is no mapped edge [2019-12-26 23:09:24,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [845] [845] L749-->L750: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In1531533742 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1531533742 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out1531533742 0)) (and (or .cse1 .cse0) (= ~z$r_buff0_thd1~0_Out1531533742 ~z$r_buff0_thd1~0_In1531533742)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1531533742, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1531533742} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1531533742, P0Thread1of1ForFork1_#t~ite7=|P0Thread1of1ForFork1_#t~ite7_Out1531533742|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out1531533742} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 23:09:24,282 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [840] [840] L750-->L750-2: Formula: (let ((.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In1522226585 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1522226585 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In1522226585 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd1~0_In1522226585 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork1_#t~ite8_Out1522226585|)) (and (or .cse3 .cse2) (= ~z$r_buff1_thd1~0_In1522226585 |P0Thread1of1ForFork1_#t~ite8_Out1522226585|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1522226585, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1522226585, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1522226585, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1522226585} OutVars{P0Thread1of1ForFork1_#t~ite8=|P0Thread1of1ForFork1_#t~ite8_Out1522226585|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1522226585, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In1522226585, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1522226585, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In1522226585} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8] because there is no mapped edge [2019-12-26 23:09:24,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [866] [866] L750-2-->P0EXIT: Formula: (and (= v_~z$r_buff1_thd1~0_100 |v_P0Thread1of1ForFork1_#t~ite8_44|) (= 0 |v_P0Thread1of1ForFork1_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_67 1) v_~__unbuffered_cnt~0_66) (= 0 |v_P0Thread1of1ForFork1_#res.base_5|)) InVars {P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_44|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_67} OutVars{P0Thread1of1ForFork1_#t~ite8=|v_P0Thread1of1ForFork1_#t~ite8_43|, P0Thread1of1ForFork1_#res.offset=|v_P0Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_100, P0Thread1of1ForFork1_#res.base=|v_P0Thread1of1ForFork1_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_66} AuxVars[] AssignedVars[P0Thread1of1ForFork1_#t~ite8, P0Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd1~0, P0Thread1of1ForFork1_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-26 23:09:24,283 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [837] [837] L770-->L770-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In1228058467 256))) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In1228058467 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In1228058467 256) 0)) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In1228058467 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P1Thread1of1ForFork2_#t~ite14_Out1228058467| ~z$r_buff1_thd2~0_In1228058467)) (and (= |P1Thread1of1ForFork2_#t~ite14_Out1228058467| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1228058467, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1228058467, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1228058467, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1228058467} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1228058467, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1228058467, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1228058467, P1Thread1of1ForFork2_#t~ite14=|P1Thread1of1ForFork2_#t~ite14_Out1228058467|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1228058467} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-26 23:09:24,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [872] [872] L770-2-->P1EXIT: Formula: (and (= v_~z$r_buff1_thd2~0_120 |v_P1Thread1of1ForFork2_#t~ite14_34|) (= 0 |v_P1Thread1of1ForFork2_#res.offset_5|) (= v_~__unbuffered_cnt~0_76 (+ v_~__unbuffered_cnt~0_77 1)) (= 0 |v_P1Thread1of1ForFork2_#res.base_5|)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_77, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_34|} OutVars{P1Thread1of1ForFork2_#res.offset=|v_P1Thread1of1ForFork2_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_120, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_76, P1Thread1of1ForFork2_#t~ite14=|v_P1Thread1of1ForFork2_#t~ite14_33|, P1Thread1of1ForFork2_#res.base=|v_P1Thread1of1ForFork2_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork2_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork2_#t~ite14, P1Thread1of1ForFork2_#res.base] because there is no mapped edge [2019-12-26 23:09:24,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L826-1-->L832: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet46=|v_ULTIMATE.start_main_#t~nondet46_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet46, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-26 23:09:24,284 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] L832-2-->L832-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite48_Out-1550411210| |ULTIMATE.start_main_#t~ite47_Out-1550411210|)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In-1550411210 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1550411210 256)))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In-1550411210 |ULTIMATE.start_main_#t~ite47_Out-1550411210|) .cse2) (and (= ~z~0_In-1550411210 |ULTIMATE.start_main_#t~ite47_Out-1550411210|) .cse2 (or .cse1 .cse0)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1550411210, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1550411210, ~z$w_buff1~0=~z$w_buff1~0_In-1550411210, ~z~0=~z~0_In-1550411210} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-1550411210, ULTIMATE.start_main_#t~ite47=|ULTIMATE.start_main_#t~ite47_Out-1550411210|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1550411210, ~z$w_buff1~0=~z$w_buff1~0_In-1550411210, ULTIMATE.start_main_#t~ite48=|ULTIMATE.start_main_#t~ite48_Out-1550411210|, ~z~0=~z~0_In-1550411210} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-26 23:09:24,285 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [839] [839] L833-->L833-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In817252036 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In817252036 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite49_Out817252036| ~z$w_buff0_used~0_In817252036) (or .cse0 .cse1)) (and (= |ULTIMATE.start_main_#t~ite49_Out817252036| 0) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In817252036, ~z$w_buff0_used~0=~z$w_buff0_used~0_In817252036} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In817252036, ~z$w_buff0_used~0=~z$w_buff0_used~0_In817252036, ULTIMATE.start_main_#t~ite49=|ULTIMATE.start_main_#t~ite49_Out817252036|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite49] because there is no mapped edge [2019-12-26 23:09:24,286 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [830] [830] L834-->L834-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In2106169825 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd0~0_In2106169825 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In2106169825 256) 0)) (.cse2 (= (mod ~z$w_buff0_used~0_In2106169825 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite50_Out2106169825|)) (and (or .cse0 .cse1) (= ~z$w_buff1_used~0_In2106169825 |ULTIMATE.start_main_#t~ite50_Out2106169825|) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2106169825, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2106169825, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2106169825, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2106169825} OutVars{ULTIMATE.start_main_#t~ite50=|ULTIMATE.start_main_#t~ite50_Out2106169825|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In2106169825, ~z$w_buff0_used~0=~z$w_buff0_used~0_In2106169825, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In2106169825, ~z$w_buff1_used~0=~z$w_buff1_used~0_In2106169825} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite50] because there is no mapped edge [2019-12-26 23:09:24,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [821] [821] L835-->L835-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In1735250467 256))) (.cse0 (= (mod ~z$r_buff0_thd0~0_In1735250467 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite51_Out1735250467|) (not .cse0) (not .cse1)) (and (= ~z$r_buff0_thd0~0_In1735250467 |ULTIMATE.start_main_#t~ite51_Out1735250467|) (or .cse1 .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1735250467, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1735250467} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1735250467, ULTIMATE.start_main_#t~ite51=|ULTIMATE.start_main_#t~ite51_Out1735250467|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1735250467} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite51] because there is no mapped edge [2019-12-26 23:09:24,287 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [834] [834] L836-->L836-2: Formula: (let ((.cse3 (= 0 (mod ~z$w_buff0_used~0_In1788516199 256))) (.cse2 (= 0 (mod ~z$r_buff0_thd0~0_In1788516199 256))) (.cse1 (= (mod ~z$r_buff1_thd0~0_In1788516199 256) 0)) (.cse0 (= (mod ~z$w_buff1_used~0_In1788516199 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In1788516199 |ULTIMATE.start_main_#t~ite52_Out1788516199|)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0))) (= 0 |ULTIMATE.start_main_#t~ite52_Out1788516199|)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1788516199, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1788516199, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1788516199, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1788516199} OutVars{ULTIMATE.start_main_#t~ite52=|ULTIMATE.start_main_#t~ite52_Out1788516199|, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1788516199, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1788516199, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1788516199, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1788516199} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52] because there is no mapped edge [2019-12-26 23:09:24,288 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [879] [879] L836-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= 0 v_~__unbuffered_p1_EAX~0_25) (= v_~main$tmp_guard1~0_20 0) (= 0 v_~__unbuffered_p0_EAX~0_99) (= 0 v_~__unbuffered_p2_EAX~0_26) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_13|) (= v_~z$r_buff1_thd0~0_143 |v_ULTIMATE.start_main_#t~ite52_43|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_19 0)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_43|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_99, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_42|, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_19, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_25, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_143, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_26, 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, ~z$r_buff1_thd0~0, ~main$tmp_guard1~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 23:09:24,403 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 11:09:24 BasicIcfg [2019-12-26 23:09:24,404 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 23:09:24,407 INFO L168 Benchmark]: Toolchain (without parser) took 156682.07 ms. Allocated memory was 135.3 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 98.2 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 2.0 GB. Max. memory is 7.1 GB. [2019-12-26 23:09:24,408 INFO L168 Benchmark]: CDTParser took 0.23 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-26 23:09:24,409 INFO L168 Benchmark]: CACSL2BoogieTranslator took 920.37 ms. Allocated memory was 135.3 MB in the beginning and 199.8 MB in the end (delta: 64.5 MB). Free memory was 97.8 MB in the beginning and 150.6 MB in the end (delta: -52.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. [2019-12-26 23:09:24,409 INFO L168 Benchmark]: Boogie Procedure Inliner took 103.11 ms. Allocated memory is still 199.8 MB. Free memory was 150.6 MB in the beginning and 148.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. [2019-12-26 23:09:24,410 INFO L168 Benchmark]: Boogie Preprocessor took 73.90 ms. Allocated memory is still 199.8 MB. Free memory was 148.5 MB in the beginning and 145.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-26 23:09:24,410 INFO L168 Benchmark]: RCFGBuilder took 880.02 ms. Allocated memory is still 199.8 MB. Free memory was 145.6 MB in the beginning and 95.5 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. [2019-12-26 23:09:24,413 INFO L168 Benchmark]: TraceAbstraction took 154692.81 ms. Allocated memory was 199.8 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 94.7 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-26 23:09:24,419 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.23 ms. Allocated memory is still 135.3 MB. Free memory was 118.4 MB in the beginning and 118.2 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 920.37 ms. Allocated memory was 135.3 MB in the beginning and 199.8 MB in the end (delta: 64.5 MB). Free memory was 97.8 MB in the beginning and 150.6 MB in the end (delta: -52.9 MB). Peak memory consumption was 24.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 103.11 ms. Allocated memory is still 199.8 MB. Free memory was 150.6 MB in the beginning and 148.5 MB in the end (delta: 2.2 MB). Peak memory consumption was 2.2 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 73.90 ms. Allocated memory is still 199.8 MB. Free memory was 148.5 MB in the beginning and 145.6 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 880.02 ms. Allocated memory is still 199.8 MB. Free memory was 145.6 MB in the beginning and 95.5 MB in the end (delta: 50.1 MB). Peak memory consumption was 50.1 MB. Max. memory is 7.1 GB. * TraceAbstraction took 154692.81 ms. Allocated memory was 199.8 MB in the beginning and 3.9 GB in the end (delta: 3.7 GB). Free memory was 94.7 MB in the beginning and 1.9 GB in the end (delta: -1.8 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 6.0s, 176 ProgramPointsBefore, 95 ProgramPointsAfterwards, 213 TransitionsBefore, 107 TransitionsAfterwards, 19004 CoEnabledTransitionPairs, 12 FixpointIterations, 33 TrivialSequentialCompositions, 55 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 33 ConcurrentYvCompositions, 29 ChoiceCompositions, 7276 VarBasedMoverChecksPositive, 432 VarBasedMoverChecksNegative, 272 SemBasedMoverChecksPositive, 254 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 2.0s, 0 MoverChecksTotal, 130045 CheckedPairsTotal, 121 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L822] FCALL, FORK 0 pthread_create(&t1561, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L731] 1 z$w_buff1 = z$w_buff0 [L732] 1 z$w_buff0 = 1 [L733] 1 z$w_buff1_used = z$w_buff0_used [L734] 1 z$w_buff0_used = (_Bool)1 [L746] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L824] FCALL, FORK 0 pthread_create(&t1562, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L760] 2 x = 1 [L763] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L766] 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L767] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L826] FCALL, FORK 0 pthread_create(&t1563, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L780] 3 y = 1 [L783] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L784] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L785] 3 z$flush_delayed = weak$$choice2 [L786] 3 z$mem_tmp = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] EXPR 3 !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) VAL [!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L787] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L788] EXPR 3 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0))=1, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used=0, z$w_buff1=0, z$w_buff1_used=0] [L768] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L788] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L789] EXPR 3 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L789] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L790] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L791] EXPR 3 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L791] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L793] EXPR 3 weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0))=0, x=1, y=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L793] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, z=0, z$flush_delayed=1, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L746] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L747] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L799] EXPR 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2=0, z$w_buff1=0, z$w_buff1_used=0] [L799] 3 z = z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) [L800] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L801] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L802] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L748] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L769] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L832] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=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=1, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L833] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L834] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L835] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 167 locations, 2 error locations. Result: UNSAFE, OverallTime: 154.3s, OverallIterations: 33, TraceHistogramMax: 1, AutomataDifference: 77.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 8724 SDtfs, 11151 SDslu, 40428 SDs, 0 SdLazy, 53465 SolverSat, 727 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 42.6s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 731 GetRequests, 68 SyntacticMatches, 26 SemanticMatches, 637 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9719 ImplicationChecksByTransitivity, 12.3s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=158936occurred 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: 38.5s AutomataMinimizationTime, 32 MinimizatonAttempts, 264488 StatesRemovedByMinimization, 30 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.5s InterpolantComputationTime, 1717 NumberOfCodeBlocks, 1717 NumberOfCodeBlocksAsserted, 33 NumberOfCheckSat, 1618 ConstructedInterpolants, 0 QuantifiedInterpolants, 557394 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 32 InterpolantComputations, 32 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...