/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/safe004_power.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 14:28:44,452 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 14:28:44,456 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 14:28:44,469 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 14:28:44,470 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 14:28:44,471 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 14:28:44,472 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 14:28:44,474 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 14:28:44,476 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 14:28:44,476 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 14:28:44,477 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 14:28:44,479 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 14:28:44,479 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 14:28:44,480 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 14:28:44,481 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 14:28:44,482 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 14:28:44,483 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 14:28:44,484 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 14:28:44,485 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 14:28:44,488 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 14:28:44,489 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 14:28:44,491 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 14:28:44,492 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 14:28:44,493 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 14:28:44,495 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 14:28:44,496 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 14:28:44,496 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 14:28:44,497 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 14:28:44,497 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 14:28:44,499 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 14:28:44,499 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 14:28:44,500 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 14:28:44,501 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 14:28:44,501 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 14:28:44,502 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 14:28:44,503 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 14:28:44,503 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 14:28:44,504 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 14:28:44,504 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 14:28:44,505 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 14:28:44,506 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 14:28:44,506 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-18 14:28:44,521 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 14:28:44,521 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 14:28:44,523 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 14:28:44,523 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 14:28:44,523 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 14:28:44,523 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 14:28:44,523 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 14:28:44,525 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 14:28:44,525 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 14:28:44,525 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 14:28:44,525 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 14:28:44,526 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 14:28:44,526 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 14:28:44,526 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 14:28:44,526 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 14:28:44,526 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 14:28:44,526 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 14:28:44,528 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 14:28:44,528 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 14:28:44,528 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 14:28:44,529 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 14:28:44,529 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:28:44,529 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 14:28:44,529 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 14:28:44,529 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 14:28:44,530 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 14:28:44,530 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 14:28:44,530 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 14:28:44,530 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-18 14:28:44,530 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 14:28:44,823 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 14:28:44,847 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 14:28:44,851 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 14:28:44,852 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 14:28:44,853 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 14:28:44,854 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe004_power.opt.i [2019-12-18 14:28:44,928 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd503b9b4/60d9040223d8427baac744042adf376d/FLAG557672637 [2019-12-18 14:28:45,491 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 14:28:45,492 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe004_power.opt.i [2019-12-18 14:28:45,508 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd503b9b4/60d9040223d8427baac744042adf376d/FLAG557672637 [2019-12-18 14:28:45,741 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cd503b9b4/60d9040223d8427baac744042adf376d [2019-12-18 14:28:45,749 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 14:28:45,751 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 14:28:45,752 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 14:28:45,753 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 14:28:45,758 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 14:28:45,759 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:28:45" (1/1) ... [2019-12-18 14:28:45,761 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1281af7e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:28:45, skipping insertion in model container [2019-12-18 14:28:45,762 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 02:28:45" (1/1) ... [2019-12-18 14:28:45,770 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 14:28:45,829 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 14:28:46,347 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:28:46,366 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 14:28:46,454 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 14:28:46,532 INFO L208 MainTranslator]: Completed translation [2019-12-18 14:28:46,532 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:28:46 WrapperNode [2019-12-18 14:28:46,533 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 14:28:46,534 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 14:28:46,534 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 14:28:46,534 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 14:28:46,543 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:28:46" (1/1) ... [2019-12-18 14:28:46,564 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:28:46" (1/1) ... [2019-12-18 14:28:46,602 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 14:28:46,603 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 14:28:46,603 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 14:28:46,603 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 14:28:46,613 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:28:46" (1/1) ... [2019-12-18 14:28:46,614 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:28:46" (1/1) ... [2019-12-18 14:28:46,619 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:28:46" (1/1) ... [2019-12-18 14:28:46,620 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:28:46" (1/1) ... [2019-12-18 14:28:46,630 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:28:46" (1/1) ... [2019-12-18 14:28:46,634 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:28:46" (1/1) ... [2019-12-18 14:28:46,638 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:28:46" (1/1) ... [2019-12-18 14:28:46,643 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 14:28:46,644 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 14:28:46,644 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 14:28:46,644 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 14:28:46,645 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:28:46" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 14:28:46,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 14:28:46,703 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 14:28:46,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 14:28:46,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 14:28:46,704 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 14:28:46,704 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 14:28:46,704 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 14:28:46,704 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 14:28:46,705 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 14:28:46,705 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 14:28:46,705 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 14:28:46,705 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 14:28:46,705 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 14:28:46,707 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 14:28:47,494 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 14:28:47,495 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 14:28:47,496 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:28:47 BoogieIcfgContainer [2019-12-18 14:28:47,496 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 14:28:47,497 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 14:28:47,498 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 14:28:47,501 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 14:28:47,501 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 02:28:45" (1/3) ... [2019-12-18 14:28:47,502 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c1dd0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:28:47, skipping insertion in model container [2019-12-18 14:28:47,502 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 02:28:46" (2/3) ... [2019-12-18 14:28:47,503 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@9c1dd0c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 02:28:47, skipping insertion in model container [2019-12-18 14:28:47,503 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 02:28:47" (3/3) ... [2019-12-18 14:28:47,505 INFO L109 eAbstractionObserver]: Analyzing ICFG safe004_power.opt.i [2019-12-18 14:28:47,514 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 14:28:47,515 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 14:28:47,527 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 14:28:47,528 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 14:28:47,567 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,568 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,568 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,569 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,569 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,570 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,571 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,572 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,573 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,574 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,575 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,576 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,577 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,577 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,578 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,578 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,578 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,578 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,579 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,579 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,580 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,581 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,582 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,583 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,584 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,585 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,586 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,586 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,586 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,587 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,588 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,589 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,590 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,591 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,612 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,613 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,614 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,617 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,618 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,619 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,619 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,619 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,633 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,633 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,641 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,642 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,642 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,643 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,644 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,650 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,650 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,650 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,651 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,652 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 14:28:47,668 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 14:28:47,695 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 14:28:47,695 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 14:28:47,695 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 14:28:47,696 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 14:28:47,696 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 14:28:47,696 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 14:28:47,696 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 14:28:47,696 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 14:28:47,716 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-18 14:28:47,718 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 14:28:47,830 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 14:28:47,830 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:28:47,852 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:28:47,875 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 14:28:47,966 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 14:28:47,966 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 14:28:47,977 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 331 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 14:28:47,997 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17074 [2019-12-18 14:28:47,999 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 14:28:53,399 WARN L192 SmtUtils]: Spent 263.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 14:28:53,515 WARN L192 SmtUtils]: Spent 113.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 14:28:53,546 INFO L206 etLargeBlockEncoding]: Checked pairs total: 78277 [2019-12-18 14:28:53,546 INFO L214 etLargeBlockEncoding]: Total number of compositions: 111 [2019-12-18 14:28:53,550 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 94 places, 106 transitions [2019-12-18 14:29:09,603 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 107408 states. [2019-12-18 14:29:09,606 INFO L276 IsEmpty]: Start isEmpty. Operand 107408 states. [2019-12-18 14:29:09,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-18 14:29:09,611 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:29:09,612 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-18 14:29:09,613 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:29:09,619 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:29:09,619 INFO L82 PathProgramCache]: Analyzing trace with hash 809703812, now seen corresponding path program 1 times [2019-12-18 14:29:09,627 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:29:09,627 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155460872] [2019-12-18 14:29:09,628 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:29:09,767 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:29:09,882 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-18 14:29:09,883 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155460872] [2019-12-18 14:29:09,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:29:09,884 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 14:29:09,884 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [986249632] [2019-12-18 14:29:09,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:29:09,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:29:09,903 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:29:09,904 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:29:09,906 INFO L87 Difference]: Start difference. First operand 107408 states. Second operand 3 states. [2019-12-18 14:29:12,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:29:12,772 INFO L93 Difference]: Finished difference Result 107108 states and 460900 transitions. [2019-12-18 14:29:12,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:29:12,774 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-18 14:29:12,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:29:13,453 INFO L225 Difference]: With dead ends: 107108 [2019-12-18 14:29:13,453 INFO L226 Difference]: Without dead ends: 104924 [2019-12-18 14:29:13,455 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-18 14:29:17,109 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104924 states. [2019-12-18 14:29:21,361 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104924 to 104924. [2019-12-18 14:29:21,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104924 states. [2019-12-18 14:29:22,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104924 states to 104924 states and 451982 transitions. [2019-12-18 14:29:22,592 INFO L78 Accepts]: Start accepts. Automaton has 104924 states and 451982 transitions. Word has length 5 [2019-12-18 14:29:22,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:29:22,592 INFO L462 AbstractCegarLoop]: Abstraction has 104924 states and 451982 transitions. [2019-12-18 14:29:22,592 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:29:22,592 INFO L276 IsEmpty]: Start isEmpty. Operand 104924 states and 451982 transitions. [2019-12-18 14:29:22,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 14:29:22,595 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:29:22,596 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:29:22,596 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:29:22,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:29:22,596 INFO L82 PathProgramCache]: Analyzing trace with hash 2105056515, now seen corresponding path program 1 times [2019-12-18 14:29:22,597 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:29:22,597 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896360517] [2019-12-18 14:29:22,597 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:29:22,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:29:22,711 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-18 14:29:22,711 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896360517] [2019-12-18 14:29:22,711 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:29:22,712 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:29:22,712 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [670424704] [2019-12-18 14:29:22,713 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:29:22,714 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:29:22,714 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:29:22,714 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:29:22,715 INFO L87 Difference]: Start difference. First operand 104924 states and 451982 transitions. Second operand 4 states. [2019-12-18 14:29:28,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:29:28,537 INFO L93 Difference]: Finished difference Result 168606 states and 697152 transitions. [2019-12-18 14:29:28,537 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:29:28,537 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 14:29:28,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:29:29,137 INFO L225 Difference]: With dead ends: 168606 [2019-12-18 14:29:29,137 INFO L226 Difference]: Without dead ends: 168557 [2019-12-18 14:29:29,138 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:29:33,265 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 168557 states. [2019-12-18 14:29:35,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 168557 to 152629. [2019-12-18 14:29:35,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 152629 states. [2019-12-18 14:29:42,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152629 states to 152629 states and 638547 transitions. [2019-12-18 14:29:42,351 INFO L78 Accepts]: Start accepts. Automaton has 152629 states and 638547 transitions. Word has length 11 [2019-12-18 14:29:42,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:29:42,351 INFO L462 AbstractCegarLoop]: Abstraction has 152629 states and 638547 transitions. [2019-12-18 14:29:42,351 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:29:42,351 INFO L276 IsEmpty]: Start isEmpty. Operand 152629 states and 638547 transitions. [2019-12-18 14:29:42,358 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:29:42,358 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:29:42,358 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:29:42,359 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:29:42,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:29:42,359 INFO L82 PathProgramCache]: Analyzing trace with hash 2027270657, now seen corresponding path program 1 times [2019-12-18 14:29:42,359 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:29:42,360 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1045486897] [2019-12-18 14:29:42,360 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:29:42,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:29:42,452 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-18 14:29:42,453 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1045486897] [2019-12-18 14:29:42,453 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:29:42,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:29:42,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [106988369] [2019-12-18 14:29:42,454 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:29:42,454 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:29:42,454 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:29:42,455 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:29:42,455 INFO L87 Difference]: Start difference. First operand 152629 states and 638547 transitions. Second operand 4 states. [2019-12-18 14:29:49,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:29:49,892 INFO L93 Difference]: Finished difference Result 217678 states and 889823 transitions. [2019-12-18 14:29:49,893 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:29:49,893 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 14:29:49,893 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:29:50,609 INFO L225 Difference]: With dead ends: 217678 [2019-12-18 14:29:50,609 INFO L226 Difference]: Without dead ends: 217615 [2019-12-18 14:29:50,610 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:29:54,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 217615 states. [2019-12-18 14:29:59,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 217615 to 183279. [2019-12-18 14:29:59,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 183279 states. [2019-12-18 14:30:01,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183279 states to 183279 states and 761454 transitions. [2019-12-18 14:30:01,495 INFO L78 Accepts]: Start accepts. Automaton has 183279 states and 761454 transitions. Word has length 13 [2019-12-18 14:30:01,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:01,496 INFO L462 AbstractCegarLoop]: Abstraction has 183279 states and 761454 transitions. [2019-12-18 14:30:01,496 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:30:01,496 INFO L276 IsEmpty]: Start isEmpty. Operand 183279 states and 761454 transitions. [2019-12-18 14:30:01,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 14:30:01,500 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:01,500 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 14:30:01,500 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:01,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:01,500 INFO L82 PathProgramCache]: Analyzing trace with hash 1789207667, now seen corresponding path program 1 times [2019-12-18 14:30:01,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:01,501 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [142674722] [2019-12-18 14:30:01,501 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:01,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:01,595 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-18 14:30:01,596 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [142674722] [2019-12-18 14:30:01,596 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:01,596 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:30:01,597 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681392230] [2019-12-18 14:30:01,597 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:30:01,597 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:01,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:30:01,598 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:30:01,599 INFO L87 Difference]: Start difference. First operand 183279 states and 761454 transitions. Second operand 3 states. [2019-12-18 14:30:01,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:01,745 INFO L93 Difference]: Finished difference Result 36985 states and 120640 transitions. [2019-12-18 14:30:01,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:30:01,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 14:30:01,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:01,832 INFO L225 Difference]: With dead ends: 36985 [2019-12-18 14:30:01,832 INFO L226 Difference]: Without dead ends: 36985 [2019-12-18 14:30:01,832 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-18 14:30:02,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36985 states. [2019-12-18 14:30:02,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36985 to 36985. [2019-12-18 14:30:02,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36985 states. [2019-12-18 14:30:02,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36985 states to 36985 states and 120640 transitions. [2019-12-18 14:30:02,760 INFO L78 Accepts]: Start accepts. Automaton has 36985 states and 120640 transitions. Word has length 13 [2019-12-18 14:30:02,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:02,760 INFO L462 AbstractCegarLoop]: Abstraction has 36985 states and 120640 transitions. [2019-12-18 14:30:02,760 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:30:02,761 INFO L276 IsEmpty]: Start isEmpty. Operand 36985 states and 120640 transitions. [2019-12-18 14:30:02,765 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 14:30:02,765 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:02,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] [2019-12-18 14:30:02,765 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:02,765 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:02,766 INFO L82 PathProgramCache]: Analyzing trace with hash 1405830784, now seen corresponding path program 1 times [2019-12-18 14:30:02,766 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:02,766 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430589368] [2019-12-18 14:30:02,766 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:02,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:02,920 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-18 14:30:02,921 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430589368] [2019-12-18 14:30:02,921 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:02,921 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:30:02,921 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727591607] [2019-12-18 14:30:02,922 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:30:02,922 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:02,922 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:30:02,922 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:30:02,922 INFO L87 Difference]: Start difference. First operand 36985 states and 120640 transitions. Second operand 5 states. [2019-12-18 14:30:04,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:04,289 INFO L93 Difference]: Finished difference Result 50257 states and 160609 transitions. [2019-12-18 14:30:04,290 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:30:04,290 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 14:30:04,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:04,384 INFO L225 Difference]: With dead ends: 50257 [2019-12-18 14:30:04,385 INFO L226 Difference]: Without dead ends: 50244 [2019-12-18 14:30:04,385 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:30:04,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50244 states. [2019-12-18 14:30:05,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50244 to 37328. [2019-12-18 14:30:05,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37328 states. [2019-12-18 14:30:05,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37328 states to 37328 states and 121606 transitions. [2019-12-18 14:30:05,083 INFO L78 Accepts]: Start accepts. Automaton has 37328 states and 121606 transitions. Word has length 19 [2019-12-18 14:30:05,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:05,083 INFO L462 AbstractCegarLoop]: Abstraction has 37328 states and 121606 transitions. [2019-12-18 14:30:05,083 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:30:05,083 INFO L276 IsEmpty]: Start isEmpty. Operand 37328 states and 121606 transitions. [2019-12-18 14:30:05,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 14:30:05,094 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:05,094 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-18 14:30:05,094 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:05,094 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:05,095 INFO L82 PathProgramCache]: Analyzing trace with hash -1721998258, now seen corresponding path program 1 times [2019-12-18 14:30:05,095 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:05,095 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959007752] [2019-12-18 14:30:05,095 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:05,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:05,142 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-18 14:30:05,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959007752] [2019-12-18 14:30:05,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:05,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:30:05,143 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178743060] [2019-12-18 14:30:05,143 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 14:30:05,143 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:05,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 14:30:05,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 14:30:05,144 INFO L87 Difference]: Start difference. First operand 37328 states and 121606 transitions. Second operand 4 states. [2019-12-18 14:30:05,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:05,183 INFO L93 Difference]: Finished difference Result 7104 states and 19431 transitions. [2019-12-18 14:30:05,184 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 14:30:05,184 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 14:30:05,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:05,195 INFO L225 Difference]: With dead ends: 7104 [2019-12-18 14:30:05,195 INFO L226 Difference]: Without dead ends: 7104 [2019-12-18 14:30:05,196 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-18 14:30:05,224 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7104 states. [2019-12-18 14:30:05,282 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7104 to 6992. [2019-12-18 14:30:05,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6992 states. [2019-12-18 14:30:05,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6992 states to 6992 states and 19111 transitions. [2019-12-18 14:30:05,292 INFO L78 Accepts]: Start accepts. Automaton has 6992 states and 19111 transitions. Word has length 25 [2019-12-18 14:30:05,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:05,293 INFO L462 AbstractCegarLoop]: Abstraction has 6992 states and 19111 transitions. [2019-12-18 14:30:05,293 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 14:30:05,293 INFO L276 IsEmpty]: Start isEmpty. Operand 6992 states and 19111 transitions. [2019-12-18 14:30:05,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 14:30:05,304 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:05,304 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] [2019-12-18 14:30:05,304 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:05,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:05,305 INFO L82 PathProgramCache]: Analyzing trace with hash 2138974623, now seen corresponding path program 1 times [2019-12-18 14:30:05,305 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:05,305 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1900035916] [2019-12-18 14:30:05,305 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:05,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:05,374 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-18 14:30:05,374 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1900035916] [2019-12-18 14:30:05,375 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:05,375 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 14:30:05,375 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [124232936] [2019-12-18 14:30:05,375 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:30:05,376 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:05,376 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:30:05,376 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:30:05,376 INFO L87 Difference]: Start difference. First operand 6992 states and 19111 transitions. Second operand 5 states. [2019-12-18 14:30:05,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:05,415 INFO L93 Difference]: Finished difference Result 5024 states and 14421 transitions. [2019-12-18 14:30:05,415 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 14:30:05,415 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 14:30:05,416 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:05,423 INFO L225 Difference]: With dead ends: 5024 [2019-12-18 14:30:05,424 INFO L226 Difference]: Without dead ends: 5024 [2019-12-18 14:30:05,424 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-18 14:30:05,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5024 states. [2019-12-18 14:30:05,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5024 to 4660. [2019-12-18 14:30:05,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4660 states. [2019-12-18 14:30:05,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4660 states to 4660 states and 13437 transitions. [2019-12-18 14:30:05,491 INFO L78 Accepts]: Start accepts. Automaton has 4660 states and 13437 transitions. Word has length 37 [2019-12-18 14:30:05,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:05,492 INFO L462 AbstractCegarLoop]: Abstraction has 4660 states and 13437 transitions. [2019-12-18 14:30:05,492 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:30:05,492 INFO L276 IsEmpty]: Start isEmpty. Operand 4660 states and 13437 transitions. [2019-12-18 14:30:05,499 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:30:05,499 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:05,501 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-18 14:30:05,501 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:05,501 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:05,501 INFO L82 PathProgramCache]: Analyzing trace with hash 1030638940, now seen corresponding path program 1 times [2019-12-18 14:30:05,501 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:05,502 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462000350] [2019-12-18 14:30:05,502 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:05,525 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:05,573 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:30:05,574 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462000350] [2019-12-18 14:30:05,574 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:05,574 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:30:05,574 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [378170277] [2019-12-18 14:30:05,575 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:30:05,575 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:05,575 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:30:05,575 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:30:05,576 INFO L87 Difference]: Start difference. First operand 4660 states and 13437 transitions. Second operand 3 states. [2019-12-18 14:30:05,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:05,632 INFO L93 Difference]: Finished difference Result 4669 states and 13450 transitions. [2019-12-18 14:30:05,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:30:05,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:30:05,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:05,640 INFO L225 Difference]: With dead ends: 4669 [2019-12-18 14:30:05,640 INFO L226 Difference]: Without dead ends: 4669 [2019-12-18 14:30:05,641 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-18 14:30:05,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-18 14:30:05,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-18 14:30:05,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-18 14:30:05,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13446 transitions. [2019-12-18 14:30:05,701 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13446 transitions. Word has length 65 [2019-12-18 14:30:05,701 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:05,701 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13446 transitions. [2019-12-18 14:30:05,701 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:30:05,701 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13446 transitions. [2019-12-18 14:30:05,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:30:05,707 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:05,708 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-18 14:30:05,708 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:05,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:05,708 INFO L82 PathProgramCache]: Analyzing trace with hash 1902070617, now seen corresponding path program 1 times [2019-12-18 14:30:05,708 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:05,708 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1948800800] [2019-12-18 14:30:05,708 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:05,729 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:05,779 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-18 14:30:05,780 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1948800800] [2019-12-18 14:30:05,780 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:05,780 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 14:30:05,780 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1975929557] [2019-12-18 14:30:05,781 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:30:05,781 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:05,781 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:30:05,782 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:30:05,782 INFO L87 Difference]: Start difference. First operand 4665 states and 13446 transitions. Second operand 3 states. [2019-12-18 14:30:05,832 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:05,832 INFO L93 Difference]: Finished difference Result 4669 states and 13441 transitions. [2019-12-18 14:30:05,832 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:30:05,832 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:30:05,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:05,839 INFO L225 Difference]: With dead ends: 4669 [2019-12-18 14:30:05,839 INFO L226 Difference]: Without dead ends: 4669 [2019-12-18 14:30:05,839 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-18 14:30:05,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4669 states. [2019-12-18 14:30:05,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4669 to 4665. [2019-12-18 14:30:05,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4665 states. [2019-12-18 14:30:05,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4665 states to 4665 states and 13437 transitions. [2019-12-18 14:30:05,899 INFO L78 Accepts]: Start accepts. Automaton has 4665 states and 13437 transitions. Word has length 65 [2019-12-18 14:30:05,899 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:05,899 INFO L462 AbstractCegarLoop]: Abstraction has 4665 states and 13437 transitions. [2019-12-18 14:30:05,899 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:30:05,900 INFO L276 IsEmpty]: Start isEmpty. Operand 4665 states and 13437 transitions. [2019-12-18 14:30:05,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:30:05,906 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:05,906 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-18 14:30:05,907 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:05,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:05,907 INFO L82 PathProgramCache]: Analyzing trace with hash 1892358751, now seen corresponding path program 1 times [2019-12-18 14:30:05,907 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:05,908 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830085312] [2019-12-18 14:30:05,908 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:05,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:06,022 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-18 14:30:06,023 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830085312] [2019-12-18 14:30:06,023 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:06,023 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:30:06,023 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [870579610] [2019-12-18 14:30:06,024 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:30:06,024 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:06,024 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:30:06,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:30:06,025 INFO L87 Difference]: Start difference. First operand 4665 states and 13437 transitions. Second operand 6 states. [2019-12-18 14:30:06,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:06,716 INFO L93 Difference]: Finished difference Result 8765 states and 25085 transitions. [2019-12-18 14:30:06,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:30:06,716 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 65 [2019-12-18 14:30:06,717 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:06,727 INFO L225 Difference]: With dead ends: 8765 [2019-12-18 14:30:06,727 INFO L226 Difference]: Without dead ends: 8765 [2019-12-18 14:30:06,727 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:30:06,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8765 states. [2019-12-18 14:30:06,803 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8765 to 5421. [2019-12-18 14:30:06,803 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5421 states. [2019-12-18 14:30:06,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5421 states to 5421 states and 15667 transitions. [2019-12-18 14:30:06,811 INFO L78 Accepts]: Start accepts. Automaton has 5421 states and 15667 transitions. Word has length 65 [2019-12-18 14:30:06,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:06,812 INFO L462 AbstractCegarLoop]: Abstraction has 5421 states and 15667 transitions. [2019-12-18 14:30:06,812 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:30:06,812 INFO L276 IsEmpty]: Start isEmpty. Operand 5421 states and 15667 transitions. [2019-12-18 14:30:06,819 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:30:06,819 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:06,819 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-18 14:30:06,819 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:06,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:06,819 INFO L82 PathProgramCache]: Analyzing trace with hash -191494421, now seen corresponding path program 2 times [2019-12-18 14:30:06,820 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:06,820 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1023692421] [2019-12-18 14:30:06,820 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:06,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:06,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:30:06,907 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1023692421] [2019-12-18 14:30:06,907 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:06,908 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:30:06,908 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [561543468] [2019-12-18 14:30:06,908 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 14:30:06,908 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:06,909 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 14:30:06,909 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 14:30:06,909 INFO L87 Difference]: Start difference. First operand 5421 states and 15667 transitions. Second operand 5 states. [2019-12-18 14:30:07,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:07,241 INFO L93 Difference]: Finished difference Result 7981 states and 22730 transitions. [2019-12-18 14:30:07,242 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:30:07,242 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 14:30:07,242 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:07,255 INFO L225 Difference]: With dead ends: 7981 [2019-12-18 14:30:07,255 INFO L226 Difference]: Without dead ends: 7981 [2019-12-18 14:30:07,256 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 SyntacticMatches, 1 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:30:07,288 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7981 states. [2019-12-18 14:30:07,364 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7981 to 5923. [2019-12-18 14:30:07,364 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5923 states. [2019-12-18 14:30:07,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5923 states to 5923 states and 17159 transitions. [2019-12-18 14:30:07,374 INFO L78 Accepts]: Start accepts. Automaton has 5923 states and 17159 transitions. Word has length 65 [2019-12-18 14:30:07,374 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:07,374 INFO L462 AbstractCegarLoop]: Abstraction has 5923 states and 17159 transitions. [2019-12-18 14:30:07,374 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 14:30:07,374 INFO L276 IsEmpty]: Start isEmpty. Operand 5923 states and 17159 transitions. [2019-12-18 14:30:07,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 14:30:07,383 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:07,383 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-18 14:30:07,383 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:07,383 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:07,383 INFO L82 PathProgramCache]: Analyzing trace with hash 147719209, now seen corresponding path program 3 times [2019-12-18 14:30:07,384 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:07,384 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1126209045] [2019-12-18 14:30:07,384 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:07,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:07,481 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-18 14:30:07,481 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1126209045] [2019-12-18 14:30:07,481 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:07,482 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:30:07,482 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540916176] [2019-12-18 14:30:07,482 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:30:07,482 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:07,483 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:30:07,483 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:30:07,483 INFO L87 Difference]: Start difference. First operand 5923 states and 17159 transitions. Second operand 3 states. [2019-12-18 14:30:07,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:07,518 INFO L93 Difference]: Finished difference Result 5119 states and 14578 transitions. [2019-12-18 14:30:07,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:30:07,519 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 14:30:07,519 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:07,528 INFO L225 Difference]: With dead ends: 5119 [2019-12-18 14:30:07,528 INFO L226 Difference]: Without dead ends: 5119 [2019-12-18 14:30:07,529 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-18 14:30:07,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5119 states. [2019-12-18 14:30:07,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5119 to 4839. [2019-12-18 14:30:07,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4839 states. [2019-12-18 14:30:07,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4839 states to 4839 states and 13806 transitions. [2019-12-18 14:30:07,647 INFO L78 Accepts]: Start accepts. Automaton has 4839 states and 13806 transitions. Word has length 65 [2019-12-18 14:30:07,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:07,648 INFO L462 AbstractCegarLoop]: Abstraction has 4839 states and 13806 transitions. [2019-12-18 14:30:07,648 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:30:07,648 INFO L276 IsEmpty]: Start isEmpty. Operand 4839 states and 13806 transitions. [2019-12-18 14:30:07,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:30:07,660 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:07,660 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-18 14:30:07,661 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:07,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:07,661 INFO L82 PathProgramCache]: Analyzing trace with hash 2002555555, now seen corresponding path program 1 times [2019-12-18 14:30:07,661 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:07,662 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837432878] [2019-12-18 14:30:07,662 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:07,704 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:07,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 14:30:07,834 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837432878] [2019-12-18 14:30:07,835 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:07,835 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:30:07,835 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [506955510] [2019-12-18 14:30:07,835 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:30:07,836 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:07,836 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:30:07,836 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:30:07,837 INFO L87 Difference]: Start difference. First operand 4839 states and 13806 transitions. Second operand 6 states. [2019-12-18 14:30:08,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:08,276 INFO L93 Difference]: Finished difference Result 7011 states and 19683 transitions. [2019-12-18 14:30:08,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 14:30:08,277 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 14:30:08,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:08,287 INFO L225 Difference]: With dead ends: 7011 [2019-12-18 14:30:08,287 INFO L226 Difference]: Without dead ends: 7011 [2019-12-18 14:30:08,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2019-12-18 14:30:08,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7011 states. [2019-12-18 14:30:08,359 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7011 to 5532. [2019-12-18 14:30:08,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5532 states. [2019-12-18 14:30:08,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5532 states to 5532 states and 15751 transitions. [2019-12-18 14:30:08,369 INFO L78 Accepts]: Start accepts. Automaton has 5532 states and 15751 transitions. Word has length 66 [2019-12-18 14:30:08,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:08,369 INFO L462 AbstractCegarLoop]: Abstraction has 5532 states and 15751 transitions. [2019-12-18 14:30:08,369 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:30:08,369 INFO L276 IsEmpty]: Start isEmpty. Operand 5532 states and 15751 transitions. [2019-12-18 14:30:08,377 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:30:08,377 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:08,377 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-18 14:30:08,377 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:08,377 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:08,377 INFO L82 PathProgramCache]: Analyzing trace with hash -2081518173, now seen corresponding path program 2 times [2019-12-18 14:30:08,378 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:08,378 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1846498803] [2019-12-18 14:30:08,378 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:08,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:08,467 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-18 14:30:08,468 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1846498803] [2019-12-18 14:30:08,468 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:08,468 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:30:08,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1615853832] [2019-12-18 14:30:08,469 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:30:08,469 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:08,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:30:08,469 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:30:08,469 INFO L87 Difference]: Start difference. First operand 5532 states and 15751 transitions. Second operand 6 states. [2019-12-18 14:30:08,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:08,927 INFO L93 Difference]: Finished difference Result 7597 states and 21220 transitions. [2019-12-18 14:30:08,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-18 14:30:08,928 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 66 [2019-12-18 14:30:08,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:08,939 INFO L225 Difference]: With dead ends: 7597 [2019-12-18 14:30:08,939 INFO L226 Difference]: Without dead ends: 7597 [2019-12-18 14:30:08,940 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 4 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:30:08,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7597 states. [2019-12-18 14:30:09,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7597 to 5931. [2019-12-18 14:30:09,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5931 states. [2019-12-18 14:30:09,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5931 states to 5931 states and 16730 transitions. [2019-12-18 14:30:09,077 INFO L78 Accepts]: Start accepts. Automaton has 5931 states and 16730 transitions. Word has length 66 [2019-12-18 14:30:09,077 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:09,078 INFO L462 AbstractCegarLoop]: Abstraction has 5931 states and 16730 transitions. [2019-12-18 14:30:09,078 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:30:09,078 INFO L276 IsEmpty]: Start isEmpty. Operand 5931 states and 16730 transitions. [2019-12-18 14:30:09,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:30:09,089 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:09,090 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-18 14:30:09,090 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:09,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:09,090 INFO L82 PathProgramCache]: Analyzing trace with hash -1769494633, now seen corresponding path program 3 times [2019-12-18 14:30:09,090 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:09,091 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1093310543] [2019-12-18 14:30:09,091 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:09,109 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:09,222 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-18 14:30:09,223 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1093310543] [2019-12-18 14:30:09,223 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:09,223 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-18 14:30:09,224 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1866874621] [2019-12-18 14:30:09,224 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:30:09,224 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:09,224 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:30:09,224 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:30:09,225 INFO L87 Difference]: Start difference. First operand 5931 states and 16730 transitions. Second operand 7 states. [2019-12-18 14:30:09,514 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:09,514 INFO L93 Difference]: Finished difference Result 19961 states and 56607 transitions. [2019-12-18 14:30:09,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-18 14:30:09,515 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 66 [2019-12-18 14:30:09,515 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:09,535 INFO L225 Difference]: With dead ends: 19961 [2019-12-18 14:30:09,535 INFO L226 Difference]: Without dead ends: 11927 [2019-12-18 14:30:09,537 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2019-12-18 14:30:09,587 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 11927 states. [2019-12-18 14:30:09,694 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 11927 to 5931. [2019-12-18 14:30:09,694 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5931 states. [2019-12-18 14:30:09,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5931 states to 5931 states and 16651 transitions. [2019-12-18 14:30:09,708 INFO L78 Accepts]: Start accepts. Automaton has 5931 states and 16651 transitions. Word has length 66 [2019-12-18 14:30:09,708 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:09,708 INFO L462 AbstractCegarLoop]: Abstraction has 5931 states and 16651 transitions. [2019-12-18 14:30:09,708 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:30:09,708 INFO L276 IsEmpty]: Start isEmpty. Operand 5931 states and 16651 transitions. [2019-12-18 14:30:09,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 14:30:09,720 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:09,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, 1, 1] [2019-12-18 14:30:09,720 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:09,720 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:09,720 INFO L82 PathProgramCache]: Analyzing trace with hash -667235773, now seen corresponding path program 4 times [2019-12-18 14:30:09,721 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:09,721 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [800850484] [2019-12-18 14:30:09,721 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:09,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:09,785 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-18 14:30:09,785 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [800850484] [2019-12-18 14:30:09,785 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:09,786 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:30:09,786 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1134116097] [2019-12-18 14:30:09,786 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:30:09,786 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:09,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:30:09,789 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:30:09,790 INFO L87 Difference]: Start difference. First operand 5931 states and 16651 transitions. Second operand 3 states. [2019-12-18 14:30:09,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:09,817 INFO L93 Difference]: Finished difference Result 5505 states and 15249 transitions. [2019-12-18 14:30:09,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:30:09,817 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 14:30:09,817 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:09,824 INFO L225 Difference]: With dead ends: 5505 [2019-12-18 14:30:09,825 INFO L226 Difference]: Without dead ends: 5505 [2019-12-18 14:30:09,825 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-18 14:30:09,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5505 states. [2019-12-18 14:30:09,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5505 to 5421. [2019-12-18 14:30:09,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5421 states. [2019-12-18 14:30:09,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5421 states to 5421 states and 15023 transitions. [2019-12-18 14:30:09,893 INFO L78 Accepts]: Start accepts. Automaton has 5421 states and 15023 transitions. Word has length 66 [2019-12-18 14:30:09,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:09,893 INFO L462 AbstractCegarLoop]: Abstraction has 5421 states and 15023 transitions. [2019-12-18 14:30:09,893 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:30:09,893 INFO L276 IsEmpty]: Start isEmpty. Operand 5421 states and 15023 transitions. [2019-12-18 14:30:09,900 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:30:09,901 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:09,901 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-18 14:30:09,901 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:09,901 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:09,901 INFO L82 PathProgramCache]: Analyzing trace with hash -1603018859, now seen corresponding path program 1 times [2019-12-18 14:30:09,901 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:09,902 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [583550081] [2019-12-18 14:30:09,902 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:09,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:10,094 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-18 14:30:10,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [583550081] [2019-12-18 14:30:10,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:10,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-18 14:30:10,096 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457337599] [2019-12-18 14:30:10,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-18 14:30:10,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:10,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-18 14:30:10,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=69, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:30:10,097 INFO L87 Difference]: Start difference. First operand 5421 states and 15023 transitions. Second operand 10 states. [2019-12-18 14:30:11,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:11,438 INFO L93 Difference]: Finished difference Result 9826 states and 26965 transitions. [2019-12-18 14:30:11,438 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2019-12-18 14:30:11,438 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 67 [2019-12-18 14:30:11,438 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:11,450 INFO L225 Difference]: With dead ends: 9826 [2019-12-18 14:30:11,450 INFO L226 Difference]: Without dead ends: 9826 [2019-12-18 14:30:11,450 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 9 SyntacticMatches, 3 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 42 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=78, Invalid=228, Unknown=0, NotChecked=0, Total=306 [2019-12-18 14:30:11,475 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9826 states. [2019-12-18 14:30:11,544 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9826 to 5757. [2019-12-18 14:30:11,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5757 states. [2019-12-18 14:30:11,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5757 states to 5757 states and 16013 transitions. [2019-12-18 14:30:11,553 INFO L78 Accepts]: Start accepts. Automaton has 5757 states and 16013 transitions. Word has length 67 [2019-12-18 14:30:11,553 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:11,554 INFO L462 AbstractCegarLoop]: Abstraction has 5757 states and 16013 transitions. [2019-12-18 14:30:11,554 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-18 14:30:11,554 INFO L276 IsEmpty]: Start isEmpty. Operand 5757 states and 16013 transitions. [2019-12-18 14:30:11,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 14:30:11,560 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:11,560 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-18 14:30:11,560 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:11,560 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:11,560 INFO L82 PathProgramCache]: Analyzing trace with hash 173931463, now seen corresponding path program 2 times [2019-12-18 14:30:11,561 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:11,561 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939319217] [2019-12-18 14:30:11,561 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:11,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:11,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-18 14:30:11,624 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939319217] [2019-12-18 14:30:11,624 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:11,624 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 14:30:11,624 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1521683150] [2019-12-18 14:30:11,625 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 14:30:11,625 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:11,625 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 14:30:11,625 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 14:30:11,625 INFO L87 Difference]: Start difference. First operand 5757 states and 16013 transitions. Second operand 3 states. [2019-12-18 14:30:11,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:11,688 INFO L93 Difference]: Finished difference Result 5757 states and 16012 transitions. [2019-12-18 14:30:11,688 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 14:30:11,688 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 14:30:11,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:11,697 INFO L225 Difference]: With dead ends: 5757 [2019-12-18 14:30:11,697 INFO L226 Difference]: Without dead ends: 5757 [2019-12-18 14:30:11,698 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-18 14:30:11,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5757 states. [2019-12-18 14:30:11,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5757 to 3388. [2019-12-18 14:30:11,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3388 states. [2019-12-18 14:30:11,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3388 states to 3388 states and 9456 transitions. [2019-12-18 14:30:11,766 INFO L78 Accepts]: Start accepts. Automaton has 3388 states and 9456 transitions. Word has length 67 [2019-12-18 14:30:11,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:11,766 INFO L462 AbstractCegarLoop]: Abstraction has 3388 states and 9456 transitions. [2019-12-18 14:30:11,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 14:30:11,767 INFO L276 IsEmpty]: Start isEmpty. Operand 3388 states and 9456 transitions. [2019-12-18 14:30:11,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:30:11,770 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:11,770 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, 1] [2019-12-18 14:30:11,771 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:11,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:11,771 INFO L82 PathProgramCache]: Analyzing trace with hash 942277324, now seen corresponding path program 1 times [2019-12-18 14:30:11,771 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:11,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330743884] [2019-12-18 14:30:11,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:11,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:11,882 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-18 14:30:11,882 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330743884] [2019-12-18 14:30:11,883 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:11,883 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:30:11,883 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [701688966] [2019-12-18 14:30:11,883 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-18 14:30:11,884 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:11,884 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-18 14:30:11,884 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-18 14:30:11,884 INFO L87 Difference]: Start difference. First operand 3388 states and 9456 transitions. Second operand 6 states. [2019-12-18 14:30:11,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:11,973 INFO L93 Difference]: Finished difference Result 5700 states and 15933 transitions. [2019-12-18 14:30:11,973 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 14:30:11,974 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 68 [2019-12-18 14:30:11,974 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:11,977 INFO L225 Difference]: With dead ends: 5700 [2019-12-18 14:30:11,977 INFO L226 Difference]: Without dead ends: 2437 [2019-12-18 14:30:11,978 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2019-12-18 14:30:11,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2437 states. [2019-12-18 14:30:12,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2437 to 2047. [2019-12-18 14:30:12,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2047 states. [2019-12-18 14:30:12,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2047 states to 2047 states and 5631 transitions. [2019-12-18 14:30:12,007 INFO L78 Accepts]: Start accepts. Automaton has 2047 states and 5631 transitions. Word has length 68 [2019-12-18 14:30:12,008 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:12,008 INFO L462 AbstractCegarLoop]: Abstraction has 2047 states and 5631 transitions. [2019-12-18 14:30:12,008 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-18 14:30:12,008 INFO L276 IsEmpty]: Start isEmpty. Operand 2047 states and 5631 transitions. [2019-12-18 14:30:12,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:30:12,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:12,010 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, 1] [2019-12-18 14:30:12,010 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:12,010 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:12,011 INFO L82 PathProgramCache]: Analyzing trace with hash -213601006, now seen corresponding path program 2 times [2019-12-18 14:30:12,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:12,011 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1485343458] [2019-12-18 14:30:12,011 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:12,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 14:30:12,124 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-18 14:30:12,124 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1485343458] [2019-12-18 14:30:12,125 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 14:30:12,125 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 14:30:12,125 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [56735462] [2019-12-18 14:30:12,126 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-18 14:30:12,126 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 14:30:12,126 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-18 14:30:12,126 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2019-12-18 14:30:12,126 INFO L87 Difference]: Start difference. First operand 2047 states and 5631 transitions. Second operand 7 states. [2019-12-18 14:30:12,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 14:30:12,229 INFO L93 Difference]: Finished difference Result 4157 states and 11463 transitions. [2019-12-18 14:30:12,229 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-18 14:30:12,229 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 68 [2019-12-18 14:30:12,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 14:30:12,234 INFO L225 Difference]: With dead ends: 4157 [2019-12-18 14:30:12,234 INFO L226 Difference]: Without dead ends: 2151 [2019-12-18 14:30:12,235 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2019-12-18 14:30:12,260 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2151 states. [2019-12-18 14:30:12,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2151 to 1785. [2019-12-18 14:30:12,288 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1785 states. [2019-12-18 14:30:12,291 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1785 states to 1785 states and 4875 transitions. [2019-12-18 14:30:12,292 INFO L78 Accepts]: Start accepts. Automaton has 1785 states and 4875 transitions. Word has length 68 [2019-12-18 14:30:12,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 14:30:12,292 INFO L462 AbstractCegarLoop]: Abstraction has 1785 states and 4875 transitions. [2019-12-18 14:30:12,292 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-18 14:30:12,292 INFO L276 IsEmpty]: Start isEmpty. Operand 1785 states and 4875 transitions. [2019-12-18 14:30:12,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 14:30:12,295 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 14:30:12,295 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, 1] [2019-12-18 14:30:12,295 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 14:30:12,295 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 14:30:12,296 INFO L82 PathProgramCache]: Analyzing trace with hash -1259160564, now seen corresponding path program 3 times [2019-12-18 14:30:12,296 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 14:30:12,297 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257842939] [2019-12-18 14:30:12,298 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 14:30:12,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:30:12,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 14:30:12,560 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 14:30:12,560 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 14:30:12,567 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [823] [823] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= 0 v_~x~0_194) (= 0 v_~x$r_buff0_thd2~0_213) (= 0 v_~weak$$choice0~0_14) (= v_~x$mem_tmp~0_19 0) (= 0 v_~x$w_buff0~0_268) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1876~0.base_20|)) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t1876~0.base_20| 4) |v_#length_25|) (= 0 v_~x$r_buff1_thd2~0_212) (= v_~x$r_buff1_thd0~0_297 0) (= |v_ULTIMATE.start_main_~#t1876~0.offset_17| 0) (< 0 |v_#StackHeapBarrier_17|) (= 0 v_~x$read_delayed_var~0.base_7) (= v_~x$r_buff1_thd1~0_187 0) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t1876~0.base_20|) (= v_~__unbuffered_p2_EBX~0_22 0) (= v_~x$r_buff0_thd0~0_372 0) (= 0 v_~x$read_delayed~0_6) (= v_~__unbuffered_cnt~0_155 0) (= 0 v_~x$w_buff1~0_230) (= 0 |v_#NULL.base_4|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1876~0.base_20| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1876~0.base_20|) |v_ULTIMATE.start_main_~#t1876~0.offset_17| 0)) |v_#memory_int_21|) (= 0 v_~x$r_buff1_thd3~0_195) (= 0 v_~x$r_buff0_thd3~0_123) (= |v_#NULL.offset_4| 0) (= 0 v_~x$w_buff1_used~0_504) (= 0 v_~x$read_delayed_var~0.offset_7) (= v_~x$r_buff0_thd1~0_120 0) (= 0 v_~__unbuffered_p2_EAX~0_22) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t1876~0.base_20| 1)) (= v_~x$flush_delayed~0_34 0) (= v_~main$tmp_guard0~0_24 0) (= v_~weak$$choice2~0_110 0) (= v_~y~0_136 0) (= 0 v_~x$w_buff0_used~0_807) (= v_~main$tmp_guard1~0_22 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ~x$w_buff0~0=v_~x$w_buff0~0_268, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ~x$flush_delayed~0=v_~x$flush_delayed~0_34, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_39|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_45|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_187, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_123, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_50|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_36|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, ULTIMATE.start_main_~#t1878~0.offset=|v_ULTIMATE.start_main_~#t1878~0.offset_16|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_372, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_22, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_37|, ~x$w_buff1~0=v_~x$w_buff1~0_230, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_42|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_504, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_212, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_48|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_14, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_~#t1876~0.offset=|v_ULTIMATE.start_main_~#t1876~0.offset_17|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_155, ~x~0=v_~x~0_194, ULTIMATE.start_main_~#t1877~0.offset=|v_ULTIMATE.start_main_~#t1877~0.offset_17|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_120, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_29|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_195, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_22, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_125|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~x$mem_tmp~0=v_~x$mem_tmp~0_19, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_50|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~y~0=v_~y~0_136, ULTIMATE.start_main_~#t1876~0.base=|v_ULTIMATE.start_main_~#t1876~0.base_20|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_23|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_48|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_24, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_297, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_213, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, ULTIMATE.start_main_~#t1878~0.base=|v_ULTIMATE.start_main_~#t1878~0.base_20|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_38|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_807, ULTIMATE.start_main_~#t1877~0.base=|v_ULTIMATE.start_main_~#t1877~0.base_21|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_19|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ~weak$$choice2~0=v_~weak$$choice2~0_110, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ~x$w_buff0~0, ULTIMATE.start_main_#t~ite28, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ~x$r_buff1_thd1~0, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ULTIMATE.start_main_~#t1878~0.offset, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p2_EBX~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ~x$w_buff1~0, ULTIMATE.start_main_#t~ite35, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite37, ULTIMATE.start_main_#t~ite33, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_~#t1876~0.offset, ULTIMATE.start_main_#t~ite40, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1877~0.offset, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite51, ~y~0, ULTIMATE.start_main_~#t1876~0.base, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_#t~ite32, ULTIMATE.start_main_~#t1878~0.base, #NULL.base, ULTIMATE.start_main_#t~ite34, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t1877~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-18 14:30:12,568 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [798] [798] L805-1-->L807: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t1877~0.base_11|) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t1877~0.base_11| 1)) (not (= |v_ULTIMATE.start_main_~#t1877~0.base_11| 0)) (= |v_ULTIMATE.start_main_~#t1877~0.offset_10| 0) (= 0 (select |v_#valid_32| |v_ULTIMATE.start_main_~#t1877~0.base_11|)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1877~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t1877~0.base_11|) |v_ULTIMATE.start_main_~#t1877~0.offset_10| 1)) |v_#memory_int_13|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1877~0.base_11| 4))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t1877~0.base=|v_ULTIMATE.start_main_~#t1877~0.base_11|, ULTIMATE.start_main_~#t1877~0.offset=|v_ULTIMATE.start_main_~#t1877~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_13|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1877~0.base, ULTIMATE.start_main_~#t1877~0.offset, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, #length] because there is no mapped edge [2019-12-18 14:30:12,569 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (not (= 0 |v_ULTIMATE.start_main_~#t1878~0.base_9|)) (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t1878~0.base_9| 1)) (= 0 |v_ULTIMATE.start_main_~#t1878~0.offset_8|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t1878~0.base_9|) (= |v_#memory_int_9| (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1878~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t1878~0.base_9|) |v_ULTIMATE.start_main_~#t1878~0.offset_8| 2))) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t1878~0.base_9| 4) |v_#length_13|) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t1878~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t1878~0.offset=|v_ULTIMATE.start_main_~#t1878~0.offset_8|, #StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t1878~0.base=|v_ULTIMATE.start_main_~#t1878~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1878~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t1878~0.base] because there is no mapped edge [2019-12-18 14:30:12,571 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [687] [687] P1ENTRY-->L4-3: Formula: (and (= |v_P1Thread1of1ForFork1_#in~arg.offset_11| v_P1Thread1of1ForFork1_~arg.offset_11) (= 1 v_~x$w_buff0_used~0_98) (= 2 v_~x$w_buff0~0_31) (= v_P1Thread1of1ForFork1_~arg.base_11 |v_P1Thread1of1ForFork1_#in~arg.base_11|) (= v_~x$w_buff1_used~0_55 v_~x$w_buff0_used~0_99) (= v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 1 |v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|) (= 0 (mod v_~x$w_buff1_used~0_55 256)) (= v_~x$w_buff0~0_32 v_~x$w_buff1~0_21)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_32, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_99} OutVars{P1Thread1of1ForFork1___VERIFIER_assert_~expression=v_P1Thread1of1ForFork1___VERIFIER_assert_~expression_13, ~x$w_buff0~0=v_~x$w_buff0~0_31, P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_11, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork1___VERIFIER_assert_#in~expression_11|, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_11, ~x$w_buff1~0=v_~x$w_buff1~0_21, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_11|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_11|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_55, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_98} AuxVars[] AssignedVars[P1Thread1of1ForFork1___VERIFIER_assert_~expression, ~x$w_buff0~0, P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1___VERIFIER_assert_#in~expression, P1Thread1of1ForFork1_~arg.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-18 14:30:12,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-351609118 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In-351609118 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite15_Out-351609118| ~x~0_In-351609118) (or .cse0 .cse1)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out-351609118| ~x$w_buff1~0_In-351609118) (not .cse0) (not .cse1)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-351609118, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-351609118, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-351609118, ~x~0=~x~0_In-351609118} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-351609118|, ~x$w_buff1~0=~x$w_buff1~0_In-351609118, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-351609118, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-351609118, ~x~0=~x~0_In-351609118} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 14:30:12,577 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L782-4-->L783: Formula: (= v_~x~0_20 |v_P2Thread1of1ForFork2_#t~ite15_12|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_12|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_11|, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_7|, ~x~0=v_~x~0_20} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, P2Thread1of1ForFork2_#t~ite16, ~x~0] because there is no mapped edge [2019-12-18 14:30:12,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In755625774 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In755625774 256) 0))) (or (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out755625774|)) (and (or .cse1 .cse0) (= ~x$w_buff0_used~0_In755625774 |P2Thread1of1ForFork2_#t~ite17_Out755625774|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In755625774, ~x$w_buff0_used~0=~x$w_buff0_used~0_In755625774} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In755625774, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out755625774|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In755625774} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 14:30:12,578 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In1913967099 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In1913967099 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In1913967099 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1913967099 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P2Thread1of1ForFork2_#t~ite18_Out1913967099| ~x$w_buff1_used~0_In1913967099)) (and (or (and (not .cse3) (not .cse2)) (and (not .cse0) (not .cse1))) (= |P2Thread1of1ForFork2_#t~ite18_Out1913967099| 0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1913967099, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1913967099, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1913967099, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1913967099} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1913967099, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In1913967099, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1913967099, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out1913967099|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1913967099} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 14:30:12,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [779] [779] L733-2-->L733-5: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-567918500 256) 0)) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-567918500 256))) (.cse2 (= |P0Thread1of1ForFork0_#t~ite4_Out-567918500| |P0Thread1of1ForFork0_#t~ite3_Out-567918500|))) (or (and (or .cse0 .cse1) (= ~x~0_In-567918500 |P0Thread1of1ForFork0_#t~ite3_Out-567918500|) .cse2) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In-567918500 |P0Thread1of1ForFork0_#t~ite3_Out-567918500|) .cse2))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-567918500, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-567918500, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-567918500, ~x~0=~x~0_In-567918500} OutVars{P0Thread1of1ForFork0_#t~ite3=|P0Thread1of1ForFork0_#t~ite3_Out-567918500|, P0Thread1of1ForFork0_#t~ite4=|P0Thread1of1ForFork0_#t~ite4_Out-567918500|, ~x$w_buff1~0=~x$w_buff1~0_In-567918500, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-567918500, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-567918500, ~x~0=~x~0_In-567918500} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite3, P0Thread1of1ForFork0_#t~ite4] because there is no mapped edge [2019-12-18 14:30:12,579 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L734-->L734-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-863435468 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd1~0_In-863435468 256) 0))) (or (and (= |P0Thread1of1ForFork0_#t~ite5_Out-863435468| 0) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In-863435468 |P0Thread1of1ForFork0_#t~ite5_Out-863435468|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-863435468, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-863435468} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-863435468|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-863435468, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-863435468} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 14:30:12,580 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L735-->L735-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff0_used~0_In-372145802 256))) (.cse3 (= 0 (mod ~x$r_buff0_thd1~0_In-372145802 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-372145802 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-372145802 256)))) (or (and (= |P0Thread1of1ForFork0_#t~ite6_Out-372145802| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |P0Thread1of1ForFork0_#t~ite6_Out-372145802| ~x$w_buff1_used~0_In-372145802) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-372145802, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-372145802, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-372145802, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-372145802} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-372145802|, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-372145802, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-372145802, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-372145802, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-372145802} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 14:30:12,581 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [759] [759] L785-->L785-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-138054324 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-138054324 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork2_#t~ite19_Out-138054324| 0) (not .cse1)) (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out-138054324| ~x$r_buff0_thd3~0_In-138054324)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-138054324, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-138054324} OutVars{~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-138054324, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-138054324|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-138054324} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 14:30:12,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L786-->L786-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In469599541 256))) (.cse1 (= (mod ~x$r_buff0_thd3~0_In469599541 256) 0)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In469599541 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd3~0_In469599541 256)))) (or (and (= 0 |P2Thread1of1ForFork2_#t~ite20_Out469599541|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= ~x$r_buff1_thd3~0_In469599541 |P2Thread1of1ForFork2_#t~ite20_Out469599541|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In469599541, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In469599541, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In469599541, ~x$w_buff0_used~0=~x$w_buff0_used~0_In469599541} OutVars{P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out469599541|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In469599541, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In469599541, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In469599541, ~x$w_buff0_used~0=~x$w_buff0_used~0_In469599541} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 14:30:12,582 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_75 1) v_~__unbuffered_cnt~0_74) (= |v_P2Thread1of1ForFork2_#t~ite20_54| v_~x$r_buff1_thd3~0_147)) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_54|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_75} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_53|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_147, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_74, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~x$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 14:30:12,583 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L736-->L736-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In887540973 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In887540973 256)))) (or (and (not .cse0) (= 0 |P0Thread1of1ForFork0_#t~ite7_Out887540973|) (not .cse1)) (and (= ~x$r_buff0_thd1~0_In887540973 |P0Thread1of1ForFork0_#t~ite7_Out887540973|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In887540973, ~x$w_buff0_used~0=~x$w_buff0_used~0_In887540973} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In887540973, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out887540973|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In887540973} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7] because there is no mapped edge [2019-12-18 14:30:12,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L737-->L737-2: Formula: (let ((.cse3 (= (mod ~x$r_buff0_thd1~0_In1007489851 256) 0)) (.cse2 (= (mod ~x$w_buff0_used~0_In1007489851 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd1~0_In1007489851 256) 0)) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1007489851 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P0Thread1of1ForFork0_#t~ite8_Out1007489851|)) (and (= ~x$r_buff1_thd1~0_In1007489851 |P0Thread1of1ForFork0_#t~ite8_Out1007489851|) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1007489851, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1007489851, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1007489851, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1007489851} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In1007489851, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out1007489851|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1007489851, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In1007489851, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1007489851} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 14:30:12,584 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [799] [799] L737-2-->P0EXIT: Formula: (and (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_~x$r_buff1_thd1~0_61 |v_P0Thread1of1ForFork0_#t~ite8_26|) (= (+ v_~__unbuffered_cnt~0_45 1) v_~__unbuffered_cnt~0_44) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_26|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_45} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_25|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_61} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, ~x$r_buff1_thd1~0] because there is no mapped edge [2019-12-18 14:30:12,585 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L763-->L763-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In978992827 256))) (.cse1 (= (mod ~x$r_buff0_thd2~0_In978992827 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite11_Out978992827| 0) (not .cse1)) (and (= ~x$w_buff0_used~0_In978992827 |P1Thread1of1ForFork1_#t~ite11_Out978992827|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In978992827, ~x$w_buff0_used~0=~x$w_buff0_used~0_In978992827} OutVars{P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out978992827|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In978992827, ~x$w_buff0_used~0=~x$w_buff0_used~0_In978992827} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 14:30:12,586 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L764-->L764-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In-1295665220 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In-1295665220 256))) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In-1295665220 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In-1295665220 256) 0))) (or (and (= 0 |P1Thread1of1ForFork1_#t~ite12_Out-1295665220|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In-1295665220 |P1Thread1of1ForFork1_#t~ite12_Out-1295665220|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1295665220, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1295665220, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1295665220, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1295665220} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-1295665220, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-1295665220, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out-1295665220|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1295665220, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1295665220} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 14:30:12,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L765-->L766: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In-1210537305 256) 0)) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1210537305 256)))) (or (and (not .cse0) (not .cse1) (= ~x$r_buff0_thd2~0_Out-1210537305 0)) (and (or .cse1 .cse0) (= ~x$r_buff0_thd2~0_Out-1210537305 ~x$r_buff0_thd2~0_In-1210537305)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1210537305, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1210537305} OutVars{P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-1210537305|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1210537305, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1210537305} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-18 14:30:12,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L766-->L766-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd2~0_In-843288505 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-843288505 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-843288505 256))) (.cse1 (= 0 (mod ~x$r_buff1_thd2~0_In-843288505 256)))) (or (and (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out-843288505| ~x$r_buff1_thd2~0_In-843288505) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= 0 |P1Thread1of1ForFork1_#t~ite14_Out-843288505|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-843288505, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-843288505, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-843288505, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-843288505} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In-843288505, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In-843288505, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-843288505, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out-843288505|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-843288505} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 14:30:12,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd2~0_162 |v_P1Thread1of1ForFork1_#t~ite14_42|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_93 1) v_~__unbuffered_cnt~0_92)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_93, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_42|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_162, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_92, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_41|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 14:30:12,587 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_14) (= v_~main$tmp_guard0~0_6 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_6} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 14:30:12,588 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L815-2-->L815-5: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In-344693677 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite24_Out-344693677| |ULTIMATE.start_main_#t~ite25_Out-344693677|)) (.cse2 (= 0 (mod ~x$w_buff1_used~0_In-344693677 256)))) (or (and .cse0 (= |ULTIMATE.start_main_#t~ite24_Out-344693677| ~x~0_In-344693677) (or .cse1 .cse2)) (and (not .cse1) .cse0 (not .cse2) (= |ULTIMATE.start_main_#t~ite24_Out-344693677| ~x$w_buff1~0_In-344693677)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-344693677, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-344693677, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-344693677, ~x~0=~x~0_In-344693677} OutVars{~x$w_buff1~0=~x$w_buff1~0_In-344693677, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-344693677|, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-344693677|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-344693677, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-344693677, ~x~0=~x~0_In-344693677} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 14:30:12,589 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-->L816-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1673652225 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1673652225 256)))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-1673652225 |ULTIMATE.start_main_#t~ite26_Out-1673652225|)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite26_Out-1673652225|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1673652225, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1673652225} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1673652225, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out-1673652225|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1673652225} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 14:30:12,590 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L817-->L817-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff1_thd0~0_In584364654 256))) (.cse3 (= (mod ~x$w_buff1_used~0_In584364654 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In584364654 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In584364654 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite27_Out584364654| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (= |ULTIMATE.start_main_#t~ite27_Out584364654| ~x$w_buff1_used~0_In584364654) (or .cse2 .cse3) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In584364654, ~x$w_buff1_used~0=~x$w_buff1_used~0_In584364654, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In584364654, ~x$w_buff0_used~0=~x$w_buff0_used~0_In584364654} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In584364654, ~x$w_buff1_used~0=~x$w_buff1_used~0_In584364654, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out584364654|, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In584364654, ~x$w_buff0_used~0=~x$w_buff0_used~0_In584364654} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 14:30:12,591 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In-1064424096 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-1064424096 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite28_Out-1064424096| ~x$r_buff0_thd0~0_In-1064424096)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite28_Out-1064424096| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1064424096, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1064424096} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1064424096, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out-1064424096|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1064424096} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 14:30:12,592 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse2 (= (mod ~x$w_buff1_used~0_In-618219619 256) 0)) (.cse3 (= 0 (mod ~x$r_buff1_thd0~0_In-618219619 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In-618219619 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-618219619 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite29_Out-618219619| ~x$r_buff1_thd0~0_In-618219619) (or .cse0 .cse1) (or .cse2 .cse3)) (and (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1))) (= |ULTIMATE.start_main_#t~ite29_Out-618219619| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-618219619, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-618219619, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-618219619, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-618219619} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-618219619, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out-618219619|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-618219619, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-618219619, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-618219619} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 14:30:12,600 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [719] [719] L831-->L832: Formula: (and (= v_~x$r_buff0_thd0~0_112 v_~x$r_buff0_thd0~0_111) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_112, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_111, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 14:30:12,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L834-->L837-1: Formula: (and (= (mod v_~main$tmp_guard1~0_13 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= (mod v_~x$flush_delayed~0_23 256) 0)) (= v_~x$mem_tmp~0_13 v_~x~0_153) (= v_~x$flush_delayed~0_22 0)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_23, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_13} OutVars{ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ~x$flush_delayed~0=v_~x$flush_delayed~0_22, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_13, ~x$mem_tmp~0=v_~x$mem_tmp~0_13, ~x~0=v_~x~0_153, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~x$flush_delayed~0, ~x~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 14:30:12,603 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 14:30:12,735 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 02:30:12 BasicIcfg [2019-12-18 14:30:12,736 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 14:30:12,738 INFO L168 Benchmark]: Toolchain (without parser) took 86987.08 ms. Allocated memory was 138.4 MB in the beginning and 3.7 GB in the end (delta: 3.6 GB). Free memory was 100.8 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.9 GB. Max. memory is 7.1 GB. [2019-12-18 14:30:12,739 INFO L168 Benchmark]: CDTParser took 0.78 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-18 14:30:12,740 INFO L168 Benchmark]: CACSL2BoogieTranslator took 780.75 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.4 MB in the beginning and 157.9 MB in the end (delta: -57.5 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. [2019-12-18 14:30:12,740 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.83 ms. Allocated memory is still 202.9 MB. Free memory was 157.9 MB in the beginning and 154.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. [2019-12-18 14:30:12,741 INFO L168 Benchmark]: Boogie Preprocessor took 40.98 ms. Allocated memory is still 202.9 MB. Free memory was 154.4 MB in the beginning and 152.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-18 14:30:12,741 INFO L168 Benchmark]: RCFGBuilder took 852.31 ms. Allocated memory is still 202.9 MB. Free memory was 152.4 MB in the beginning and 102.7 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-18 14:30:12,742 INFO L168 Benchmark]: TraceAbstraction took 85238.50 ms. Allocated memory was 202.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 102.1 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. [2019-12-18 14:30:12,746 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.78 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 780.75 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.4 MB in the beginning and 157.9 MB in the end (delta: -57.5 MB). Peak memory consumption was 27.1 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.83 ms. Allocated memory is still 202.9 MB. Free memory was 157.9 MB in the beginning and 154.4 MB in the end (delta: 3.5 MB). Peak memory consumption was 3.5 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 40.98 ms. Allocated memory is still 202.9 MB. Free memory was 154.4 MB in the beginning and 152.4 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 852.31 ms. Allocated memory is still 202.9 MB. Free memory was 152.4 MB in the beginning and 102.7 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 85238.50 ms. Allocated memory was 202.9 MB in the beginning and 3.7 GB in the end (delta: 3.5 GB). Free memory was 102.1 MB in the beginning and 1.8 GB in the end (delta: -1.7 GB). Peak memory consumption was 1.8 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 174 ProgramPointsBefore, 94 ProgramPointsAfterwards, 211 TransitionsBefore, 106 TransitionsAfterwards, 17074 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 43 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 29 ChoiceCompositions, 6159 VarBasedMoverChecksPositive, 253 VarBasedMoverChecksNegative, 78 SemBasedMoverChecksPositive, 250 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 78277 CheckedPairsTotal, 111 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t1876, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L807] FCALL, FORK 0 pthread_create(&t1877, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L809] FCALL, FORK 0 pthread_create(&t1878, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0] [L752] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L753] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L754] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L755] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L756] 2 x$r_buff0_thd2 = (_Bool)1 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p2_EBX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 __unbuffered_p2_EBX = y VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1] [L727] 1 y = 2 [L730] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0: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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L782] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0: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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L733] EXPR 1 x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0: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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=2] [L783] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L733] 1 x = x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd1 ? x$w_buff1 : x) [L734] 1 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used [L784] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L785] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L762] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0: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, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=1, x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L735] 1 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd1 || x$w_buff1_used && x$r_buff1_thd1 ? (_Bool)0 : x$w_buff1_used [L736] 1 x$r_buff0_thd1 = x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1 [L762] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L763] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L764] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L815] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L815] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L816] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L817] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L818] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L819] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 x$flush_delayed = weak$$choice2 [L825] 0 x$mem_tmp = x VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] EXPR 0 !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L826] 0 x = !x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff1) [L827] EXPR 0 weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L827] 0 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : x$w_buff0)) [L828] EXPR 0 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L828] 0 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff1 : x$w_buff1)) [L829] EXPR 0 weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L829] 0 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L830] 0 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] [L832] 0 x$r_buff1_thd0 = weak$$choice2 ? x$r_buff1_thd0 : (!x$w_buff0_used || !x$r_buff0_thd0 && !x$w_buff1_used || !x$r_buff0_thd0 && !x$r_buff1_thd0 ? x$r_buff1_thd0 : (x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 1 && __unbuffered_p2_EBX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, __unbuffered_p2_EBX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, x$flush_delayed=1, x$mem_tmp=2, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=2, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=2] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 84.8s, OverallIterations: 21, TraceHistogramMax: 1, AutomataDifference: 24.0s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3026 SDtfs, 2578 SDslu, 5619 SDs, 0 SdLazy, 3498 SolverSat, 160 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 3.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 151 GetRequests, 43 SyntacticMatches, 17 SemanticMatches, 91 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 74 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=183279occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 36.1s AutomataMinimizationTime, 20 MinimizatonAttempts, 85765 StatesRemovedByMinimization, 18 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 1050 NumberOfCodeBlocks, 1050 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 962 ConstructedInterpolants, 0 QuantifiedInterpolants, 166617 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 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...