/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/mix043_rmo.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-26 22:37:25,357 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-26 22:37:25,359 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-26 22:37:25,371 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-26 22:37:25,372 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-26 22:37:25,373 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-26 22:37:25,374 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-26 22:37:25,376 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-26 22:37:25,378 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-26 22:37:25,379 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-26 22:37:25,379 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-26 22:37:25,381 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-26 22:37:25,381 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-26 22:37:25,382 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-26 22:37:25,384 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-26 22:37:25,385 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-26 22:37:25,386 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-26 22:37:25,388 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-26 22:37:25,391 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-26 22:37:25,395 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-26 22:37:25,401 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-26 22:37:25,402 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-26 22:37:25,405 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-26 22:37:25,406 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-26 22:37:25,411 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-26 22:37:25,412 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-26 22:37:25,412 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-26 22:37:25,413 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-26 22:37:25,413 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-26 22:37:25,416 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-26 22:37:25,416 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-26 22:37:25,417 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-26 22:37:25,419 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-26 22:37:25,420 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-26 22:37:25,421 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-26 22:37:25,422 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-26 22:37:25,423 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-26 22:37:25,423 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-26 22:37:25,424 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-26 22:37:25,426 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-26 22:37:25,426 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-26 22:37:25,427 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/default/automizer/svcomp-Reach-32bit-Automizer_Default.epf [2019-12-26 22:37:25,454 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-26 22:37:25,454 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-26 22:37:25,457 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-26 22:37:25,457 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-26 22:37:25,457 INFO L138 SettingsManager]: * Use SBE=true [2019-12-26 22:37:25,458 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-26 22:37:25,459 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-26 22:37:25,459 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-26 22:37:25,459 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-26 22:37:25,459 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-26 22:37:25,460 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-26 22:37:25,461 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-26 22:37:25,461 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-26 22:37:25,461 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-26 22:37:25,461 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-26 22:37:25,462 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-26 22:37:25,462 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-26 22:37:25,462 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-26 22:37:25,462 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-26 22:37:25,463 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-26 22:37:25,463 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-26 22:37:25,463 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:37:25,463 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-26 22:37:25,463 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-26 22:37:25,464 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-26 22:37:25,464 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-26 22:37:25,464 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-26 22:37:25,464 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-26 22:37:25,464 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2019-12-26 22:37:25,465 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-26 22:37:25,769 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-26 22:37:25,780 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-26 22:37:25,783 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-26 22:37:25,785 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-26 22:37:25,785 INFO L275 PluginConnector]: CDTParser initialized [2019-12-26 22:37:25,786 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/mix043_rmo.opt.i [2019-12-26 22:37:25,847 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fd85cd1f/09a8bf5ea5bd4f2984ae5a1cfe90d9e4/FLAGafb58a230 [2019-12-26 22:37:26,395 INFO L306 CDTParser]: Found 1 translation units. [2019-12-26 22:37:26,396 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/mix043_rmo.opt.i [2019-12-26 22:37:26,420 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fd85cd1f/09a8bf5ea5bd4f2984ae5a1cfe90d9e4/FLAGafb58a230 [2019-12-26 22:37:26,681 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7fd85cd1f/09a8bf5ea5bd4f2984ae5a1cfe90d9e4 [2019-12-26 22:37:26,689 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-26 22:37:26,691 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-26 22:37:26,692 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-26 22:37:26,692 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-26 22:37:26,696 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-26 22:37:26,697 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:37:26" (1/1) ... [2019-12-26 22:37:26,702 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1b973043 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:37:26, skipping insertion in model container [2019-12-26 22:37:26,702 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.12 10:37:26" (1/1) ... [2019-12-26 22:37:26,718 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-26 22:37:26,768 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-26 22:37:27,333 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:37:27,355 INFO L203 MainTranslator]: Completed pre-run [2019-12-26 22:37:27,436 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-26 22:37:27,517 INFO L208 MainTranslator]: Completed translation [2019-12-26 22:37:27,519 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:37:27 WrapperNode [2019-12-26 22:37:27,519 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-26 22:37:27,520 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-26 22:37:27,520 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-26 22:37:27,520 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-26 22:37:27,530 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:37:27" (1/1) ... [2019-12-26 22:37:27,558 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:37:27" (1/1) ... [2019-12-26 22:37:27,599 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-26 22:37:27,600 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-26 22:37:27,600 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-26 22:37:27,600 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-26 22:37:27,608 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:37:27" (1/1) ... [2019-12-26 22:37:27,608 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:37:27" (1/1) ... [2019-12-26 22:37:27,613 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:37:27" (1/1) ... [2019-12-26 22:37:27,614 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:37:27" (1/1) ... [2019-12-26 22:37:27,624 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:37:27" (1/1) ... [2019-12-26 22:37:27,628 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:37:27" (1/1) ... [2019-12-26 22:37:27,632 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:37:27" (1/1) ... [2019-12-26 22:37:27,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-26 22:37:27,637 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-26 22:37:27,638 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-26 22:37:27,638 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-26 22:37:27,639 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:37:27" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-26 22:37:27,703 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-26 22:37:27,704 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-26 22:37:27,704 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-26 22:37:27,704 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-26 22:37:27,704 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-26 22:37:27,704 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-26 22:37:27,705 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-26 22:37:27,705 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-26 22:37:27,705 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-26 22:37:27,705 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-26 22:37:27,705 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2019-12-26 22:37:27,705 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2019-12-26 22:37:27,706 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-26 22:37:27,706 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-26 22:37:27,706 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-26 22:37:27,709 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-26 22:37:28,460 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-26 22:37:28,460 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-26 22:37:28,462 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:37:28 BoogieIcfgContainer [2019-12-26 22:37:28,462 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-26 22:37:28,466 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-26 22:37:28,466 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-26 22:37:28,470 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-26 22:37:28,470 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.12 10:37:26" (1/3) ... [2019-12-26 22:37:28,471 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497a509a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:37:28, skipping insertion in model container [2019-12-26 22:37:28,472 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.12 10:37:27" (2/3) ... [2019-12-26 22:37:28,472 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@497a509a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.12 10:37:28, skipping insertion in model container [2019-12-26 22:37:28,473 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.12 10:37:28" (3/3) ... [2019-12-26 22:37:28,474 INFO L109 eAbstractionObserver]: Analyzing ICFG mix043_rmo.opt.i [2019-12-26 22:37:28,486 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-26 22:37:28,486 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-26 22:37:28,494 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-26 22:37:28,495 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-26 22:37:28,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,535 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,536 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,536 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,536 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,537 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,537 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,538 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,538 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,539 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,539 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,539 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,540 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,541 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,542 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,543 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,544 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,545 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,546 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,547 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,547 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,547 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,547 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,548 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,548 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,548 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,548 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,549 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,549 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,549 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,550 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,550 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,550 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,550 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,551 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,551 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,551 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,551 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,552 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,553 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,553 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,553 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,553 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,554 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,554 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,554 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,554 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,555 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,555 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,555 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,556 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,559 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,560 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,560 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,560 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,563 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,563 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,564 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,564 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,566 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,567 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,567 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,567 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,568 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,570 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,570 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,571 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,571 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,571 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,571 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,572 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,572 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,572 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,572 WARN L315 ript$VariableManager]: TermVariabe P3Thread1of1ForFork3_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,573 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,573 WARN L315 ript$VariableManager]: TermVariabe |P3Thread1of1ForFork3_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-26 22:37:28,603 INFO L249 AbstractCegarLoop]: Starting to check reachability of 7 error locations. [2019-12-26 22:37:28,627 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-26 22:37:28,627 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-26 22:37:28,628 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-26 22:37:28,628 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-26 22:37:28,628 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-26 22:37:28,628 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-26 22:37:28,628 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-26 22:37:28,628 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-26 22:37:28,651 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 182 places, 210 transitions [2019-12-26 22:37:28,653 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-26 22:37:28,754 INFO L132 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-26 22:37:28,755 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:37:28,774 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 22:37:28,796 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 182 places, 210 transitions [2019-12-26 22:37:28,850 INFO L132 PetriNetUnfolder]: 41/206 cut-off events. [2019-12-26 22:37:28,850 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-26 22:37:28,857 INFO L76 FinitePrefix]: Finished finitePrefix Result has 219 conditions, 206 events. 41/206 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 265 event pairs. 0/163 useless extension candidates. Maximal degree in co-relation 172. Up to 2 conditions per place. [2019-12-26 22:37:28,873 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 12668 [2019-12-26 22:37:28,874 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-26 22:37:32,140 WARN L192 SmtUtils]: Spent 107.00 ms on a formula simplification. DAG size of input: 45 DAG size of output: 33 [2019-12-26 22:37:33,975 WARN L192 SmtUtils]: Spent 101.00 ms on a formula simplification that was a NOOP. DAG size: 62 [2019-12-26 22:37:34,345 WARN L192 SmtUtils]: Spent 344.00 ms on a formula simplification. DAG size of input: 101 DAG size of output: 99 [2019-12-26 22:37:34,498 WARN L192 SmtUtils]: Spent 149.00 ms on a formula simplification that was a NOOP. DAG size: 97 [2019-12-26 22:37:34,523 INFO L206 etLargeBlockEncoding]: Checked pairs total: 56592 [2019-12-26 22:37:34,523 INFO L214 etLargeBlockEncoding]: Total number of compositions: 126 [2019-12-26 22:37:34,528 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 90 places, 97 transitions [2019-12-26 22:37:37,174 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 33838 states. [2019-12-26 22:37:37,176 INFO L276 IsEmpty]: Start isEmpty. Operand 33838 states. [2019-12-26 22:37:37,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2019-12-26 22:37:37,183 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:37,184 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:37,184 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:37,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:37,191 INFO L82 PathProgramCache]: Analyzing trace with hash -1752766824, now seen corresponding path program 1 times [2019-12-26 22:37:37,201 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:37,201 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1512883384] [2019-12-26 22:37:37,201 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:37,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:37,478 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:37,479 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1512883384] [2019-12-26 22:37:37,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:37,480 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-26 22:37:37,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1683430127] [2019-12-26 22:37:37,486 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:37:37,486 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:37,500 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:37:37,501 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:37:37,503 INFO L87 Difference]: Start difference. First operand 33838 states. Second operand 3 states. [2019-12-26 22:37:38,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:38,061 INFO L93 Difference]: Finished difference Result 33638 states and 143712 transitions. [2019-12-26 22:37:38,062 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:37:38,063 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2019-12-26 22:37:38,064 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:38,546 INFO L225 Difference]: With dead ends: 33638 [2019-12-26 22:37:38,546 INFO L226 Difference]: Without dead ends: 32966 [2019-12-26 22:37:38,548 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:37:38,928 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32966 states. [2019-12-26 22:37:39,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32966 to 32966. [2019-12-26 22:37:39,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32966 states. [2019-12-26 22:37:40,198 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32966 states to 32966 states and 140968 transitions. [2019-12-26 22:37:40,199 INFO L78 Accepts]: Start accepts. Automaton has 32966 states and 140968 transitions. Word has length 9 [2019-12-26 22:37:40,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:40,200 INFO L462 AbstractCegarLoop]: Abstraction has 32966 states and 140968 transitions. [2019-12-26 22:37:40,201 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:37:40,201 INFO L276 IsEmpty]: Start isEmpty. Operand 32966 states and 140968 transitions. [2019-12-26 22:37:40,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:37:40,213 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:40,214 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:40,214 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:40,214 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:40,215 INFO L82 PathProgramCache]: Analyzing trace with hash -666575947, now seen corresponding path program 1 times [2019-12-26 22:37:40,215 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:40,216 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1859960022] [2019-12-26 22:37:40,216 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:40,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:40,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:40,337 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1859960022] [2019-12-26 22:37:40,338 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:40,338 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:37:40,338 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [861343230] [2019-12-26 22:37:40,340 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:37:40,340 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:40,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:37:40,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:37:40,341 INFO L87 Difference]: Start difference. First operand 32966 states and 140968 transitions. Second operand 4 states. [2019-12-26 22:37:42,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:42,371 INFO L93 Difference]: Finished difference Result 44494 states and 185824 transitions. [2019-12-26 22:37:42,371 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:37:42,372 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-26 22:37:42,372 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:42,559 INFO L225 Difference]: With dead ends: 44494 [2019-12-26 22:37:42,559 INFO L226 Difference]: Without dead ends: 44494 [2019-12-26 22:37:42,560 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:37:43,014 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44494 states. [2019-12-26 22:37:44,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44494 to 43986. [2019-12-26 22:37:44,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 43986 states. [2019-12-26 22:37:44,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43986 states to 43986 states and 183912 transitions. [2019-12-26 22:37:44,237 INFO L78 Accepts]: Start accepts. Automaton has 43986 states and 183912 transitions. Word has length 15 [2019-12-26 22:37:44,237 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:44,238 INFO L462 AbstractCegarLoop]: Abstraction has 43986 states and 183912 transitions. [2019-12-26 22:37:44,238 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:37:44,238 INFO L276 IsEmpty]: Start isEmpty. Operand 43986 states and 183912 transitions. [2019-12-26 22:37:44,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2019-12-26 22:37:44,241 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:44,241 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:44,241 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:44,241 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:44,242 INFO L82 PathProgramCache]: Analyzing trace with hash 703479247, now seen corresponding path program 1 times [2019-12-26 22:37:44,242 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:44,242 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257182851] [2019-12-26 22:37:44,242 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:44,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:44,311 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:44,312 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257182851] [2019-12-26 22:37:44,312 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:44,312 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:37:44,313 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1102289342] [2019-12-26 22:37:44,313 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:37:44,313 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:44,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:37:44,314 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:37:44,314 INFO L87 Difference]: Start difference. First operand 43986 states and 183912 transitions. Second operand 4 states. [2019-12-26 22:37:46,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:46,368 INFO L93 Difference]: Finished difference Result 62082 states and 254960 transitions. [2019-12-26 22:37:46,369 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:37:46,369 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2019-12-26 22:37:46,369 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:46,593 INFO L225 Difference]: With dead ends: 62082 [2019-12-26 22:37:46,593 INFO L226 Difference]: Without dead ends: 62054 [2019-12-26 22:37:46,594 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-26 22:37:46,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62054 states. [2019-12-26 22:37:48,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62054 to 51774. [2019-12-26 22:37:48,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51774 states. [2019-12-26 22:37:48,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51774 states to 51774 states and 215576 transitions. [2019-12-26 22:37:48,525 INFO L78 Accepts]: Start accepts. Automaton has 51774 states and 215576 transitions. Word has length 15 [2019-12-26 22:37:48,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:48,526 INFO L462 AbstractCegarLoop]: Abstraction has 51774 states and 215576 transitions. [2019-12-26 22:37:48,526 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:37:48,526 INFO L276 IsEmpty]: Start isEmpty. Operand 51774 states and 215576 transitions. [2019-12-26 22:37:48,542 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-26 22:37:48,542 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:48,543 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] [2019-12-26 22:37:48,543 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:48,543 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:48,543 INFO L82 PathProgramCache]: Analyzing trace with hash -1831569488, now seen corresponding path program 1 times [2019-12-26 22:37:48,543 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:48,544 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155504485] [2019-12-26 22:37:48,544 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:48,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:48,679 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:48,679 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1155504485] [2019-12-26 22:37:48,679 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:48,680 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:37:48,680 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893893436] [2019-12-26 22:37:48,680 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:37:48,681 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:48,681 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:37:48,681 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:37:48,681 INFO L87 Difference]: Start difference. First operand 51774 states and 215576 transitions. Second operand 5 states. [2019-12-26 22:37:50,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:50,990 INFO L93 Difference]: Finished difference Result 68854 states and 281988 transitions. [2019-12-26 22:37:50,991 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:37:50,991 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-26 22:37:50,991 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:51,163 INFO L225 Difference]: With dead ends: 68854 [2019-12-26 22:37:51,163 INFO L226 Difference]: Without dead ends: 68826 [2019-12-26 22:37:51,163 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:37:51,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68826 states. [2019-12-26 22:37:52,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68826 to 51450. [2019-12-26 22:37:52,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51450 states. [2019-12-26 22:37:52,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51450 states to 51450 states and 213896 transitions. [2019-12-26 22:37:52,726 INFO L78 Accepts]: Start accepts. Automaton has 51450 states and 213896 transitions. Word has length 21 [2019-12-26 22:37:52,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:52,727 INFO L462 AbstractCegarLoop]: Abstraction has 51450 states and 213896 transitions. [2019-12-26 22:37:52,727 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:37:52,727 INFO L276 IsEmpty]: Start isEmpty. Operand 51450 states and 213896 transitions. [2019-12-26 22:37:52,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 22:37:52,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:52,785 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] [2019-12-26 22:37:52,785 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:52,785 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:52,786 INFO L82 PathProgramCache]: Analyzing trace with hash 2027885083, now seen corresponding path program 1 times [2019-12-26 22:37:52,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:52,786 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422462670] [2019-12-26 22:37:52,786 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:52,803 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:52,833 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:52,833 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422462670] [2019-12-26 22:37:52,833 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:52,834 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:37:52,834 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [337933763] [2019-12-26 22:37:52,834 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:37:52,834 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:52,835 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:37:52,835 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:37:52,835 INFO L87 Difference]: Start difference. First operand 51450 states and 213896 transitions. Second operand 3 states. [2019-12-26 22:37:55,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:55,326 INFO L93 Difference]: Finished difference Result 64130 states and 263832 transitions. [2019-12-26 22:37:55,326 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:37:55,326 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 29 [2019-12-26 22:37:55,327 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:55,492 INFO L225 Difference]: With dead ends: 64130 [2019-12-26 22:37:55,493 INFO L226 Difference]: Without dead ends: 64130 [2019-12-26 22:37:55,493 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:37:55,782 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64130 states. [2019-12-26 22:37:56,850 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64130 to 56646. [2019-12-26 22:37:56,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56646 states. [2019-12-26 22:37:57,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56646 states to 56646 states and 234808 transitions. [2019-12-26 22:37:57,020 INFO L78 Accepts]: Start accepts. Automaton has 56646 states and 234808 transitions. Word has length 29 [2019-12-26 22:37:57,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:37:57,020 INFO L462 AbstractCegarLoop]: Abstraction has 56646 states and 234808 transitions. [2019-12-26 22:37:57,020 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:37:57,020 INFO L276 IsEmpty]: Start isEmpty. Operand 56646 states and 234808 transitions. [2019-12-26 22:37:57,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2019-12-26 22:37:57,055 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:37:57,055 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:37:57,055 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:37:57,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:37:57,055 INFO L82 PathProgramCache]: Analyzing trace with hash 1811393886, now seen corresponding path program 1 times [2019-12-26 22:37:57,056 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:37:57,056 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656082039] [2019-12-26 22:37:57,056 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:37:57,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:37:57,145 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:37:57,146 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656082039] [2019-12-26 22:37:57,146 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:37:57,146 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:37:57,146 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896146116] [2019-12-26 22:37:57,147 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:37:57,147 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:37:57,147 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:37:57,147 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:37:57,147 INFO L87 Difference]: Start difference. First operand 56646 states and 234808 transitions. Second operand 6 states. [2019-12-26 22:37:57,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:37:57,841 INFO L93 Difference]: Finished difference Result 81602 states and 332376 transitions. [2019-12-26 22:37:57,842 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-26 22:37:57,842 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 29 [2019-12-26 22:37:57,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:37:58,052 INFO L225 Difference]: With dead ends: 81602 [2019-12-26 22:37:58,053 INFO L226 Difference]: Without dead ends: 81538 [2019-12-26 22:37:58,053 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:37:58,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81538 states. [2019-12-26 22:37:59,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81538 to 65578. [2019-12-26 22:37:59,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65578 states. [2019-12-26 22:38:00,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65578 states to 65578 states and 270440 transitions. [2019-12-26 22:38:00,137 INFO L78 Accepts]: Start accepts. Automaton has 65578 states and 270440 transitions. Word has length 29 [2019-12-26 22:38:00,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:38:00,138 INFO L462 AbstractCegarLoop]: Abstraction has 65578 states and 270440 transitions. [2019-12-26 22:38:00,138 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:38:00,138 INFO L276 IsEmpty]: Start isEmpty. Operand 65578 states and 270440 transitions. [2019-12-26 22:38:00,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-26 22:38:00,212 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:38:00,212 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] [2019-12-26 22:38:00,212 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:38:00,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:38:00,213 INFO L82 PathProgramCache]: Analyzing trace with hash -1048930675, now seen corresponding path program 1 times [2019-12-26 22:38:00,213 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:38:00,214 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696118935] [2019-12-26 22:38:00,214 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:38:00,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:38:00,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:38:00,313 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696118935] [2019-12-26 22:38:00,313 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:38:00,313 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:38:00,314 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854618742] [2019-12-26 22:38:00,314 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:38:00,314 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:38:00,314 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:38:00,315 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:38:00,315 INFO L87 Difference]: Start difference. First operand 65578 states and 270440 transitions. Second operand 3 states. [2019-12-26 22:38:01,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:38:01,268 INFO L93 Difference]: Finished difference Result 65578 states and 269720 transitions. [2019-12-26 22:38:01,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:38:01,268 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 35 [2019-12-26 22:38:01,268 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:38:01,430 INFO L225 Difference]: With dead ends: 65578 [2019-12-26 22:38:01,430 INFO L226 Difference]: Without dead ends: 65578 [2019-12-26 22:38:01,430 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:38:01,720 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65578 states. [2019-12-26 22:38:02,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65578 to 65578. [2019-12-26 22:38:02,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65578 states. [2019-12-26 22:38:06,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65578 states to 65578 states and 269720 transitions. [2019-12-26 22:38:06,375 INFO L78 Accepts]: Start accepts. Automaton has 65578 states and 269720 transitions. Word has length 35 [2019-12-26 22:38:06,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:38:06,375 INFO L462 AbstractCegarLoop]: Abstraction has 65578 states and 269720 transitions. [2019-12-26 22:38:06,375 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:38:06,375 INFO L276 IsEmpty]: Start isEmpty. Operand 65578 states and 269720 transitions. [2019-12-26 22:38:06,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-26 22:38:06,434 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:38:06,434 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] [2019-12-26 22:38:06,434 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:38:06,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:38:06,435 INFO L82 PathProgramCache]: Analyzing trace with hash 1735231015, now seen corresponding path program 1 times [2019-12-26 22:38:06,435 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:38:06,435 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1496034953] [2019-12-26 22:38:06,435 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:38:06,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:38:06,643 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:38:06,644 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1496034953] [2019-12-26 22:38:06,644 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:38:06,644 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2019-12-26 22:38:06,644 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1977038187] [2019-12-26 22:38:06,645 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-26 22:38:06,645 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:38:06,645 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-26 22:38:06,645 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:38:06,645 INFO L87 Difference]: Start difference. First operand 65578 states and 269720 transitions. Second operand 9 states. [2019-12-26 22:38:08,333 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:38:08,333 INFO L93 Difference]: Finished difference Result 89414 states and 361616 transitions. [2019-12-26 22:38:08,334 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2019-12-26 22:38:08,334 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 35 [2019-12-26 22:38:08,334 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:38:08,562 INFO L225 Difference]: With dead ends: 89414 [2019-12-26 22:38:08,563 INFO L226 Difference]: Without dead ends: 89310 [2019-12-26 22:38:08,563 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=97, Invalid=323, Unknown=0, NotChecked=0, Total=420 [2019-12-26 22:38:08,910 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89310 states. [2019-12-26 22:38:10,372 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89310 to 58886. [2019-12-26 22:38:10,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 58886 states. [2019-12-26 22:38:10,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 58886 states to 58886 states and 243296 transitions. [2019-12-26 22:38:10,545 INFO L78 Accepts]: Start accepts. Automaton has 58886 states and 243296 transitions. Word has length 35 [2019-12-26 22:38:10,546 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:38:10,546 INFO L462 AbstractCegarLoop]: Abstraction has 58886 states and 243296 transitions. [2019-12-26 22:38:10,546 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-26 22:38:10,546 INFO L276 IsEmpty]: Start isEmpty. Operand 58886 states and 243296 transitions. [2019-12-26 22:38:10,613 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2019-12-26 22:38:10,613 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:38:10,614 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] [2019-12-26 22:38:10,614 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:38:10,614 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:38:10,614 INFO L82 PathProgramCache]: Analyzing trace with hash 903389864, now seen corresponding path program 1 times [2019-12-26 22:38:10,614 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:38:10,615 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [140392770] [2019-12-26 22:38:10,615 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:38:10,635 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:38:10,677 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:38:10,677 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [140392770] [2019-12-26 22:38:10,678 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:38:10,678 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-26 22:38:10,678 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1330191515] [2019-12-26 22:38:10,678 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-26 22:38:10,678 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:38:10,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-26 22:38:10,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-26 22:38:10,679 INFO L87 Difference]: Start difference. First operand 58886 states and 243296 transitions. Second operand 4 states. [2019-12-26 22:38:10,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:38:10,884 INFO L93 Difference]: Finished difference Result 47360 states and 179978 transitions. [2019-12-26 22:38:10,885 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-26 22:38:10,885 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 35 [2019-12-26 22:38:10,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:38:10,983 INFO L225 Difference]: With dead ends: 47360 [2019-12-26 22:38:10,983 INFO L226 Difference]: Without dead ends: 46252 [2019-12-26 22:38:10,984 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:38:11,187 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46252 states. [2019-12-26 22:38:12,349 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46252 to 46252. [2019-12-26 22:38:12,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46252 states. [2019-12-26 22:38:12,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46252 states to 46252 states and 176502 transitions. [2019-12-26 22:38:12,467 INFO L78 Accepts]: Start accepts. Automaton has 46252 states and 176502 transitions. Word has length 35 [2019-12-26 22:38:12,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:38:12,467 INFO L462 AbstractCegarLoop]: Abstraction has 46252 states and 176502 transitions. [2019-12-26 22:38:12,467 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-26 22:38:12,467 INFO L276 IsEmpty]: Start isEmpty. Operand 46252 states and 176502 transitions. [2019-12-26 22:38:12,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2019-12-26 22:38:12,503 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:38:12,503 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] [2019-12-26 22:38:12,503 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:38:12,504 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:38:12,504 INFO L82 PathProgramCache]: Analyzing trace with hash 1617947594, now seen corresponding path program 1 times [2019-12-26 22:38:12,504 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:38:12,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1412648992] [2019-12-26 22:38:12,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:38:12,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:38:12,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:38:12,590 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1412648992] [2019-12-26 22:38:12,590 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:38:12,590 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-26 22:38:12,590 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [886783038] [2019-12-26 22:38:12,591 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-26 22:38:12,591 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:38:12,591 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-26 22:38:12,591 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-26 22:38:12,591 INFO L87 Difference]: Start difference. First operand 46252 states and 176502 transitions. Second operand 5 states. [2019-12-26 22:38:12,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:38:12,725 INFO L93 Difference]: Finished difference Result 20151 states and 63661 transitions. [2019-12-26 22:38:12,726 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-26 22:38:12,726 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 36 [2019-12-26 22:38:12,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:38:12,765 INFO L225 Difference]: With dead ends: 20151 [2019-12-26 22:38:12,765 INFO L226 Difference]: Without dead ends: 19275 [2019-12-26 22:38:12,766 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:38:12,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19275 states. [2019-12-26 22:38:13,081 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19275 to 19275. [2019-12-26 22:38:13,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19275 states. [2019-12-26 22:38:13,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19275 states to 19275 states and 60863 transitions. [2019-12-26 22:38:13,118 INFO L78 Accepts]: Start accepts. Automaton has 19275 states and 60863 transitions. Word has length 36 [2019-12-26 22:38:13,119 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:38:13,119 INFO L462 AbstractCegarLoop]: Abstraction has 19275 states and 60863 transitions. [2019-12-26 22:38:13,119 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-26 22:38:13,119 INFO L276 IsEmpty]: Start isEmpty. Operand 19275 states and 60863 transitions. [2019-12-26 22:38:13,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-26 22:38:13,130 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:38:13,130 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-26 22:38:13,130 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:38:13,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:38:13,131 INFO L82 PathProgramCache]: Analyzing trace with hash 1645824889, now seen corresponding path program 1 times [2019-12-26 22:38:13,131 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:38:13,131 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45805140] [2019-12-26 22:38:13,131 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:38:13,149 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:38:13,207 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:38:13,208 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45805140] [2019-12-26 22:38:13,208 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:38:13,208 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:38:13,208 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [666677525] [2019-12-26 22:38:13,209 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:38:13,209 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:38:13,209 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:38:13,209 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:38:13,209 INFO L87 Difference]: Start difference. First operand 19275 states and 60863 transitions. Second operand 6 states. [2019-12-26 22:38:13,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:38:13,285 INFO L93 Difference]: Finished difference Result 3520 states and 8922 transitions. [2019-12-26 22:38:13,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:38:13,285 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2019-12-26 22:38:13,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:38:13,289 INFO L225 Difference]: With dead ends: 3520 [2019-12-26 22:38:13,289 INFO L226 Difference]: Without dead ends: 3151 [2019-12-26 22:38:13,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:38:13,295 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3151 states. [2019-12-26 22:38:13,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3151 to 3151. [2019-12-26 22:38:13,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3151 states. [2019-12-26 22:38:13,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3151 states to 3151 states and 7884 transitions. [2019-12-26 22:38:13,320 INFO L78 Accepts]: Start accepts. Automaton has 3151 states and 7884 transitions. Word has length 37 [2019-12-26 22:38:13,321 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:38:13,321 INFO L462 AbstractCegarLoop]: Abstraction has 3151 states and 7884 transitions. [2019-12-26 22:38:13,321 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:38:13,321 INFO L276 IsEmpty]: Start isEmpty. Operand 3151 states and 7884 transitions. [2019-12-26 22:38:13,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-26 22:38:13,324 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:38:13,324 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] [2019-12-26 22:38:13,325 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:38:13,325 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:38:13,325 INFO L82 PathProgramCache]: Analyzing trace with hash 210850107, now seen corresponding path program 1 times [2019-12-26 22:38:13,325 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:38:13,325 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365294325] [2019-12-26 22:38:13,325 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:38:13,344 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:38:13,462 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:38:13,462 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365294325] [2019-12-26 22:38:13,462 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:38:13,462 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:38:13,463 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2031969074] [2019-12-26 22:38:13,463 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:38:13,463 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:38:13,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:38:13,464 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:38:13,464 INFO L87 Difference]: Start difference. First operand 3151 states and 7884 transitions. Second operand 7 states. [2019-12-26 22:38:13,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:38:13,711 INFO L93 Difference]: Finished difference Result 5824 states and 14200 transitions. [2019-12-26 22:38:13,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-26 22:38:13,712 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-26 22:38:13,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:38:13,718 INFO L225 Difference]: With dead ends: 5824 [2019-12-26 22:38:13,719 INFO L226 Difference]: Without dead ends: 3603 [2019-12-26 22:38:13,719 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=120, Unknown=0, NotChecked=0, Total=182 [2019-12-26 22:38:13,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3603 states. [2019-12-26 22:38:13,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3603 to 3265. [2019-12-26 22:38:13,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3265 states. [2019-12-26 22:38:13,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3265 states to 3265 states and 8044 transitions. [2019-12-26 22:38:13,774 INFO L78 Accepts]: Start accepts. Automaton has 3265 states and 8044 transitions. Word has length 48 [2019-12-26 22:38:13,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:38:13,774 INFO L462 AbstractCegarLoop]: Abstraction has 3265 states and 8044 transitions. [2019-12-26 22:38:13,774 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:38:13,774 INFO L276 IsEmpty]: Start isEmpty. Operand 3265 states and 8044 transitions. [2019-12-26 22:38:13,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2019-12-26 22:38:13,778 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:38:13,778 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] [2019-12-26 22:38:13,779 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:38:13,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:38:13,779 INFO L82 PathProgramCache]: Analyzing trace with hash -784185183, now seen corresponding path program 2 times [2019-12-26 22:38:13,779 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:38:13,779 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512288589] [2019-12-26 22:38:13,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:38:13,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:38:13,887 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:38:13,888 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512288589] [2019-12-26 22:38:13,888 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:38:13,888 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-26 22:38:13,888 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830415660] [2019-12-26 22:38:13,889 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-26 22:38:13,889 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:38:13,889 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-26 22:38:13,893 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2019-12-26 22:38:13,893 INFO L87 Difference]: Start difference. First operand 3265 states and 8044 transitions. Second operand 7 states. [2019-12-26 22:38:13,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:38:13,993 INFO L93 Difference]: Finished difference Result 1347 states and 3711 transitions. [2019-12-26 22:38:13,993 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-26 22:38:13,993 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 48 [2019-12-26 22:38:13,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:38:13,996 INFO L225 Difference]: With dead ends: 1347 [2019-12-26 22:38:13,996 INFO L226 Difference]: Without dead ends: 1170 [2019-12-26 22:38:13,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2019-12-26 22:38:14,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1170 states. [2019-12-26 22:38:14,010 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1170 to 1058. [2019-12-26 22:38:14,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1058 states. [2019-12-26 22:38:14,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1058 states to 1058 states and 2908 transitions. [2019-12-26 22:38:14,012 INFO L78 Accepts]: Start accepts. Automaton has 1058 states and 2908 transitions. Word has length 48 [2019-12-26 22:38:14,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:38:14,013 INFO L462 AbstractCegarLoop]: Abstraction has 1058 states and 2908 transitions. [2019-12-26 22:38:14,013 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-26 22:38:14,013 INFO L276 IsEmpty]: Start isEmpty. Operand 1058 states and 2908 transitions. [2019-12-26 22:38:14,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:38:14,014 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:38:14,014 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-26 22:38:14,014 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:38:14,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:38:14,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1193491105, now seen corresponding path program 1 times [2019-12-26 22:38:14,015 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:38:14,015 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1524982986] [2019-12-26 22:38:14,015 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:38:14,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:38:14,285 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:38:14,286 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1524982986] [2019-12-26 22:38:14,286 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:38:14,286 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-26 22:38:14,286 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [461387414] [2019-12-26 22:38:14,287 INFO L442 AbstractCegarLoop]: Interpolant automaton has 13 states [2019-12-26 22:38:14,287 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:38:14,287 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2019-12-26 22:38:14,287 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=38, Invalid=118, Unknown=0, NotChecked=0, Total=156 [2019-12-26 22:38:14,287 INFO L87 Difference]: Start difference. First operand 1058 states and 2908 transitions. Second operand 13 states. [2019-12-26 22:38:15,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:38:15,148 INFO L93 Difference]: Finished difference Result 2067 states and 5525 transitions. [2019-12-26 22:38:15,149 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-26 22:38:15,149 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2019-12-26 22:38:15,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:38:15,152 INFO L225 Difference]: With dead ends: 2067 [2019-12-26 22:38:15,153 INFO L226 Difference]: Without dead ends: 1639 [2019-12-26 22:38:15,154 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 1 SyntacticMatches, 2 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 155 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=191, Invalid=621, Unknown=0, NotChecked=0, Total=812 [2019-12-26 22:38:15,157 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1639 states. [2019-12-26 22:38:15,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1639 to 1102. [2019-12-26 22:38:15,166 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1102 states. [2019-12-26 22:38:15,168 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1102 states to 1102 states and 3030 transitions. [2019-12-26 22:38:15,169 INFO L78 Accepts]: Start accepts. Automaton has 1102 states and 3030 transitions. Word has length 59 [2019-12-26 22:38:15,169 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:38:15,169 INFO L462 AbstractCegarLoop]: Abstraction has 1102 states and 3030 transitions. [2019-12-26 22:38:15,169 INFO L463 AbstractCegarLoop]: Interpolant automaton has 13 states. [2019-12-26 22:38:15,169 INFO L276 IsEmpty]: Start isEmpty. Operand 1102 states and 3030 transitions. [2019-12-26 22:38:15,171 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:38:15,171 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:38:15,171 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] [2019-12-26 22:38:15,171 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:38:15,172 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:38:15,172 INFO L82 PathProgramCache]: Analyzing trace with hash -2035601323, now seen corresponding path program 2 times [2019-12-26 22:38:15,172 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:38:15,172 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1083125067] [2019-12-26 22:38:15,172 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:38:15,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:38:15,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:38:15,270 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1083125067] [2019-12-26 22:38:15,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:38:15,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-26 22:38:15,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1011227384] [2019-12-26 22:38:15,271 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-26 22:38:15,271 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:38:15,271 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-26 22:38:15,271 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2019-12-26 22:38:15,272 INFO L87 Difference]: Start difference. First operand 1102 states and 3030 transitions. Second operand 6 states. [2019-12-26 22:38:15,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:38:15,341 INFO L93 Difference]: Finished difference Result 1642 states and 4230 transitions. [2019-12-26 22:38:15,341 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-26 22:38:15,342 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 59 [2019-12-26 22:38:15,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:38:15,343 INFO L225 Difference]: With dead ends: 1642 [2019-12-26 22:38:15,343 INFO L226 Difference]: Without dead ends: 607 [2019-12-26 22:38:15,343 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-26 22:38:15,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 607 states. [2019-12-26 22:38:15,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 607 to 601. [2019-12-26 22:38:15,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 601 states. [2019-12-26 22:38:15,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 601 states to 601 states and 1337 transitions. [2019-12-26 22:38:15,354 INFO L78 Accepts]: Start accepts. Automaton has 601 states and 1337 transitions. Word has length 59 [2019-12-26 22:38:15,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:38:15,354 INFO L462 AbstractCegarLoop]: Abstraction has 601 states and 1337 transitions. [2019-12-26 22:38:15,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-26 22:38:15,355 INFO L276 IsEmpty]: Start isEmpty. Operand 601 states and 1337 transitions. [2019-12-26 22:38:15,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2019-12-26 22:38:15,356 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:38:15,356 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] [2019-12-26 22:38:15,356 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:38:15,356 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:38:15,357 INFO L82 PathProgramCache]: Analyzing trace with hash 1632162753, now seen corresponding path program 3 times [2019-12-26 22:38:15,357 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:38:15,357 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68749325] [2019-12-26 22:38:15,357 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:38:15,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:38:15,465 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:38:15,466 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68749325] [2019-12-26 22:38:15,466 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:38:15,466 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-26 22:38:15,466 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1002464243] [2019-12-26 22:38:15,467 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-26 22:38:15,467 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:38:15,467 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-26 22:38:15,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:38:15,468 INFO L87 Difference]: Start difference. First operand 601 states and 1337 transitions. Second operand 3 states. [2019-12-26 22:38:15,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:38:15,492 INFO L93 Difference]: Finished difference Result 572 states and 1242 transitions. [2019-12-26 22:38:15,492 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-26 22:38:15,493 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 59 [2019-12-26 22:38:15,493 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:38:15,494 INFO L225 Difference]: With dead ends: 572 [2019-12-26 22:38:15,494 INFO L226 Difference]: Without dead ends: 572 [2019-12-26 22:38:15,494 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-26 22:38:15,496 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 572 states. [2019-12-26 22:38:15,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 572 to 572. [2019-12-26 22:38:15,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 572 states. [2019-12-26 22:38:15,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 1242 transitions. [2019-12-26 22:38:15,504 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 1242 transitions. Word has length 59 [2019-12-26 22:38:15,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:38:15,505 INFO L462 AbstractCegarLoop]: Abstraction has 572 states and 1242 transitions. [2019-12-26 22:38:15,505 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-26 22:38:15,506 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 1242 transitions. [2019-12-26 22:38:15,507 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:38:15,507 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:38:15,507 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] [2019-12-26 22:38:15,507 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:38:15,508 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:38:15,508 INFO L82 PathProgramCache]: Analyzing trace with hash 1384719400, now seen corresponding path program 1 times [2019-12-26 22:38:15,508 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:38:15,508 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905899799] [2019-12-26 22:38:15,509 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:38:15,549 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-26 22:38:15,764 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-26 22:38:15,764 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905899799] [2019-12-26 22:38:15,764 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-26 22:38:15,765 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-26 22:38:15,765 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069443180] [2019-12-26 22:38:15,765 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-26 22:38:15,765 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-26 22:38:15,766 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-26 22:38:15,766 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=105, Unknown=0, NotChecked=0, Total=132 [2019-12-26 22:38:15,766 INFO L87 Difference]: Start difference. First operand 572 states and 1242 transitions. Second operand 12 states. [2019-12-26 22:38:16,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-26 22:38:16,065 INFO L93 Difference]: Finished difference Result 828 states and 1780 transitions. [2019-12-26 22:38:16,065 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-26 22:38:16,065 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 60 [2019-12-26 22:38:16,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-26 22:38:16,067 INFO L225 Difference]: With dead ends: 828 [2019-12-26 22:38:16,067 INFO L226 Difference]: Without dead ends: 794 [2019-12-26 22:38:16,068 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2019-12-26 22:38:16,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 794 states. [2019-12-26 22:38:16,075 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 794 to 776. [2019-12-26 22:38:16,075 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 776 states. [2019-12-26 22:38:16,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 776 states to 776 states and 1695 transitions. [2019-12-26 22:38:16,076 INFO L78 Accepts]: Start accepts. Automaton has 776 states and 1695 transitions. Word has length 60 [2019-12-26 22:38:16,076 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-26 22:38:16,076 INFO L462 AbstractCegarLoop]: Abstraction has 776 states and 1695 transitions. [2019-12-26 22:38:16,076 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-26 22:38:16,076 INFO L276 IsEmpty]: Start isEmpty. Operand 776 states and 1695 transitions. [2019-12-26 22:38:16,077 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2019-12-26 22:38:16,077 INFO L403 BasicCegarLoop]: Found error trace [2019-12-26 22:38:16,078 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] [2019-12-26 22:38:16,078 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P3Err0ASSERT_VIOLATIONERROR_FUNCTION, P3Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3INUSE_VIOLATION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-26 22:38:16,078 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-26 22:38:16,078 INFO L82 PathProgramCache]: Analyzing trace with hash 483952232, now seen corresponding path program 2 times [2019-12-26 22:38:16,078 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-26 22:38:16,078 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590482369] [2019-12-26 22:38:16,078 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-26 22:38:16,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:38:16,142 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-26 22:38:16,216 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-26 22:38:16,216 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-26 22:38:16,221 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [794] [794] ULTIMATE.startENTRY-->L835: Formula: (let ((.cse0 (store |v_#valid_74| 0 0))) (and (= v_~z$r_buff1_thd1~0_136 0) (= 0 v_~__unbuffered_p3_EBX~0_151) (= |v_#memory_int_27| (store |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1149~0.base_21| (store (select |v_#memory_int_28| |v_ULTIMATE.start_main_~#t1149~0.base_21|) |v_ULTIMATE.start_main_~#t1149~0.offset_16| 0))) (= 0 v_~__unbuffered_p0_EAX~0_45) (= v_~z$read_delayed_var~0.offset_6 0) (= |v_#NULL.offset_7| 0) (= v_~__unbuffered_p3_EAX~0_151 0) (= v_~__unbuffered_cnt~0_172 0) (= v_~main$tmp_guard0~0_29 0) (= v_~z$r_buff1_thd0~0_320 0) (= v_~y~0_38 0) (= v_~z$w_buff1~0_115 0) (= 0 v_~weak$$choice0~0_17) (= v_~z$mem_tmp~0_24 0) (= v_~z$read_delayed~0_5 0) (< |v_#StackHeapBarrier_20| |v_ULTIMATE.start_main_~#t1149~0.base_21|) (= v_~z$r_buff0_thd2~0_135 0) (= 0 v_~z$r_buff1_thd3~0_221) (= |v_#valid_72| (store .cse0 |v_ULTIMATE.start_main_~#t1149~0.base_21| 1)) (= v_~z$read_delayed_var~0.base_6 0) (= v_~z$r_buff1_thd2~0_136 0) (= v_~z$w_buff1_used~0_340 0) (= v_~main$tmp_guard1~0_28 0) (= 0 v_~z$flush_delayed~0_43) (= v_~z$w_buff0_used~0_571 0) (= v_~b~0_164 0) (= 0 v_~z$r_buff0_thd3~0_200) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t1149~0.base_21|)) (< 0 |v_#StackHeapBarrier_20|) (= 0 |v_#NULL.base_7|) (= v_~z~0_188 0) (= v_~weak$$choice2~0_123 0) (= v_~a~0_136 0) (= v_~z$r_buff0_thd0~0_374 0) (= v_~z$r_buff0_thd1~0_137 0) (= 0 v_~__unbuffered_p1_EAX~0_36) (= (store |v_#length_28| |v_ULTIMATE.start_main_~#t1149~0.base_21| 4) |v_#length_27|) (= 0 v_~z$r_buff1_thd4~0_193) (= 0 |v_ULTIMATE.start_main_~#t1149~0.offset_16|) (= v_~z$w_buff0~0_113 0) (= v_~x~0_47 0) (= 0 v_~z$r_buff0_thd4~0_323))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_20|, #valid=|v_#valid_74|, #memory_int=|v_#memory_int_28|, #length=|v_#length_28|} OutVars{ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_80|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_136, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_40|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_35|, #NULL.offset=|v_#NULL.offset_7|, ULTIMATE.start_main_#t~ite20=|v_ULTIMATE.start_main_#t~ite20_27|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_16|, ULTIMATE.start_main_#t~ite22=|v_ULTIMATE.start_main_#t~ite22_32|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_49|, ~a~0=v_~a~0_136, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_374, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_45, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_36, ~z$r_buff0_thd4~0=v_~z$r_buff0_thd4~0_323, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_151, #length=|v_#length_27|, ~z$mem_tmp~0=v_~z$mem_tmp~0_24, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_73|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_105|, ULTIMATE.start_main_~#t1151~0.base=|v_ULTIMATE.start_main_~#t1151~0.base_21|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_340, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_192|, ~z$flush_delayed~0=v_~z$flush_delayed~0_43, ULTIMATE.start_main_#t~ite31=|v_ULTIMATE.start_main_#t~ite31_18|, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_28|, ~weak$$choice0~0=v_~weak$$choice0~0_17, #StackHeapBarrier=|v_#StackHeapBarrier_20|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_44|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_136, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_6|, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_6, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_200, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_172, ~x~0=v_~x~0_47, ULTIMATE.start_main_~#t1152~0.base=|v_ULTIMATE.start_main_~#t1152~0.base_22|, ULTIMATE.start_main_~#t1150~0.offset=|v_ULTIMATE.start_main_~#t1150~0.offset_16|, ~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_193, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_27|, ~z$read_delayed~0=v_~z$read_delayed~0_5, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_35|, ~z$w_buff1~0=v_~z$w_buff1~0_115, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_28, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_42|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_6, ULTIMATE.start_main_#t~ite21=|v_ULTIMATE.start_main_#t~ite21_22|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_32|, ULTIMATE.start_main_~#t1150~0.base=|v_ULTIMATE.start_main_~#t1150~0.base_22|, ULTIMATE.start_main_#t~ite23=|v_ULTIMATE.start_main_#t~ite23_36|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_35|, ULTIMATE.start_main_#t~ite30=|v_ULTIMATE.start_main_#t~ite30_33|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_320, ULTIMATE.start_main_#t~nondet26=|v_ULTIMATE.start_main_#t~nondet26_26|, ~y~0=v_~y~0_38, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_135, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_571, ~z$w_buff0~0=v_~z$w_buff0~0_113, ULTIMATE.start_main_#t~ite19=|v_ULTIMATE.start_main_#t~ite19_30|, ULTIMATE.start_main_#t~nondet25=|v_ULTIMATE.start_main_#t~nondet25_26|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_221, ULTIMATE.start_main_~#t1149~0.offset=|v_ULTIMATE.start_main_~#t1149~0.offset_16|, ULTIMATE.start_main_~#t1152~0.offset=|v_ULTIMATE.start_main_~#t1152~0.offset_16|, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_120|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_30|, ULTIMATE.start_main_~#t1149~0.base=|v_ULTIMATE.start_main_~#t1149~0.base_21|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_29, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_151, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_34|, #NULL.base=|v_#NULL.base_7|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_27|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_24|, ULTIMATE.start_main_~#t1151~0.offset=|v_ULTIMATE.start_main_~#t1151~0.offset_16|, ~b~0=v_~b~0_164, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_18|, #valid=|v_#valid_72|, #memory_int=|v_#memory_int_27|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_6|, ULTIMATE.start_main_#t~nondet18=|v_ULTIMATE.start_main_#t~nondet18_15|, ~z~0=v_~z~0_188, ~weak$$choice2~0=v_~weak$$choice2~0_123, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_137} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite20, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite22, ULTIMATE.start_main_#t~ite45, ~a~0, ~z$r_buff0_thd0~0, ~__unbuffered_p0_EAX~0, ~__unbuffered_p1_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EAX~0, #length, ~z$mem_tmp~0, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ULTIMATE.start_main_~#t1151~0.base, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite31, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ULTIMATE.start_main_#t~nondet15, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ULTIMATE.start_main_#t~nondet17, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t1152~0.base, ULTIMATE.start_main_~#t1150~0.offset, ~z$r_buff1_thd4~0, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite21, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t1150~0.base, ULTIMATE.start_main_#t~ite23, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_#t~ite30, ~z$r_buff1_thd0~0, ULTIMATE.start_main_#t~nondet26, ~y~0, ~z$r_buff0_thd2~0, ~z$w_buff0_used~0, ~z$w_buff0~0, ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~nondet25, ~z$r_buff1_thd3~0, ULTIMATE.start_main_~#t1149~0.offset, ULTIMATE.start_main_~#t1152~0.offset, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ULTIMATE.start_main_~#t1149~0.base, ~main$tmp_guard0~0, ~__unbuffered_p3_EBX~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_~#t1151~0.offset, ~b~0, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet16, ULTIMATE.start_main_#t~nondet18, ~z~0, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-26 22:38:16,222 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L835-1-->L837: Formula: (and (not (= |v_ULTIMATE.start_main_~#t1150~0.base_12| 0)) (= 0 (select |v_#valid_45| |v_ULTIMATE.start_main_~#t1150~0.base_12|)) (= |v_ULTIMATE.start_main_~#t1150~0.offset_10| 0) (< |v_#StackHeapBarrier_13| |v_ULTIMATE.start_main_~#t1150~0.base_12|) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1150~0.base_12| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t1150~0.base_12|) |v_ULTIMATE.start_main_~#t1150~0.offset_10| 1)) |v_#memory_int_21|) (= |v_#valid_44| (store |v_#valid_45| |v_ULTIMATE.start_main_~#t1150~0.base_12| 1)) (= (store |v_#length_22| |v_ULTIMATE.start_main_~#t1150~0.base_12| 4) |v_#length_21|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_45|, #memory_int=|v_#memory_int_22|, #length=|v_#length_22|} OutVars{ULTIMATE.start_main_~#t1150~0.offset=|v_ULTIMATE.start_main_~#t1150~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_13|, #valid=|v_#valid_44|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet15=|v_ULTIMATE.start_main_#t~nondet15_4|, #length=|v_#length_21|, ULTIMATE.start_main_~#t1150~0.base=|v_ULTIMATE.start_main_~#t1150~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1150~0.offset, #valid, #memory_int, ULTIMATE.start_main_#t~nondet15, #length, ULTIMATE.start_main_~#t1150~0.base] because there is no mapped edge [2019-12-26 22:38:16,226 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L837-1-->L839: Formula: (and (= 0 |v_ULTIMATE.start_main_~#t1151~0.offset_8|) (= (store |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1151~0.base_8| (store (select |v_#memory_int_18| |v_ULTIMATE.start_main_~#t1151~0.base_8|) |v_ULTIMATE.start_main_~#t1151~0.offset_8| 2)) |v_#memory_int_17|) (not (= 0 |v_ULTIMATE.start_main_~#t1151~0.base_8|)) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t1151~0.base_8|) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t1151~0.base_8| 4)) (= (select |v_#valid_36| |v_ULTIMATE.start_main_~#t1151~0.base_8|) 0) (= |v_#valid_35| (store |v_#valid_36| |v_ULTIMATE.start_main_~#t1151~0.base_8| 1))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_36|, #memory_int=|v_#memory_int_18|, #length=|v_#length_18|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t1151~0.offset=|v_ULTIMATE.start_main_~#t1151~0.offset_8|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_17|, ULTIMATE.start_main_~#t1151~0.base=|v_ULTIMATE.start_main_~#t1151~0.base_8|, ULTIMATE.start_main_#t~nondet16=|v_ULTIMATE.start_main_#t~nondet16_3|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1151~0.offset, #valid, #memory_int, ULTIMATE.start_main_~#t1151~0.base, ULTIMATE.start_main_#t~nondet16, #length] because there is no mapped edge [2019-12-26 22:38:16,229 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L839-1-->L841: Formula: (and (< |v_#StackHeapBarrier_14| |v_ULTIMATE.start_main_~#t1152~0.base_12|) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1152~0.base_12| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t1152~0.base_12|) |v_ULTIMATE.start_main_~#t1152~0.offset_10| 3)) |v_#memory_int_23|) (= |v_ULTIMATE.start_main_~#t1152~0.offset_10| 0) (not (= 0 |v_ULTIMATE.start_main_~#t1152~0.base_12|)) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t1152~0.base_12| 4)) (= |v_#valid_46| (store |v_#valid_47| |v_ULTIMATE.start_main_~#t1152~0.base_12| 1)) (= (select |v_#valid_47| |v_ULTIMATE.start_main_~#t1152~0.base_12|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_14|, #valid=|v_#valid_47|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_14|, ULTIMATE.start_main_~#t1152~0.offset=|v_ULTIMATE.start_main_~#t1152~0.offset_10|, #valid=|v_#valid_46|, #memory_int=|v_#memory_int_23|, #length=|v_#length_23|, ULTIMATE.start_main_#t~nondet17=|v_ULTIMATE.start_main_#t~nondet17_4|, ULTIMATE.start_main_~#t1152~0.base=|v_ULTIMATE.start_main_~#t1152~0.base_12|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t1152~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet17, ULTIMATE.start_main_~#t1152~0.base] because there is no mapped edge [2019-12-26 22:38:16,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L4-->L812: Formula: (and (= ~a~0_Out335975618 1) (= ~z$r_buff0_thd1~0_In335975618 ~z$r_buff1_thd1~0_Out335975618) (not (= P3Thread1of1ForFork3___VERIFIER_assert_~expression_In335975618 0)) (= ~z$r_buff1_thd2~0_Out335975618 ~z$r_buff0_thd2~0_In335975618) (= ~z$r_buff1_thd4~0_Out335975618 ~z$r_buff0_thd4~0_In335975618) (= ~z$r_buff1_thd3~0_Out335975618 ~z$r_buff0_thd3~0_In335975618) (= ~z$r_buff0_thd4~0_Out335975618 1) (= ~__unbuffered_p3_EBX~0_Out335975618 ~b~0_In335975618) (= ~__unbuffered_p3_EAX~0_Out335975618 ~a~0_Out335975618) (= ~z$r_buff1_thd0~0_Out335975618 ~z$r_buff0_thd0~0_In335975618)) InVars {P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In335975618, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In335975618, ~b~0=~b~0_In335975618, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In335975618, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In335975618, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In335975618, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In335975618} OutVars{P3Thread1of1ForFork3___VERIFIER_assert_~expression=P3Thread1of1ForFork3___VERIFIER_assert_~expression_In335975618, ~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_Out335975618, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_Out335975618, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_Out335975618, ~__unbuffered_p3_EBX~0=~__unbuffered_p3_EBX~0_Out335975618, ~a~0=~a~0_Out335975618, ~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In335975618, ~b~0=~b~0_In335975618, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_Out335975618, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_Out335975618, ~__unbuffered_p3_EAX~0=~__unbuffered_p3_EAX~0_Out335975618, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out335975618, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In335975618, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In335975618, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In335975618} AuxVars[] AssignedVars[~a~0, ~z$r_buff1_thd4~0, ~z$r_buff1_thd3~0, ~z$r_buff1_thd0~0, ~z$r_buff1_thd2~0, ~z$r_buff1_thd1~0, ~__unbuffered_p3_EAX~0, ~z$r_buff0_thd4~0, ~__unbuffered_p3_EBX~0] because there is no mapped edge [2019-12-26 22:38:16,231 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] P0ENTRY-->P0EXIT: Formula: (and (= v_P0Thread1of1ForFork0_~arg.base_20 |v_P0Thread1of1ForFork0_#in~arg.base_20|) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= v_P0Thread1of1ForFork0_~arg.offset_20 |v_P0Thread1of1ForFork0_#in~arg.offset_20|) (= v_~x~0_33 v_~__unbuffered_p0_EAX~0_26) (= v_~b~0_72 1) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_115 (+ v_~__unbuffered_cnt~0_116 1))) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_116, ~x~0=v_~x~0_33} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_20|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_26, P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, ~b~0=v_~b~0_72, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_20|, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_115, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_20, ~x~0=v_~x~0_33, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_20} AuxVars[] AssignedVars[~__unbuffered_p0_EAX~0, P0Thread1of1ForFork0_#res.offset, ~b~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-26 22:38:16,232 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] P1ENTRY-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= v_~y~0_25 v_~__unbuffered_p1_EAX~0_14) (= |v_P1Thread1of1ForFork1_#in~arg.offset_10| v_P1Thread1of1ForFork1_~arg.offset_10) (= v_~x~0_18 1) (= v_P1Thread1of1ForFork1_~arg.base_10 |v_P1Thread1of1ForFork1_#in~arg.base_10|) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, ~y~0=v_~y~0_25} OutVars{P1Thread1of1ForFork1_~arg.offset=v_P1Thread1of1ForFork1_~arg.offset_10, P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_14, P1Thread1of1ForFork1_~arg.base=v_P1Thread1of1ForFork1_~arg.base_10, P1Thread1of1ForFork1_#in~arg.base=|v_P1Thread1of1ForFork1_#in~arg.base_10|, P1Thread1of1ForFork1_#in~arg.offset=|v_P1Thread1of1ForFork1_#in~arg.offset_10|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, ~y~0=v_~y~0_25, ~x~0=v_~x~0_18, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_~arg.offset, P1Thread1of1ForFork1_#res.offset, ~__unbuffered_p1_EAX~0, P1Thread1of1ForFork1_~arg.base, ~__unbuffered_cnt~0, ~x~0, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-26 22:38:16,234 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L813-->L813-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd4~0_In1557690366 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In1557690366 256) 0))) (or (and (= |P3Thread1of1ForFork3_#t~ite11_Out1557690366| ~z$w_buff0_used~0_In1557690366) (or .cse0 .cse1)) (and (not .cse1) (= |P3Thread1of1ForFork3_#t~ite11_Out1557690366| 0) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1557690366, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1557690366} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1557690366, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In1557690366, P3Thread1of1ForFork3_#t~ite11=|P3Thread1of1ForFork3_#t~ite11_Out1557690366|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite11] because there is no mapped edge [2019-12-26 22:38:16,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [720] [720] L776-2-->L776-4: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In564880066 256) 0)) (.cse0 (= (mod ~z$r_buff1_thd3~0_In564880066 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$w_buff1~0_In564880066 |P2Thread1of1ForFork2_#t~ite3_Out564880066|)) (and (or .cse1 .cse0) (= ~z~0_In564880066 |P2Thread1of1ForFork2_#t~ite3_Out564880066|)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In564880066, ~z$w_buff1_used~0=~z$w_buff1_used~0_In564880066, ~z$w_buff1~0=~z$w_buff1~0_In564880066, ~z~0=~z~0_In564880066} OutVars{P2Thread1of1ForFork2_#t~ite3=|P2Thread1of1ForFork2_#t~ite3_Out564880066|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In564880066, ~z$w_buff1_used~0=~z$w_buff1_used~0_In564880066, ~z$w_buff1~0=~z$w_buff1~0_In564880066, ~z~0=~z~0_In564880066} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite3] because there is no mapped edge [2019-12-26 22:38:16,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [669] [669] L776-4-->L777: Formula: (= v_~z~0_18 |v_P2Thread1of1ForFork2_#t~ite3_8|) InVars {P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_8|} OutVars{P2Thread1of1ForFork2_#t~ite4=|v_P2Thread1of1ForFork2_#t~ite4_9|, P2Thread1of1ForFork2_#t~ite3=|v_P2Thread1of1ForFork2_#t~ite3_7|, ~z~0=v_~z~0_18} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite4, P2Thread1of1ForFork2_#t~ite3, ~z~0] because there is no mapped edge [2019-12-26 22:38:16,235 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [731] [731] L777-->L777-2: Formula: (let ((.cse1 (= (mod ~z$r_buff0_thd3~0_In-1386470526 256) 0)) (.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1386470526 256)))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite5_Out-1386470526|) (not .cse1)) (and (= ~z$w_buff0_used~0_In-1386470526 |P2Thread1of1ForFork2_#t~ite5_Out-1386470526|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1386470526, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1386470526} OutVars{P2Thread1of1ForFork2_#t~ite5=|P2Thread1of1ForFork2_#t~ite5_Out-1386470526|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1386470526, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1386470526} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite5] because there is no mapped edge [2019-12-26 22:38:16,236 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [729] [729] L778-->L778-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-838135118 256) 0)) (.cse0 (= (mod ~z$r_buff0_thd3~0_In-838135118 256) 0)) (.cse2 (= (mod ~z$w_buff1_used~0_In-838135118 256) 0)) (.cse3 (= (mod ~z$r_buff1_thd3~0_In-838135118 256) 0))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite6_Out-838135118| ~z$w_buff1_used~0_In-838135118) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork2_#t~ite6_Out-838135118| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-838135118, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-838135118, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-838135118, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-838135118} OutVars{P2Thread1of1ForFork2_#t~ite6=|P2Thread1of1ForFork2_#t~ite6_Out-838135118|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-838135118, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-838135118, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-838135118, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-838135118} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite6] because there is no mapped edge [2019-12-26 22:38:16,237 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] L779-->L779-2: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff0_used~0_In-1837757037 256))) (.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In-1837757037 256)))) (or (and (or .cse0 .cse1) (= |P2Thread1of1ForFork2_#t~ite7_Out-1837757037| ~z$r_buff0_thd3~0_In-1837757037)) (and (= |P2Thread1of1ForFork2_#t~ite7_Out-1837757037| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1837757037, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1837757037} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1837757037, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1837757037, P2Thread1of1ForFork2_#t~ite7=|P2Thread1of1ForFork2_#t~ite7_Out-1837757037|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite7] because there is no mapped edge [2019-12-26 22:38:16,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [727] [727] L780-->L780-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff1_thd3~0_In932103655 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In932103655 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In932103655 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In932103655 256) 0))) (or (and (= |P2Thread1of1ForFork2_#t~ite8_Out932103655| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= |P2Thread1of1ForFork2_#t~ite8_Out932103655| ~z$r_buff1_thd3~0_In932103655)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In932103655, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In932103655, ~z$w_buff1_used~0=~z$w_buff1_used~0_In932103655, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In932103655} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In932103655, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In932103655, ~z$w_buff1_used~0=~z$w_buff1_used~0_In932103655, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In932103655, P2Thread1of1ForFork2_#t~ite8=|P2Thread1of1ForFork2_#t~ite8_Out932103655|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 22:38:16,238 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [769] [769] L780-2-->P2EXIT: Formula: (and (= |v_P2Thread1of1ForFork2_#t~ite8_44| v_~z$r_buff1_thd3~0_114) (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= (+ v_~__unbuffered_cnt~0_83 1) v_~__unbuffered_cnt~0_82)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_83, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_44|} OutVars{~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_114, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_82, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|, P2Thread1of1ForFork2_#t~ite8=|v_P2Thread1of1ForFork2_#t~ite8_43|} AuxVars[] AssignedVars[~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset, P2Thread1of1ForFork2_#t~ite8] because there is no mapped edge [2019-12-26 22:38:16,239 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [723] [723] L814-->L814-2: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In121484548 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd4~0_In121484548 256))) (.cse2 (= (mod ~z$w_buff0_used~0_In121484548 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd4~0_In121484548 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P3Thread1of1ForFork3_#t~ite12_Out121484548|)) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In121484548 |P3Thread1of1ForFork3_#t~ite12_Out121484548|) (or .cse2 .cse3)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In121484548, ~z$w_buff0_used~0=~z$w_buff0_used~0_In121484548, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In121484548, ~z$w_buff1_used~0=~z$w_buff1_used~0_In121484548} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In121484548, ~z$w_buff0_used~0=~z$w_buff0_used~0_In121484548, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In121484548, ~z$w_buff1_used~0=~z$w_buff1_used~0_In121484548, P3Thread1of1ForFork3_#t~ite12=|P3Thread1of1ForFork3_#t~ite12_Out121484548|} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite12] because there is no mapped edge [2019-12-26 22:38:16,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L815-->L816: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In579527181 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In579527181 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd4~0_Out579527181 ~z$r_buff0_thd4~0_In579527181)) (and (not .cse1) (= 0 ~z$r_buff0_thd4~0_Out579527181) (not .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In579527181, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In579527181} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In579527181, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_Out579527181, P3Thread1of1ForFork3_#t~ite13=|P3Thread1of1ForFork3_#t~ite13_Out579527181|} AuxVars[] AssignedVars[~z$r_buff0_thd4~0, P3Thread1of1ForFork3_#t~ite13] because there is no mapped edge [2019-12-26 22:38:16,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [728] [728] L816-->L816-2: Formula: (let ((.cse2 (= (mod ~z$r_buff1_thd4~0_In-865466630 256) 0)) (.cse3 (= (mod ~z$w_buff1_used~0_In-865466630 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-865466630 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd4~0_In-865466630 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P3Thread1of1ForFork3_#t~ite14_Out-865466630| 0)) (and (or .cse2 .cse3) (= |P3Thread1of1ForFork3_#t~ite14_Out-865466630| ~z$r_buff1_thd4~0_In-865466630) (or .cse1 .cse0)))) InVars {~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-865466630, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-865466630, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-865466630, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-865466630} OutVars{~z$r_buff1_thd4~0=~z$r_buff1_thd4~0_In-865466630, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-865466630, P3Thread1of1ForFork3_#t~ite14=|P3Thread1of1ForFork3_#t~ite14_Out-865466630|, ~z$r_buff0_thd4~0=~z$r_buff0_thd4~0_In-865466630, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-865466630} AuxVars[] AssignedVars[P3Thread1of1ForFork3_#t~ite14] because there is no mapped edge [2019-12-26 22:38:16,241 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [770] [770] L816-2-->P3EXIT: Formula: (and (= v_~__unbuffered_cnt~0_106 (+ v_~__unbuffered_cnt~0_107 1)) (= 0 |v_P3Thread1of1ForFork3_#res.offset_5|) (= 0 |v_P3Thread1of1ForFork3_#res.base_5|) (= |v_P3Thread1of1ForFork3_#t~ite14_48| v_~z$r_buff1_thd4~0_102)) InVars {P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_48|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_107} OutVars{~z$r_buff1_thd4~0=v_~z$r_buff1_thd4~0_102, P3Thread1of1ForFork3_#t~ite14=|v_P3Thread1of1ForFork3_#t~ite14_47|, P3Thread1of1ForFork3_#res.base=|v_P3Thread1of1ForFork3_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_106, P3Thread1of1ForFork3_#res.offset=|v_P3Thread1of1ForFork3_#res.offset_5|} AuxVars[] AssignedVars[~z$r_buff1_thd4~0, P3Thread1of1ForFork3_#t~ite14, P3Thread1of1ForFork3_#res.base, ~__unbuffered_cnt~0, P3Thread1of1ForFork3_#res.offset] because there is no mapped edge [2019-12-26 22:38:16,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [648] [648] L845-->L847-2: Formula: (and (or (= 0 (mod v_~z$w_buff0_used~0_79 256)) (= (mod v_~z$r_buff0_thd0~0_53 256) 0)) (not (= 0 (mod v_~main$tmp_guard0~0_5 256)))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_53, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_79, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_5} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-26 22:38:16,242 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [733] [733] L847-2-->L847-5: Formula: (let ((.cse1 (= (mod ~z$w_buff1_used~0_In-205928940 256) 0)) (.cse2 (= 0 (mod ~z$r_buff1_thd0~0_In-205928940 256))) (.cse0 (= |ULTIMATE.start_main_#t~ite19_Out-205928940| |ULTIMATE.start_main_#t~ite20_Out-205928940|))) (or (and .cse0 (not .cse1) (not .cse2) (= |ULTIMATE.start_main_#t~ite19_Out-205928940| ~z$w_buff1~0_In-205928940)) (and (or .cse1 .cse2) .cse0 (= |ULTIMATE.start_main_#t~ite19_Out-205928940| ~z~0_In-205928940)))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-205928940, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-205928940, ~z$w_buff1~0=~z$w_buff1~0_In-205928940, ~z~0=~z~0_In-205928940} OutVars{ULTIMATE.start_main_#t~ite19=|ULTIMATE.start_main_#t~ite19_Out-205928940|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-205928940, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-205928940, ~z$w_buff1~0=~z$w_buff1~0_In-205928940, ~z~0=~z~0_In-205928940, ULTIMATE.start_main_#t~ite20=|ULTIMATE.start_main_#t~ite20_Out-205928940|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite19, ULTIMATE.start_main_#t~ite20] because there is no mapped edge [2019-12-26 22:38:16,243 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [725] [725] L848-->L848-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1732922066 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In1732922066 256) 0))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite21_Out1732922066| ~z$w_buff0_used~0_In1732922066)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite21_Out1732922066| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1732922066, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1732922066} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1732922066, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1732922066, ULTIMATE.start_main_#t~ite21=|ULTIMATE.start_main_#t~ite21_Out1732922066|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite21] because there is no mapped edge [2019-12-26 22:38:16,244 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L849-->L849-2: Formula: (let ((.cse0 (= (mod ~z$w_buff1_used~0_In511491910 256) 0)) (.cse1 (= (mod ~z$r_buff1_thd0~0_In511491910 256) 0)) (.cse3 (= 0 (mod ~z$r_buff0_thd0~0_In511491910 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In511491910 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite22_Out511491910| ~z$w_buff1_used~0_In511491910) (or .cse2 .cse3)) (and (= |ULTIMATE.start_main_#t~ite22_Out511491910| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse3) (not .cse2)))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In511491910, ~z$w_buff0_used~0=~z$w_buff0_used~0_In511491910, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In511491910, ~z$w_buff1_used~0=~z$w_buff1_used~0_In511491910} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In511491910, ~z$w_buff0_used~0=~z$w_buff0_used~0_In511491910, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In511491910, ~z$w_buff1_used~0=~z$w_buff1_used~0_In511491910, ULTIMATE.start_main_#t~ite22=|ULTIMATE.start_main_#t~ite22_Out511491910|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite22] because there is no mapped edge [2019-12-26 22:38:16,245 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [732] [732] L850-->L850-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In-1898837388 256) 0)) (.cse1 (= (mod ~z$r_buff0_thd0~0_In-1898837388 256) 0))) (or (and (= ~z$r_buff0_thd0~0_In-1898837388 |ULTIMATE.start_main_#t~ite23_Out-1898837388|) (or .cse0 .cse1)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite23_Out-1898837388| 0) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1898837388, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1898837388} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In-1898837388, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1898837388, ULTIMATE.start_main_#t~ite23=|ULTIMATE.start_main_#t~ite23_Out-1898837388|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite23] because there is no mapped edge [2019-12-26 22:38:16,246 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [722] [722] L851-->L851-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In1293183349 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In1293183349 256) 0)) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1293183349 256) 0)) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1293183349 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite24_Out1293183349| 0)) (and (= |ULTIMATE.start_main_#t~ite24_Out1293183349| ~z$r_buff1_thd0~0_In1293183349) (or .cse0 .cse1) (or .cse3 .cse2)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1293183349, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1293183349, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1293183349, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1293183349} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1293183349, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1293183349, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1293183349, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out1293183349|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1293183349} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24] because there is no mapped edge [2019-12-26 22:38:16,252 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L861-->L861-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In1549111620 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite37_Out1549111620| |ULTIMATE.start_main_#t~ite36_Out1549111620|) (let ((.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In1549111620 256)))) (or (and .cse0 (= (mod ~z$w_buff1_used~0_In1549111620 256) 0)) (= 0 (mod ~z$w_buff0_used~0_In1549111620 256)) (and .cse0 (= 0 (mod ~z$r_buff1_thd0~0_In1549111620 256))))) (= ~z$w_buff0_used~0_In1549111620 |ULTIMATE.start_main_#t~ite36_Out1549111620|) .cse1) (and (= |ULTIMATE.start_main_#t~ite37_Out1549111620| ~z$w_buff0_used~0_In1549111620) (= |ULTIMATE.start_main_#t~ite36_In1549111620| |ULTIMATE.start_main_#t~ite36_Out1549111620|) (not .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1549111620, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1549111620, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1549111620, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1549111620, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_In1549111620|, ~weak$$choice2~0=~weak$$choice2~0_In1549111620} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1549111620, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1549111620, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1549111620, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1549111620, ULTIMATE.start_main_#t~ite36=|ULTIMATE.start_main_#t~ite36_Out1549111620|, ULTIMATE.start_main_#t~ite37=|ULTIMATE.start_main_#t~ite37_Out1549111620|, ~weak$$choice2~0=~weak$$choice2~0_In1549111620} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite37] because there is no mapped edge [2019-12-26 22:38:16,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L862-->L862-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In1575474353 256)))) (or (and (= ~z$w_buff1_used~0_In1575474353 |ULTIMATE.start_main_#t~ite40_Out1575474353|) (= |ULTIMATE.start_main_#t~ite39_In1575474353| |ULTIMATE.start_main_#t~ite39_Out1575474353|) (not .cse0)) (and (= |ULTIMATE.start_main_#t~ite39_Out1575474353| |ULTIMATE.start_main_#t~ite40_Out1575474353|) (= |ULTIMATE.start_main_#t~ite39_Out1575474353| ~z$w_buff1_used~0_In1575474353) .cse0 (let ((.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1575474353 256)))) (or (= 0 (mod ~z$w_buff0_used~0_In1575474353 256)) (and .cse1 (= 0 (mod ~z$r_buff1_thd0~0_In1575474353 256))) (and .cse1 (= (mod ~z$w_buff1_used~0_In1575474353 256) 0))))))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1575474353, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1575474353, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_In1575474353|, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1575474353, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1575474353, ~weak$$choice2~0=~weak$$choice2~0_In1575474353} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1575474353, ULTIMATE.start_main_#t~ite40=|ULTIMATE.start_main_#t~ite40_Out1575474353|, ULTIMATE.start_main_#t~ite39=|ULTIMATE.start_main_#t~ite39_Out1575474353|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1575474353, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1575474353, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1575474353, ~weak$$choice2~0=~weak$$choice2~0_In1575474353} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite40, ULTIMATE.start_main_#t~ite39] because there is no mapped edge [2019-12-26 22:38:16,254 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [675] [675] L863-->L864: Formula: (and (not (= 0 (mod v_~weak$$choice2~0_24 256))) (= v_~z$r_buff0_thd0~0_79 v_~z$r_buff0_thd0~0_80)) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_80, ~weak$$choice2~0=v_~weak$$choice2~0_24} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_79, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_8|, ~weak$$choice2~0=v_~weak$$choice2~0_24, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_8|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-26 22:38:16,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L866-->L4: Formula: (and (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (not (= (mod v_~z$flush_delayed~0_29 256) 0)) (= v_~z$mem_tmp~0_15 v_~z~0_103) (= 0 v_~z$flush_delayed~0_28)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_15, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_29} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_15, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_9, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_23|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_28, ~z~0=v_~z~0_103, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite47, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-26 22:38:16,256 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L4-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_7|} 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_7|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-26 22:38:16,409 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.12 10:38:16 BasicIcfg [2019-12-26 22:38:16,409 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-26 22:38:16,411 INFO L168 Benchmark]: Toolchain (without parser) took 49720.90 ms. Allocated memory was 142.1 MB in the beginning and 3.0 GB in the end (delta: 2.9 GB). Free memory was 96.6 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 848.1 MB. Max. memory is 7.1 GB. [2019-12-26 22:38:16,412 INFO L168 Benchmark]: CDTParser took 0.21 ms. Allocated memory is still 142.1 MB. Free memory was 117.1 MB in the beginning and 116.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-26 22:38:16,413 INFO L168 Benchmark]: CACSL2BoogieTranslator took 827.56 ms. Allocated memory was 142.1 MB in the beginning and 199.8 MB in the end (delta: 57.7 MB). Free memory was 96.4 MB in the beginning and 151.6 MB in the end (delta: -55.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. [2019-12-26 22:38:16,413 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.56 ms. Allocated memory is still 199.8 MB. Free memory was 151.6 MB in the beginning and 148.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:38:16,414 INFO L168 Benchmark]: Boogie Preprocessor took 37.37 ms. Allocated memory is still 199.8 MB. Free memory was 148.8 MB in the beginning and 145.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. [2019-12-26 22:38:16,415 INFO L168 Benchmark]: RCFGBuilder took 825.64 ms. Allocated memory is still 199.8 MB. Free memory was 145.9 MB in the beginning and 96.7 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. [2019-12-26 22:38:16,415 INFO L168 Benchmark]: TraceAbstraction took 47943.99 ms. Allocated memory was 199.8 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 96.0 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 789.8 MB. Max. memory is 7.1 GB. [2019-12-26 22:38:16,419 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.21 ms. Allocated memory is still 142.1 MB. Free memory was 117.1 MB in the beginning and 116.9 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 827.56 ms. Allocated memory was 142.1 MB in the beginning and 199.8 MB in the end (delta: 57.7 MB). Free memory was 96.4 MB in the beginning and 151.6 MB in the end (delta: -55.2 MB). Peak memory consumption was 20.7 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 79.56 ms. Allocated memory is still 199.8 MB. Free memory was 151.6 MB in the beginning and 148.8 MB in the end (delta: 2.8 MB). Peak memory consumption was 2.8 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.37 ms. Allocated memory is still 199.8 MB. Free memory was 148.8 MB in the beginning and 145.9 MB in the end (delta: 2.9 MB). Peak memory consumption was 2.9 MB. Max. memory is 7.1 GB. * RCFGBuilder took 825.64 ms. Allocated memory is still 199.8 MB. Free memory was 145.9 MB in the beginning and 96.7 MB in the end (delta: 49.2 MB). Peak memory consumption was 49.2 MB. Max. memory is 7.1 GB. * TraceAbstraction took 47943.99 ms. Allocated memory was 199.8 MB in the beginning and 3.0 GB in the end (delta: 2.8 GB). Free memory was 96.0 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 789.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 182 ProgramPointsBefore, 90 ProgramPointsAfterwards, 210 TransitionsBefore, 97 TransitionsAfterwards, 12668 CoEnabledTransitionPairs, 8 FixpointIterations, 38 TrivialSequentialCompositions, 50 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 38 ConcurrentYvCompositions, 26 ChoiceCompositions, 4720 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 35 SemBasedMoverChecksPositive, 226 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 56592 CheckedPairsTotal, 126 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L835] FCALL, FORK 0 pthread_create(&t1149, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L837] FCALL, FORK 0 pthread_create(&t1150, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L839] FCALL, FORK 0 pthread_create(&t1151, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L841] FCALL, FORK 0 pthread_create(&t1152, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L790] 4 z$w_buff1 = z$w_buff0 [L791] 4 z$w_buff0 = 2 [L792] 4 z$w_buff1_used = z$w_buff0_used [L793] 4 z$w_buff0_used = (_Bool)1 [L812] EXPR 4 z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L770] 3 y = 1 [L773] 3 z = 1 VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L812] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L776] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L777] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L778] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L779] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L813] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L814] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L843] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L847] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L848] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L849] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L850] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L851] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L854] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L855] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L856] 0 z$flush_delayed = weak$$choice2 [L857] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L858] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L859] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L859] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L860] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L860] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L861] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L862] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L864] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L864] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L865] 0 main$tmp_guard1 = !(z == 2 && __unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [\result={0:0}, \result={0:0}, \result={0:0}, __unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=9, weak$$choice2=1, x=1, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 5 procedures, 170 locations, 2 error locations. Result: UNSAFE, OverallTime: 47.5s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 16.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2282 SDtfs, 3167 SDslu, 5951 SDs, 0 SdLazy, 2728 SolverSat, 239 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 2.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 158 GetRequests, 22 SyntacticMatches, 5 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 1.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=65578occurred in iteration=6, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 19.3s AutomataMinimizationTime, 17 MinimizatonAttempts, 83043 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.6s InterpolantComputationTime, 689 NumberOfCodeBlocks, 689 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 612 ConstructedInterpolants, 0 QuantifiedInterpolants, 111500 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 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...