/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.opt.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 22:25:19,604 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 22:25:19,606 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 22:25:19,624 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 22:25:19,625 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 22:25:19,626 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 22:25:19,628 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 22:25:19,638 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 22:25:19,641 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 22:25:19,644 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 22:25:19,645 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 22:25:19,646 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 22:25:19,646 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 22:25:19,647 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 22:25:19,647 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 22:25:19,648 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 22:25:19,649 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 22:25:19,650 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 22:25:19,651 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 22:25:19,653 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 22:25:19,654 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 22:25:19,655 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 22:25:19,656 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 22:25:19,657 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 22:25:19,659 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 22:25:19,659 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 22:25:19,659 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 22:25:19,660 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 22:25:19,661 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 22:25:19,662 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 22:25:19,662 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 22:25:19,663 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 22:25:19,663 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 22:25:19,664 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 22:25:19,665 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 22:25:19,665 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 22:25:19,666 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 22:25:19,666 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 22:25:19,666 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 22:25:19,667 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 22:25:19,668 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 22:25:19,669 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-VariableLbe-MCR.epf [2019-12-27 22:25:19,685 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 22:25:19,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 22:25:19,687 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 22:25:19,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 22:25:19,687 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 22:25:19,687 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 22:25:19,687 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 22:25:19,688 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 22:25:19,688 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 22:25:19,688 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 22:25:19,688 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 22:25:19,688 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 22:25:19,689 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 22:25:19,689 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 22:25:19,689 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 22:25:19,689 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 22:25:19,689 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 22:25:19,689 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 22:25:19,690 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 22:25:19,690 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 22:25:19,690 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 22:25:19,690 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:25:19,690 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 22:25:19,691 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 22:25:19,691 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 22:25:19,691 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 22:25:19,691 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 22:25:19,691 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 22:25:19,692 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=VARIABLE_BASED_MOVER_CHECK [2019-12-27 22:25:19,692 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 22:25:19,692 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 22:25:19,692 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 22:25:19,954 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 22:25:19,967 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 22:25:19,970 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 22:25:19,972 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 22:25:19,972 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 22:25:19,973 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe012_pso.opt.i [2019-12-27 22:25:20,055 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53e77fc89/563a4fd6df4e4aee97b760c98fd18500/FLAG0b10f34de [2019-12-27 22:25:20,586 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 22:25:20,588 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe012_pso.opt.i [2019-12-27 22:25:20,612 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53e77fc89/563a4fd6df4e4aee97b760c98fd18500/FLAG0b10f34de [2019-12-27 22:25:20,921 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/53e77fc89/563a4fd6df4e4aee97b760c98fd18500 [2019-12-27 22:25:20,928 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 22:25:20,930 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 22:25:20,931 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 22:25:20,931 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 22:25:20,936 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 22:25:20,937 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:25:20" (1/1) ... [2019-12-27 22:25:20,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5ce4072b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:20, skipping insertion in model container [2019-12-27 22:25:20,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 10:25:20" (1/1) ... [2019-12-27 22:25:20,947 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 22:25:21,003 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 22:25:21,529 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:25:21,543 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 22:25:21,624 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 22:25:21,705 INFO L208 MainTranslator]: Completed translation [2019-12-27 22:25:21,705 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:21 WrapperNode [2019-12-27 22:25:21,705 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 22:25:21,706 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 22:25:21,706 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 22:25:21,706 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 22:25:21,713 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:21" (1/1) ... [2019-12-27 22:25:21,738 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:21" (1/1) ... [2019-12-27 22:25:21,769 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 22:25:21,769 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 22:25:21,770 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 22:25:21,770 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 22:25:21,779 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:21" (1/1) ... [2019-12-27 22:25:21,779 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:21" (1/1) ... [2019-12-27 22:25:21,783 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:21" (1/1) ... [2019-12-27 22:25:21,784 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:21" (1/1) ... [2019-12-27 22:25:21,794 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:21" (1/1) ... [2019-12-27 22:25:21,799 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:21" (1/1) ... [2019-12-27 22:25:21,802 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:21" (1/1) ... [2019-12-27 22:25:21,807 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 22:25:21,808 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 22:25:21,808 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 22:25:21,808 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 22:25:21,809 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:21" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 22:25:21,885 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 22:25:21,885 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 22:25:21,888 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 22:25:21,888 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 22:25:21,888 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 22:25:21,888 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 22:25:21,888 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 22:25:21,889 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 22:25:21,889 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 22:25:21,889 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 22:25:21,890 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 22:25:21,890 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 22:25:21,890 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 22:25:21,893 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-27 22:25:22,606 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 22:25:22,607 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 22:25:22,608 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:25:22 BoogieIcfgContainer [2019-12-27 22:25:22,609 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 22:25:22,610 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 22:25:22,610 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 22:25:22,613 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 22:25:22,614 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 10:25:20" (1/3) ... [2019-12-27 22:25:22,615 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b0437ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:25:22, skipping insertion in model container [2019-12-27 22:25:22,615 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 10:25:21" (2/3) ... [2019-12-27 22:25:22,616 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3b0437ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 10:25:22, skipping insertion in model container [2019-12-27 22:25:22,616 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 10:25:22" (3/3) ... [2019-12-27 22:25:22,618 INFO L109 eAbstractionObserver]: Analyzing ICFG safe012_pso.opt.i [2019-12-27 22:25:22,629 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 22:25:22,629 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 22:25:22,637 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 22:25:22,639 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 22:25:22,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,684 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,685 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,685 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,686 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,686 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,687 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,688 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,689 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,690 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,691 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,692 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,693 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,694 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,695 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,696 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,697 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,698 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,699 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,700 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,701 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,702 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,703 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,704 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,705 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,706 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,707 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,708 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,709 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,710 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,711 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,711 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,711 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,712 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,712 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,729 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,729 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,730 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,731 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,732 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,733 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,734 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,735 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,736 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,736 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,736 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,737 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,738 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,739 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,740 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,741 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,742 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,746 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,746 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,746 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,746 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,747 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,748 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,750 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,751 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,751 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,752 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,752 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,755 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,756 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,756 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,757 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,757 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,758 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,759 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,760 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 22:25:22,777 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 22:25:22,798 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 22:25:22,798 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 22:25:22,798 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 22:25:22,798 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 22:25:22,798 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 22:25:22,799 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 22:25:22,799 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 22:25:22,799 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 22:25:22,816 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 164 places, 195 transitions [2019-12-27 22:25:22,819 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 22:25:22,918 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 22:25:22,919 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:25:22,939 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:25:22,972 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 164 places, 195 transitions [2019-12-27 22:25:23,024 INFO L132 PetriNetUnfolder]: 41/192 cut-off events. [2019-12-27 22:25:23,025 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 22:25:23,036 INFO L76 FinitePrefix]: Finished finitePrefix Result has 202 conditions, 192 events. 41/192 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 449 event pairs. 0/149 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 22:25:23,062 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 22:25:23,063 INFO L182 etLargeBlockEncoding]: Variable Check. [2019-12-27 22:25:26,720 WARN L192 SmtUtils]: Spent 252.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 89 [2019-12-27 22:25:26,854 WARN L192 SmtUtils]: Spent 129.00 ms on a formula simplification that was a NOOP. DAG size: 87 [2019-12-27 22:25:26,959 INFO L206 etLargeBlockEncoding]: Checked pairs total: 67273 [2019-12-27 22:25:26,960 INFO L214 etLargeBlockEncoding]: Total number of compositions: 114 [2019-12-27 22:25:26,963 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 82 places, 89 transitions [2019-12-27 22:25:37,929 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 85916 states. [2019-12-27 22:25:37,931 INFO L276 IsEmpty]: Start isEmpty. Operand 85916 states. [2019-12-27 22:25:37,936 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 22:25:37,937 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:37,937 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 22:25:37,938 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:37,942 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:37,943 INFO L82 PathProgramCache]: Analyzing trace with hash 800242347, now seen corresponding path program 1 times [2019-12-27 22:25:37,951 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:37,951 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464022787] [2019-12-27 22:25:37,952 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:38,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:38,264 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:38,265 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464022787] [2019-12-27 22:25:38,266 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:38,266 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:25:38,268 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [276874308] [2019-12-27 22:25:38,269 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:38,275 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:38,290 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 22:25:38,291 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:38,295 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:25:38,295 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:25:38,295 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:38,310 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:25:38,310 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:25:38,312 INFO L87 Difference]: Start difference. First operand 85916 states. Second operand 3 states. [2019-12-27 22:25:41,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:41,535 INFO L93 Difference]: Finished difference Result 84146 states and 359873 transitions. [2019-12-27 22:25:41,535 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:25:41,537 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 22:25:41,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:42,094 INFO L225 Difference]: With dead ends: 84146 [2019-12-27 22:25:42,095 INFO L226 Difference]: Without dead ends: 79232 [2019-12-27 22:25:42,098 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:25:46,445 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79232 states. [2019-12-27 22:25:48,322 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79232 to 79232. [2019-12-27 22:25:48,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79232 states. [2019-12-27 22:25:48,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79232 states to 79232 states and 338383 transitions. [2019-12-27 22:25:48,700 INFO L78 Accepts]: Start accepts. Automaton has 79232 states and 338383 transitions. Word has length 5 [2019-12-27 22:25:48,700 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:25:48,700 INFO L462 AbstractCegarLoop]: Abstraction has 79232 states and 338383 transitions. [2019-12-27 22:25:48,700 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:25:48,700 INFO L276 IsEmpty]: Start isEmpty. Operand 79232 states and 338383 transitions. [2019-12-27 22:25:48,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:25:48,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:25:48,708 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:25:48,709 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:25:48,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:25:48,709 INFO L82 PathProgramCache]: Analyzing trace with hash 438269963, now seen corresponding path program 1 times [2019-12-27 22:25:48,710 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:25:48,710 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1668439895] [2019-12-27 22:25:48,710 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:25:48,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:25:48,809 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:25:48,811 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1668439895] [2019-12-27 22:25:48,811 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:25:48,811 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:25:48,811 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [671798141] [2019-12-27 22:25:48,811 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:25:48,813 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:25:48,818 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:25:48,818 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:25:48,818 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:25:48,820 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:25:48,820 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:25:48,821 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:25:48,821 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:25:48,821 INFO L87 Difference]: Start difference. First operand 79232 states and 338383 transitions. Second operand 4 states. [2019-12-27 22:25:52,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:25:52,822 INFO L93 Difference]: Finished difference Result 121026 states and 493729 transitions. [2019-12-27 22:25:52,823 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:25:52,823 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:25:52,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:25:53,277 INFO L225 Difference]: With dead ends: 121026 [2019-12-27 22:25:53,277 INFO L226 Difference]: Without dead ends: 120935 [2019-12-27 22:25:53,278 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:25:56,856 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120935 states. [2019-12-27 22:26:02,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120935 to 109733. [2019-12-27 22:26:02,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109733 states. [2019-12-27 22:26:03,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109733 states to 109733 states and 453798 transitions. [2019-12-27 22:26:03,257 INFO L78 Accepts]: Start accepts. Automaton has 109733 states and 453798 transitions. Word has length 13 [2019-12-27 22:26:03,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:03,258 INFO L462 AbstractCegarLoop]: Abstraction has 109733 states and 453798 transitions. [2019-12-27 22:26:03,258 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:26:03,258 INFO L276 IsEmpty]: Start isEmpty. Operand 109733 states and 453798 transitions. [2019-12-27 22:26:03,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 22:26:03,262 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:03,262 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:03,263 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:03,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:03,263 INFO L82 PathProgramCache]: Analyzing trace with hash 777110306, now seen corresponding path program 1 times [2019-12-27 22:26:03,263 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:03,264 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1595777029] [2019-12-27 22:26:03,264 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:03,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:03,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:26:03,342 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1595777029] [2019-12-27 22:26:03,342 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:03,342 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:26:03,343 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1099220201] [2019-12-27 22:26:03,343 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:03,344 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:03,348 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 22:26:03,348 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:03,350 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:26:03,350 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:26:03,350 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:03,350 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:26:03,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:26:03,351 INFO L87 Difference]: Start difference. First operand 109733 states and 453798 transitions. Second operand 4 states. [2019-12-27 22:26:05,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:05,268 INFO L93 Difference]: Finished difference Result 151774 states and 613241 transitions. [2019-12-27 22:26:05,268 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:26:05,268 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 22:26:05,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:05,687 INFO L225 Difference]: With dead ends: 151774 [2019-12-27 22:26:05,687 INFO L226 Difference]: Without dead ends: 151670 [2019-12-27 22:26:05,687 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:26:13,574 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 151670 states. [2019-12-27 22:26:15,528 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 151670 to 127872. [2019-12-27 22:26:15,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 127872 states. [2019-12-27 22:26:16,848 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127872 states to 127872 states and 526262 transitions. [2019-12-27 22:26:16,848 INFO L78 Accepts]: Start accepts. Automaton has 127872 states and 526262 transitions. Word has length 13 [2019-12-27 22:26:16,848 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:16,849 INFO L462 AbstractCegarLoop]: Abstraction has 127872 states and 526262 transitions. [2019-12-27 22:26:16,849 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:26:16,849 INFO L276 IsEmpty]: Start isEmpty. Operand 127872 states and 526262 transitions. [2019-12-27 22:26:16,853 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 22:26:16,853 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:16,853 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:16,854 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:16,854 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:16,854 INFO L82 PathProgramCache]: Analyzing trace with hash -2011904106, now seen corresponding path program 1 times [2019-12-27 22:26:16,854 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:16,854 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73995190] [2019-12-27 22:26:16,855 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:16,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:16,995 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:26:16,998 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [73995190] [2019-12-27 22:26:16,999 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:16,999 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:26:16,999 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1524346510] [2019-12-27 22:26:16,999 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:17,001 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:17,005 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 22:26:17,006 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:17,080 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:26:17,080 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 22:26:17,080 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:17,080 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 22:26:17,081 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 22:26:17,081 INFO L87 Difference]: Start difference. First operand 127872 states and 526262 transitions. Second operand 7 states. [2019-12-27 22:26:18,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:18,466 INFO L93 Difference]: Finished difference Result 172642 states and 696404 transitions. [2019-12-27 22:26:18,466 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 22:26:18,467 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-27 22:26:18,467 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:18,997 INFO L225 Difference]: With dead ends: 172642 [2019-12-27 22:26:18,997 INFO L226 Difference]: Without dead ends: 172506 [2019-12-27 22:26:18,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:26:27,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172506 states. [2019-12-27 22:26:29,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172506 to 133126. [2019-12-27 22:26:29,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133126 states. [2019-12-27 22:26:31,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133126 states to 133126 states and 547571 transitions. [2019-12-27 22:26:31,163 INFO L78 Accepts]: Start accepts. Automaton has 133126 states and 547571 transitions. Word has length 14 [2019-12-27 22:26:31,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:31,163 INFO L462 AbstractCegarLoop]: Abstraction has 133126 states and 547571 transitions. [2019-12-27 22:26:31,163 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 22:26:31,163 INFO L276 IsEmpty]: Start isEmpty. Operand 133126 states and 547571 transitions. [2019-12-27 22:26:31,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2019-12-27 22:26:31,190 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:31,190 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:31,190 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:31,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:31,190 INFO L82 PathProgramCache]: Analyzing trace with hash 548423730, now seen corresponding path program 1 times [2019-12-27 22:26:31,191 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:31,191 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494678235] [2019-12-27 22:26:31,191 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:31,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:31,252 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:26:31,252 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494678235] [2019-12-27 22:26:31,253 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:31,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 22:26:31,253 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2011293605] [2019-12-27 22:26:31,253 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:31,256 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:31,259 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 22 states and 24 transitions. [2019-12-27 22:26:31,259 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:31,260 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:26:31,260 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:26:31,260 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:31,260 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:26:31,261 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:26:31,261 INFO L87 Difference]: Start difference. First operand 133126 states and 547571 transitions. Second operand 3 states. [2019-12-27 22:26:31,946 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:31,946 INFO L93 Difference]: Finished difference Result 132731 states and 546022 transitions. [2019-12-27 22:26:31,946 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:26:31,946 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2019-12-27 22:26:31,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:32,328 INFO L225 Difference]: With dead ends: 132731 [2019-12-27 22:26:32,328 INFO L226 Difference]: Without dead ends: 132731 [2019-12-27 22:26:32,329 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:26:36,495 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132731 states. [2019-12-27 22:26:45,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132731 to 132731. [2019-12-27 22:26:45,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 132731 states. [2019-12-27 22:26:46,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132731 states to 132731 states and 546022 transitions. [2019-12-27 22:26:46,015 INFO L78 Accepts]: Start accepts. Automaton has 132731 states and 546022 transitions. Word has length 18 [2019-12-27 22:26:46,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:46,015 INFO L462 AbstractCegarLoop]: Abstraction has 132731 states and 546022 transitions. [2019-12-27 22:26:46,015 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:26:46,015 INFO L276 IsEmpty]: Start isEmpty. Operand 132731 states and 546022 transitions. [2019-12-27 22:26:46,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 22:26:46,037 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:46,037 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:46,038 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:46,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:46,038 INFO L82 PathProgramCache]: Analyzing trace with hash -300265676, now seen corresponding path program 1 times [2019-12-27 22:26:46,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:46,039 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071008004] [2019-12-27 22:26:46,039 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:46,055 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:46,087 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:26:46,087 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071008004] [2019-12-27 22:26:46,087 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:46,088 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:26:46,088 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1329413496] [2019-12-27 22:26:46,088 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:46,091 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:46,095 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 48 transitions. [2019-12-27 22:26:46,095 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:46,096 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 22:26:46,096 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:26:46,096 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:46,096 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:26:46,097 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:26:46,097 INFO L87 Difference]: Start difference. First operand 132731 states and 546022 transitions. Second operand 4 states. [2019-12-27 22:26:47,981 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:26:47,981 INFO L93 Difference]: Finished difference Result 241705 states and 995862 transitions. [2019-12-27 22:26:47,982 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 22:26:47,982 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 19 [2019-12-27 22:26:47,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:26:54,406 INFO L225 Difference]: With dead ends: 241705 [2019-12-27 22:26:54,407 INFO L226 Difference]: Without dead ends: 132095 [2019-12-27 22:26:54,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:26:57,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132095 states. [2019-12-27 22:26:59,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132095 to 131335. [2019-12-27 22:26:59,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 131335 states. [2019-12-27 22:26:59,662 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131335 states to 131335 states and 534984 transitions. [2019-12-27 22:26:59,663 INFO L78 Accepts]: Start accepts. Automaton has 131335 states and 534984 transitions. Word has length 19 [2019-12-27 22:26:59,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:26:59,663 INFO L462 AbstractCegarLoop]: Abstraction has 131335 states and 534984 transitions. [2019-12-27 22:26:59,663 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:26:59,663 INFO L276 IsEmpty]: Start isEmpty. Operand 131335 states and 534984 transitions. [2019-12-27 22:26:59,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-27 22:26:59,676 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:26:59,676 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:26:59,677 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:26:59,677 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:26:59,677 INFO L82 PathProgramCache]: Analyzing trace with hash -1452908293, now seen corresponding path program 1 times [2019-12-27 22:26:59,678 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:26:59,678 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [236787188] [2019-12-27 22:26:59,678 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:26:59,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:26:59,752 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:26:59,753 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [236787188] [2019-12-27 22:26:59,753 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:26:59,753 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:26:59,754 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1211075524] [2019-12-27 22:26:59,754 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:26:59,756 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:26:59,759 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 31 transitions. [2019-12-27 22:26:59,760 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:26:59,761 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:26:59,761 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:26:59,761 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:26:59,761 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:26:59,761 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:26:59,762 INFO L87 Difference]: Start difference. First operand 131335 states and 534984 transitions. Second operand 5 states. [2019-12-27 22:27:00,808 WARN L192 SmtUtils]: Spent 867.00 ms on a formula simplification that was a NOOP. DAG size: 8 [2019-12-27 22:27:01,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:01,906 INFO L93 Difference]: Finished difference Result 180323 states and 718868 transitions. [2019-12-27 22:27:01,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-27 22:27:01,906 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-27 22:27:01,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:02,383 INFO L225 Difference]: With dead ends: 180323 [2019-12-27 22:27:02,383 INFO L226 Difference]: Without dead ends: 178643 [2019-12-27 22:27:02,384 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:27:11,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 178643 states. [2019-12-27 22:27:13,757 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 178643 to 133631. [2019-12-27 22:27:13,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133631 states. [2019-12-27 22:27:14,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133631 states to 133631 states and 544219 transitions. [2019-12-27 22:27:14,790 INFO L78 Accepts]: Start accepts. Automaton has 133631 states and 544219 transitions. Word has length 19 [2019-12-27 22:27:14,790 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:14,790 INFO L462 AbstractCegarLoop]: Abstraction has 133631 states and 544219 transitions. [2019-12-27 22:27:14,790 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:27:14,790 INFO L276 IsEmpty]: Start isEmpty. Operand 133631 states and 544219 transitions. [2019-12-27 22:27:14,811 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2019-12-27 22:27:14,811 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:14,811 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] [2019-12-27 22:27:14,811 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:14,812 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:14,812 INFO L82 PathProgramCache]: Analyzing trace with hash 1235441066, now seen corresponding path program 1 times [2019-12-27 22:27:14,812 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:14,812 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1211934399] [2019-12-27 22:27:14,812 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:14,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:14,860 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:27:14,860 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1211934399] [2019-12-27 22:27:14,860 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:14,860 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:27:14,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1552159090] [2019-12-27 22:27:14,861 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:14,864 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:14,871 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 43 states and 65 transitions. [2019-12-27 22:27:14,871 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:14,936 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:27:14,936 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:27:14,936 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:14,936 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:27:14,937 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:27:14,937 INFO L87 Difference]: Start difference. First operand 133631 states and 544219 transitions. Second operand 8 states. [2019-12-27 22:27:22,488 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:22,488 INFO L93 Difference]: Finished difference Result 325406 states and 1336544 transitions. [2019-12-27 22:27:22,488 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 22:27:22,488 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2019-12-27 22:27:22,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:23,786 INFO L225 Difference]: With dead ends: 325406 [2019-12-27 22:27:23,786 INFO L226 Difference]: Without dead ends: 215008 [2019-12-27 22:27:23,787 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=64, Invalid=118, Unknown=0, NotChecked=0, Total=182 [2019-12-27 22:27:27,956 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 215008 states. [2019-12-27 22:27:30,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 215008 to 86281. [2019-12-27 22:27:30,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86281 states. [2019-12-27 22:27:31,922 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86281 states to 86281 states and 352873 transitions. [2019-12-27 22:27:31,923 INFO L78 Accepts]: Start accepts. Automaton has 86281 states and 352873 transitions. Word has length 20 [2019-12-27 22:27:31,923 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:31,923 INFO L462 AbstractCegarLoop]: Abstraction has 86281 states and 352873 transitions. [2019-12-27 22:27:31,923 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:27:31,923 INFO L276 IsEmpty]: Start isEmpty. Operand 86281 states and 352873 transitions. [2019-12-27 22:27:31,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2019-12-27 22:27:31,946 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:31,946 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-27 22:27:31,946 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:31,946 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:31,946 INFO L82 PathProgramCache]: Analyzing trace with hash 1125330895, now seen corresponding path program 1 times [2019-12-27 22:27:31,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:31,947 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1625243564] [2019-12-27 22:27:31,947 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:31,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:32,006 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:27:32,007 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1625243564] [2019-12-27 22:27:32,007 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:32,007 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 22:27:32,008 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1904726404] [2019-12-27 22:27:32,008 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:32,010 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:32,019 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 49 states and 75 transitions. [2019-12-27 22:27:32,019 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:32,041 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:27:32,041 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-27 22:27:32,042 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:32,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-27 22:27:32,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:27:32,042 INFO L87 Difference]: Start difference. First operand 86281 states and 352873 transitions. Second operand 5 states. [2019-12-27 22:27:32,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:32,354 INFO L93 Difference]: Finished difference Result 30753 states and 105714 transitions. [2019-12-27 22:27:32,354 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:27:32,354 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 21 [2019-12-27 22:27:32,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:32,400 INFO L225 Difference]: With dead ends: 30753 [2019-12-27 22:27:32,400 INFO L226 Difference]: Without dead ends: 26788 [2019-12-27 22:27:32,400 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:27:32,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26788 states. [2019-12-27 22:27:32,734 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26788 to 17289. [2019-12-27 22:27:32,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17289 states. [2019-12-27 22:27:32,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17289 states to 17289 states and 57966 transitions. [2019-12-27 22:27:32,769 INFO L78 Accepts]: Start accepts. Automaton has 17289 states and 57966 transitions. Word has length 21 [2019-12-27 22:27:32,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:32,769 INFO L462 AbstractCegarLoop]: Abstraction has 17289 states and 57966 transitions. [2019-12-27 22:27:32,769 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-27 22:27:32,769 INFO L276 IsEmpty]: Start isEmpty. Operand 17289 states and 57966 transitions. [2019-12-27 22:27:32,773 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 22:27:32,773 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:32,773 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:27:32,773 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:32,773 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:32,773 INFO L82 PathProgramCache]: Analyzing trace with hash 308223967, now seen corresponding path program 1 times [2019-12-27 22:27:32,774 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:32,774 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533476375] [2019-12-27 22:27:32,774 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:32,843 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:27:32,844 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533476375] [2019-12-27 22:27:32,844 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:32,844 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:27:32,844 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2070001168] [2019-12-27 22:27:32,844 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:32,847 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:32,860 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 67 states and 110 transitions. [2019-12-27 22:27:32,861 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:32,941 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:27:33,022 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:27:33,023 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:27:33,023 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:33,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:27:33,024 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:27:33,024 INFO L87 Difference]: Start difference. First operand 17289 states and 57966 transitions. Second operand 10 states. [2019-12-27 22:27:33,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:33,840 INFO L93 Difference]: Finished difference Result 17791 states and 58588 transitions. [2019-12-27 22:27:33,840 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2019-12-27 22:27:33,840 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 22 [2019-12-27 22:27:33,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:33,867 INFO L225 Difference]: With dead ends: 17791 [2019-12-27 22:27:33,868 INFO L226 Difference]: Without dead ends: 17166 [2019-12-27 22:27:33,868 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=164, Unknown=0, NotChecked=0, Total=240 [2019-12-27 22:27:33,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17166 states. [2019-12-27 22:27:34,114 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17166 to 16399. [2019-12-27 22:27:34,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16399 states. [2019-12-27 22:27:34,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16399 states to 16399 states and 55269 transitions. [2019-12-27 22:27:34,146 INFO L78 Accepts]: Start accepts. Automaton has 16399 states and 55269 transitions. Word has length 22 [2019-12-27 22:27:34,147 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:34,147 INFO L462 AbstractCegarLoop]: Abstraction has 16399 states and 55269 transitions. [2019-12-27 22:27:34,147 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:27:34,147 INFO L276 IsEmpty]: Start isEmpty. Operand 16399 states and 55269 transitions. [2019-12-27 22:27:34,153 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2019-12-27 22:27:34,153 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:34,153 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:27:34,153 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:34,154 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:34,154 INFO L82 PathProgramCache]: Analyzing trace with hash 436815580, now seen corresponding path program 1 times [2019-12-27 22:27:34,154 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:34,154 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121904763] [2019-12-27 22:27:34,154 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:34,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:34,238 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:27:34,238 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121904763] [2019-12-27 22:27:34,238 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:34,238 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:27:34,239 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [815191382] [2019-12-27 22:27:34,239 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:34,244 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:34,270 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 89 states and 148 transitions. [2019-12-27 22:27:34,270 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:35,561 WARN L192 SmtUtils]: Spent 1.28 s on a formula simplification that was a NOOP. DAG size: 22 [2019-12-27 22:27:35,606 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:27:35,681 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 6 times. [2019-12-27 22:27:35,682 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-12-27 22:27:35,682 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:35,682 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-12-27 22:27:35,683 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2019-12-27 22:27:35,683 INFO L87 Difference]: Start difference. First operand 16399 states and 55269 transitions. Second operand 10 states. [2019-12-27 22:27:36,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:36,252 INFO L93 Difference]: Finished difference Result 17183 states and 56862 transitions. [2019-12-27 22:27:36,252 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-12-27 22:27:36,253 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 28 [2019-12-27 22:27:36,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:36,279 INFO L225 Difference]: With dead ends: 17183 [2019-12-27 22:27:36,279 INFO L226 Difference]: Without dead ends: 16450 [2019-12-27 22:27:36,279 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2019-12-27 22:27:36,381 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16450 states. [2019-12-27 22:27:36,523 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16450 to 16248. [2019-12-27 22:27:36,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16248 states. [2019-12-27 22:27:36,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16248 states to 16248 states and 54801 transitions. [2019-12-27 22:27:36,555 INFO L78 Accepts]: Start accepts. Automaton has 16248 states and 54801 transitions. Word has length 28 [2019-12-27 22:27:36,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:36,555 INFO L462 AbstractCegarLoop]: Abstraction has 16248 states and 54801 transitions. [2019-12-27 22:27:36,556 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-12-27 22:27:36,556 INFO L276 IsEmpty]: Start isEmpty. Operand 16248 states and 54801 transitions. [2019-12-27 22:27:36,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2019-12-27 22:27:36,564 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:36,564 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] [2019-12-27 22:27:36,564 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:36,564 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:36,565 INFO L82 PathProgramCache]: Analyzing trace with hash -644546207, now seen corresponding path program 1 times [2019-12-27 22:27:36,565 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:36,565 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1216767181] [2019-12-27 22:27:36,566 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:36,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:36,638 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:27:36,638 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1216767181] [2019-12-27 22:27:36,638 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:36,639 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:27:36,639 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1805849292] [2019-12-27 22:27:36,639 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:36,644 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:36,663 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 114 transitions. [2019-12-27 22:27:36,663 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:36,719 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 22:27:36,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 22:27:36,719 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:36,720 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 22:27:36,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:27:36,720 INFO L87 Difference]: Start difference. First operand 16248 states and 54801 transitions. Second operand 8 states. [2019-12-27 22:27:37,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:37,530 INFO L93 Difference]: Finished difference Result 27826 states and 91774 transitions. [2019-12-27 22:27:37,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:27:37,531 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 30 [2019-12-27 22:27:37,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:37,576 INFO L225 Difference]: With dead ends: 27826 [2019-12-27 22:27:37,576 INFO L226 Difference]: Without dead ends: 27826 [2019-12-27 22:27:37,576 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 2 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:27:37,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27826 states. [2019-12-27 22:27:37,955 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27826 to 23161. [2019-12-27 22:27:37,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23161 states. [2019-12-27 22:27:37,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23161 states to 23161 states and 76816 transitions. [2019-12-27 22:27:37,999 INFO L78 Accepts]: Start accepts. Automaton has 23161 states and 76816 transitions. Word has length 30 [2019-12-27 22:27:37,999 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:37,999 INFO L462 AbstractCegarLoop]: Abstraction has 23161 states and 76816 transitions. [2019-12-27 22:27:37,999 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 22:27:37,999 INFO L276 IsEmpty]: Start isEmpty. Operand 23161 states and 76816 transitions. [2019-12-27 22:27:38,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2019-12-27 22:27:38,013 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:38,013 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] [2019-12-27 22:27:38,013 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:38,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:38,014 INFO L82 PathProgramCache]: Analyzing trace with hash -1317217445, now seen corresponding path program 1 times [2019-12-27 22:27:38,014 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:38,014 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2094803113] [2019-12-27 22:27:38,014 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:38,031 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:38,094 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:27:38,095 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2094803113] [2019-12-27 22:27:38,095 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:38,095 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 22:27:38,095 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [369057461] [2019-12-27 22:27:38,095 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:38,101 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:38,245 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 76 states and 119 transitions. [2019-12-27 22:27:38,245 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:38,274 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 22:27:38,274 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:27:38,274 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:38,274 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:27:38,275 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:27:38,275 INFO L87 Difference]: Start difference. First operand 23161 states and 76816 transitions. Second operand 6 states. [2019-12-27 22:27:38,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:38,357 INFO L93 Difference]: Finished difference Result 10282 states and 31302 transitions. [2019-12-27 22:27:38,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:27:38,357 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 31 [2019-12-27 22:27:38,358 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:38,373 INFO L225 Difference]: With dead ends: 10282 [2019-12-27 22:27:38,374 INFO L226 Difference]: Without dead ends: 8611 [2019-12-27 22:27:38,374 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=24, Invalid=32, Unknown=0, NotChecked=0, Total=56 [2019-12-27 22:27:38,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8611 states. [2019-12-27 22:27:38,475 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8611 to 8551. [2019-12-27 22:27:38,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8551 states. [2019-12-27 22:27:38,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8551 states to 8551 states and 25786 transitions. [2019-12-27 22:27:38,490 INFO L78 Accepts]: Start accepts. Automaton has 8551 states and 25786 transitions. Word has length 31 [2019-12-27 22:27:38,490 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:38,490 INFO L462 AbstractCegarLoop]: Abstraction has 8551 states and 25786 transitions. [2019-12-27 22:27:38,490 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:27:38,490 INFO L276 IsEmpty]: Start isEmpty. Operand 8551 states and 25786 transitions. [2019-12-27 22:27:38,502 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:27:38,502 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:38,502 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:27:38,502 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:38,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:38,503 INFO L82 PathProgramCache]: Analyzing trace with hash -1811345120, now seen corresponding path program 1 times [2019-12-27 22:27:38,503 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:38,504 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684225458] [2019-12-27 22:27:38,504 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:38,521 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:38,599 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:27:38,599 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684225458] [2019-12-27 22:27:38,599 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:38,600 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:27:38,600 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1045458805] [2019-12-27 22:27:38,600 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:38,609 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:38,669 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 123 states and 204 transitions. [2019-12-27 22:27:38,669 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:38,778 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 22:27:38,860 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 8 times. [2019-12-27 22:27:38,860 INFO L442 AbstractCegarLoop]: Interpolant automaton has 12 states [2019-12-27 22:27:38,860 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:38,860 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2019-12-27 22:27:38,861 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2019-12-27 22:27:38,861 INFO L87 Difference]: Start difference. First operand 8551 states and 25786 transitions. Second operand 12 states. [2019-12-27 22:27:41,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:41,092 INFO L93 Difference]: Finished difference Result 24241 states and 71270 transitions. [2019-12-27 22:27:41,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2019-12-27 22:27:41,092 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 40 [2019-12-27 22:27:41,093 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:41,127 INFO L225 Difference]: With dead ends: 24241 [2019-12-27 22:27:41,127 INFO L226 Difference]: Without dead ends: 23373 [2019-12-27 22:27:41,128 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 3 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 90 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=130, Invalid=470, Unknown=0, NotChecked=0, Total=600 [2019-12-27 22:27:41,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23373 states. [2019-12-27 22:27:41,335 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23373 to 10062. [2019-12-27 22:27:41,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10062 states. [2019-12-27 22:27:41,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10062 states to 10062 states and 30617 transitions. [2019-12-27 22:27:41,354 INFO L78 Accepts]: Start accepts. Automaton has 10062 states and 30617 transitions. Word has length 40 [2019-12-27 22:27:41,354 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:41,354 INFO L462 AbstractCegarLoop]: Abstraction has 10062 states and 30617 transitions. [2019-12-27 22:27:41,354 INFO L463 AbstractCegarLoop]: Interpolant automaton has 12 states. [2019-12-27 22:27:41,354 INFO L276 IsEmpty]: Start isEmpty. Operand 10062 states and 30617 transitions. [2019-12-27 22:27:41,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:27:41,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:41,366 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:27:41,367 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:41,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:41,367 INFO L82 PathProgramCache]: Analyzing trace with hash -511847359, now seen corresponding path program 1 times [2019-12-27 22:27:41,368 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:41,368 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1302794260] [2019-12-27 22:27:41,368 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:41,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:41,456 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:27:41,456 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1302794260] [2019-12-27 22:27:41,457 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:41,457 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:27:41,457 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1217812788] [2019-12-27 22:27:41,457 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:41,465 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:41,507 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 109 states and 187 transitions. [2019-12-27 22:27:41,507 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:41,570 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 10 times. [2019-12-27 22:27:41,570 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 22:27:41,571 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:41,571 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 22:27:41,571 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:27:41,571 INFO L87 Difference]: Start difference. First operand 10062 states and 30617 transitions. Second operand 9 states. [2019-12-27 22:27:43,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:43,563 INFO L93 Difference]: Finished difference Result 35676 states and 106349 transitions. [2019-12-27 22:27:43,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2019-12-27 22:27:43,563 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 40 [2019-12-27 22:27:43,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:43,616 INFO L225 Difference]: With dead ends: 35676 [2019-12-27 22:27:43,617 INFO L226 Difference]: Without dead ends: 35676 [2019-12-27 22:27:43,617 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 10 SyntacticMatches, 4 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=206, Unknown=0, NotChecked=0, Total=306 [2019-12-27 22:27:43,700 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35676 states. [2019-12-27 22:27:43,942 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35676 to 11771. [2019-12-27 22:27:43,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11771 states. [2019-12-27 22:27:43,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11771 states to 11771 states and 36071 transitions. [2019-12-27 22:27:43,966 INFO L78 Accepts]: Start accepts. Automaton has 11771 states and 36071 transitions. Word has length 40 [2019-12-27 22:27:43,966 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:43,966 INFO L462 AbstractCegarLoop]: Abstraction has 11771 states and 36071 transitions. [2019-12-27 22:27:43,966 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 22:27:43,967 INFO L276 IsEmpty]: Start isEmpty. Operand 11771 states and 36071 transitions. [2019-12-27 22:27:43,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 22:27:43,980 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:43,980 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:27:43,980 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:43,981 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:43,981 INFO L82 PathProgramCache]: Analyzing trace with hash -2125995049, now seen corresponding path program 2 times [2019-12-27 22:27:43,981 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:43,981 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1692524580] [2019-12-27 22:27:43,981 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:43,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:44,038 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:27:44,039 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1692524580] [2019-12-27 22:27:44,039 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:44,039 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:27:44,039 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [227900798] [2019-12-27 22:27:44,039 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:44,048 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:44,098 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 108 states and 186 transitions. [2019-12-27 22:27:44,099 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:44,110 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 22:27:44,111 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 22:27:44,111 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:44,111 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 22:27:44,111 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 22:27:44,111 INFO L87 Difference]: Start difference. First operand 11771 states and 36071 transitions. Second operand 4 states. [2019-12-27 22:27:44,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:44,343 INFO L93 Difference]: Finished difference Result 12815 states and 38069 transitions. [2019-12-27 22:27:44,344 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 22:27:44,344 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 40 [2019-12-27 22:27:44,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:44,364 INFO L225 Difference]: With dead ends: 12815 [2019-12-27 22:27:44,364 INFO L226 Difference]: Without dead ends: 12815 [2019-12-27 22:27:44,364 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-27 22:27:44,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12815 states. [2019-12-27 22:27:44,515 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12815 to 9486. [2019-12-27 22:27:44,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9486 states. [2019-12-27 22:27:44,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9486 states to 9486 states and 28402 transitions. [2019-12-27 22:27:44,534 INFO L78 Accepts]: Start accepts. Automaton has 9486 states and 28402 transitions. Word has length 40 [2019-12-27 22:27:44,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:44,534 INFO L462 AbstractCegarLoop]: Abstraction has 9486 states and 28402 transitions. [2019-12-27 22:27:44,534 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 22:27:44,534 INFO L276 IsEmpty]: Start isEmpty. Operand 9486 states and 28402 transitions. [2019-12-27 22:27:44,545 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 22:27:44,545 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:44,545 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:27:44,545 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:44,546 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:44,546 INFO L82 PathProgramCache]: Analyzing trace with hash -763910375, now seen corresponding path program 1 times [2019-12-27 22:27:44,546 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:44,546 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1107395516] [2019-12-27 22:27:44,546 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:44,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:44,649 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:27:44,649 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1107395516] [2019-12-27 22:27:44,650 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:44,650 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 22:27:44,650 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2090445665] [2019-12-27 22:27:44,650 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:44,659 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:44,710 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 99 states and 165 transitions. [2019-12-27 22:27:44,711 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:44,787 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 5 times. [2019-12-27 22:27:44,787 INFO L442 AbstractCegarLoop]: Interpolant automaton has 9 states [2019-12-27 22:27:44,787 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:44,788 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2019-12-27 22:27:44,788 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2019-12-27 22:27:44,788 INFO L87 Difference]: Start difference. First operand 9486 states and 28402 transitions. Second operand 9 states. [2019-12-27 22:27:45,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:45,943 INFO L93 Difference]: Finished difference Result 12274 states and 36081 transitions. [2019-12-27 22:27:45,943 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2019-12-27 22:27:45,943 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 41 [2019-12-27 22:27:45,944 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:45,960 INFO L225 Difference]: With dead ends: 12274 [2019-12-27 22:27:45,960 INFO L226 Difference]: Without dead ends: 12274 [2019-12-27 22:27:45,961 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 6 SyntacticMatches, 3 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2019-12-27 22:27:45,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12274 states. [2019-12-27 22:27:46,089 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12274 to 9678. [2019-12-27 22:27:46,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9678 states. [2019-12-27 22:27:46,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9678 states to 9678 states and 28976 transitions. [2019-12-27 22:27:46,105 INFO L78 Accepts]: Start accepts. Automaton has 9678 states and 28976 transitions. Word has length 41 [2019-12-27 22:27:46,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:46,106 INFO L462 AbstractCegarLoop]: Abstraction has 9678 states and 28976 transitions. [2019-12-27 22:27:46,106 INFO L463 AbstractCegarLoop]: Interpolant automaton has 9 states. [2019-12-27 22:27:46,106 INFO L276 IsEmpty]: Start isEmpty. Operand 9678 states and 28976 transitions. [2019-12-27 22:27:46,118 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2019-12-27 22:27:46,118 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:46,119 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] [2019-12-27 22:27:46,119 INFO L410 AbstractCegarLoop]: === Iteration 18 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:46,119 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:46,119 INFO L82 PathProgramCache]: Analyzing trace with hash 1724530801, now seen corresponding path program 2 times [2019-12-27 22:27:46,120 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:46,120 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549285746] [2019-12-27 22:27:46,120 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:46,134 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:46,176 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:27:46,176 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549285746] [2019-12-27 22:27:46,176 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:46,176 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 22:27:46,177 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [964967318] [2019-12-27 22:27:46,177 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:46,185 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:46,228 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 103 states and 174 transitions. [2019-12-27 22:27:46,228 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:46,229 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 22:27:46,230 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 22:27:46,230 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:46,230 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 22:27:46,230 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:27:46,230 INFO L87 Difference]: Start difference. First operand 9678 states and 28976 transitions. Second operand 3 states. [2019-12-27 22:27:46,276 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:46,276 INFO L93 Difference]: Finished difference Result 9605 states and 28720 transitions. [2019-12-27 22:27:46,277 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 22:27:46,277 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 41 [2019-12-27 22:27:46,277 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:46,292 INFO L225 Difference]: With dead ends: 9605 [2019-12-27 22:27:46,293 INFO L226 Difference]: Without dead ends: 9605 [2019-12-27 22:27:46,293 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 22:27:46,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9605 states. [2019-12-27 22:27:46,411 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9605 to 7942. [2019-12-27 22:27:46,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7942 states. [2019-12-27 22:27:46,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7942 states to 7942 states and 23928 transitions. [2019-12-27 22:27:46,425 INFO L78 Accepts]: Start accepts. Automaton has 7942 states and 23928 transitions. Word has length 41 [2019-12-27 22:27:46,425 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:46,425 INFO L462 AbstractCegarLoop]: Abstraction has 7942 states and 23928 transitions. [2019-12-27 22:27:46,425 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 22:27:46,425 INFO L276 IsEmpty]: Start isEmpty. Operand 7942 states and 23928 transitions. [2019-12-27 22:27:46,435 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2019-12-27 22:27:46,435 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:46,435 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] [2019-12-27 22:27:46,435 INFO L410 AbstractCegarLoop]: === Iteration 19 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:46,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:46,436 INFO L82 PathProgramCache]: Analyzing trace with hash -722539357, now seen corresponding path program 1 times [2019-12-27 22:27:46,436 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:46,436 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1092940156] [2019-12-27 22:27:46,437 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:46,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:46,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:27:46,513 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1092940156] [2019-12-27 22:27:46,513 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:46,513 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 22:27:46,513 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1399610616] [2019-12-27 22:27:46,513 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:46,522 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:46,564 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 101 states and 168 transitions. [2019-12-27 22:27:46,564 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:46,567 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 22:27:46,567 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 22:27:46,567 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:46,568 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 22:27:46,568 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2019-12-27 22:27:46,568 INFO L87 Difference]: Start difference. First operand 7942 states and 23928 transitions. Second operand 6 states. [2019-12-27 22:27:46,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:46,659 INFO L93 Difference]: Finished difference Result 7006 states and 21649 transitions. [2019-12-27 22:27:46,660 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 22:27:46,660 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 42 [2019-12-27 22:27:46,660 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:46,670 INFO L225 Difference]: With dead ends: 7006 [2019-12-27 22:27:46,670 INFO L226 Difference]: Without dead ends: 6907 [2019-12-27 22:27:46,671 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 5 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-27 22:27:46,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6907 states. [2019-12-27 22:27:46,755 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6907 to 6547. [2019-12-27 22:27:46,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6547 states. [2019-12-27 22:27:46,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6547 states to 6547 states and 20374 transitions. [2019-12-27 22:27:46,767 INFO L78 Accepts]: Start accepts. Automaton has 6547 states and 20374 transitions. Word has length 42 [2019-12-27 22:27:46,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:46,767 INFO L462 AbstractCegarLoop]: Abstraction has 6547 states and 20374 transitions. [2019-12-27 22:27:46,767 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 22:27:46,767 INFO L276 IsEmpty]: Start isEmpty. Operand 6547 states and 20374 transitions. [2019-12-27 22:27:46,778 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:27:46,779 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:46,779 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] [2019-12-27 22:27:46,779 INFO L410 AbstractCegarLoop]: === Iteration 20 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:46,779 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:46,779 INFO L82 PathProgramCache]: Analyzing trace with hash 11031254, now seen corresponding path program 1 times [2019-12-27 22:27:46,780 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:46,780 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [346714230] [2019-12-27 22:27:46,780 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:46,814 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:46,979 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:27:46,980 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [346714230] [2019-12-27 22:27:46,980 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:46,980 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-12-27 22:27:46,980 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1637011802] [2019-12-27 22:27:46,980 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:47,024 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:47,178 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 121 states and 192 transitions. [2019-12-27 22:27:47,179 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:47,496 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 15 times. [2019-12-27 22:27:47,496 INFO L442 AbstractCegarLoop]: Interpolant automaton has 15 states [2019-12-27 22:27:47,496 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:47,497 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2019-12-27 22:27:47,497 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=177, Unknown=0, NotChecked=0, Total=210 [2019-12-27 22:27:47,497 INFO L87 Difference]: Start difference. First operand 6547 states and 20374 transitions. Second operand 15 states. [2019-12-27 22:27:48,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:48,742 INFO L93 Difference]: Finished difference Result 12543 states and 38285 transitions. [2019-12-27 22:27:48,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 22:27:48,742 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 56 [2019-12-27 22:27:48,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:48,759 INFO L225 Difference]: With dead ends: 12543 [2019-12-27 22:27:48,760 INFO L226 Difference]: Without dead ends: 8549 [2019-12-27 22:27:48,760 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 5 SyntacticMatches, 8 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2019-12-27 22:27:48,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8549 states. [2019-12-27 22:27:48,915 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8549 to 7651. [2019-12-27 22:27:48,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7651 states. [2019-12-27 22:27:48,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7651 states to 7651 states and 23194 transitions. [2019-12-27 22:27:48,933 INFO L78 Accepts]: Start accepts. Automaton has 7651 states and 23194 transitions. Word has length 56 [2019-12-27 22:27:48,934 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:48,934 INFO L462 AbstractCegarLoop]: Abstraction has 7651 states and 23194 transitions. [2019-12-27 22:27:48,934 INFO L463 AbstractCegarLoop]: Interpolant automaton has 15 states. [2019-12-27 22:27:48,934 INFO L276 IsEmpty]: Start isEmpty. Operand 7651 states and 23194 transitions. [2019-12-27 22:27:48,945 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:27:48,945 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:48,945 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] [2019-12-27 22:27:48,945 INFO L410 AbstractCegarLoop]: === Iteration 21 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:48,945 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:48,946 INFO L82 PathProgramCache]: Analyzing trace with hash 2026976572, now seen corresponding path program 2 times [2019-12-27 22:27:48,947 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:48,948 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1730974895] [2019-12-27 22:27:48,948 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:48,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 22:27:49,148 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 22:27:49,150 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1730974895] [2019-12-27 22:27:49,151 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 22:27:49,151 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2019-12-27 22:27:49,151 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1887868336] [2019-12-27 22:27:49,151 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 22:27:49,167 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 22:27:49,257 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 138 states and 226 transitions. [2019-12-27 22:27:49,257 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 22:27:49,522 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 17 times. [2019-12-27 22:27:49,522 INFO L442 AbstractCegarLoop]: Interpolant automaton has 16 states [2019-12-27 22:27:49,522 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 22:27:49,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2019-12-27 22:27:49,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=204, Unknown=0, NotChecked=0, Total=240 [2019-12-27 22:27:49,523 INFO L87 Difference]: Start difference. First operand 7651 states and 23194 transitions. Second operand 16 states. [2019-12-27 22:27:50,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 22:27:50,562 INFO L93 Difference]: Finished difference Result 8889 states and 26282 transitions. [2019-12-27 22:27:50,563 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2019-12-27 22:27:50,563 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 56 [2019-12-27 22:27:50,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 22:27:50,576 INFO L225 Difference]: With dead ends: 8889 [2019-12-27 22:27:50,576 INFO L226 Difference]: Without dead ends: 8133 [2019-12-27 22:27:50,578 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 6 SyntacticMatches, 8 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 227 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=216, Invalid=906, Unknown=0, NotChecked=0, Total=1122 [2019-12-27 22:27:50,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8133 states. [2019-12-27 22:27:50,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8133 to 7379. [2019-12-27 22:27:50,685 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7379 states. [2019-12-27 22:27:50,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7379 states to 7379 states and 22450 transitions. [2019-12-27 22:27:50,699 INFO L78 Accepts]: Start accepts. Automaton has 7379 states and 22450 transitions. Word has length 56 [2019-12-27 22:27:50,699 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 22:27:50,699 INFO L462 AbstractCegarLoop]: Abstraction has 7379 states and 22450 transitions. [2019-12-27 22:27:50,699 INFO L463 AbstractCegarLoop]: Interpolant automaton has 16 states. [2019-12-27 22:27:50,699 INFO L276 IsEmpty]: Start isEmpty. Operand 7379 states and 22450 transitions. [2019-12-27 22:27:50,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 22:27:50,708 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 22:27:50,708 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 22:27:50,708 INFO L410 AbstractCegarLoop]: === Iteration 22 === [P1Err0ASSERT_VIOLATIONERROR_FUNCTION, P1Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-27 22:27:50,708 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 22:27:50,708 INFO L82 PathProgramCache]: Analyzing trace with hash -1554893024, now seen corresponding path program 3 times [2019-12-27 22:27:50,709 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 22:27:50,709 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1326323497] [2019-12-27 22:27:50,709 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 22:27:50,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:27:50,765 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 22:27:50,814 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 22:27:50,814 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 22:27:50,818 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [813] [813] ULTIMATE.startENTRY-->L818: Formula: (let ((.cse0 (store |v_#valid_64| 0 0))) (and (= v_~main$tmp_guard0~0_10 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2058~0.base_25|) 0) (= v_~main$tmp_guard1~0_16 0) (= v_~x$r_buff1_thd1~0_42 0) (= 0 v_~__unbuffered_cnt~0_20) (= 0 v_~x$w_buff1~0_25) (= 0 v_~x$r_buff0_thd1~0_72) (= 0 v_~__unbuffered_p0_EAX~0_12) (= 0 v_~x$r_buff0_thd0~0_21) (= v_~x$r_buff1_thd2~0_18 0) (= |v_#length_23| (store |v_#length_24| |v_ULTIMATE.start_main_~#t2058~0.base_25| 4)) (= v_~x$mem_tmp~0_9 0) (= 0 v_~x$read_delayed_var~0.base_7) (< 0 |v_#StackHeapBarrier_18|) (= 0 |v_#NULL.base_4|) (= 0 v_~weak$$choice2~0_33) (= 0 v_~weak$$choice0~0_7) (= 0 v_~x$read_delayed~0_7) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2058~0.base_25|) (= v_~x$flush_delayed~0_12 0) (= 0 v_~__unbuffered_p2_EAX~0_12) (= v_~__unbuffered_p0_EBX~0_12 0) (= |v_#NULL.offset_4| 0) (= 0 v_~x$w_buff0_used~0_114) (= v_~x~0_22 0) (= 0 v_~x$r_buff0_thd2~0_25) (= (store |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2058~0.base_25| (store (select |v_#memory_int_24| |v_ULTIMATE.start_main_~#t2058~0.base_25|) |v_ULTIMATE.start_main_~#t2058~0.offset_19| 0)) |v_#memory_int_23|) (= v_~y~0_10 0) (= 0 v_~x$r_buff0_thd3~0_19) (= 0 v_~x$read_delayed_var~0.offset_7) (= 0 v_~z~0_8) (= |v_ULTIMATE.start_main_~#t2058~0.offset_19| 0) (= 0 v_~x$w_buff0~0_31) (= v_~x$r_buff1_thd0~0_19 0) (= v_~x$r_buff1_thd3~0_16 0) (= |v_#valid_62| (store .cse0 |v_ULTIMATE.start_main_~#t2058~0.base_25| 1)) (= v_~x$w_buff1_used~0_69 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_64|, #memory_int=|v_#memory_int_24|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_31, ~x$flush_delayed~0=v_~x$flush_delayed~0_12, #NULL.offset=|v_#NULL.offset_4|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_42, ULTIMATE.start_main_~#t2059~0.offset=|v_ULTIMATE.start_main_~#t2059~0.offset_19|, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_19, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_10|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_10|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_12, #length=|v_#length_23|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_12, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_21, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_12, ~x$w_buff1~0=v_~x$w_buff1~0_25, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_69, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_18, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_7, ~weak$$choice0~0=v_~weak$$choice0~0_7, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x~0=v_~x~0_22, ULTIMATE.start_main_~#t2058~0.base=|v_ULTIMATE.start_main_~#t2058~0.base_25|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_72, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_17|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_16, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_16, ~x$mem_tmp~0=v_~x$mem_tmp~0_9, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_13|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_10|, ULTIMATE.start_main_~#t2058~0.offset=|v_ULTIMATE.start_main_~#t2058~0.offset_19|, ~y~0=v_~y~0_10, ULTIMATE.start_main_~#t2060~0.offset=|v_ULTIMATE.start_main_~#t2060~0.offset_14|, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_7|, ULTIMATE.start_main_~#t2059~0.base=|v_ULTIMATE.start_main_~#t2059~0.base_26|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_10, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_19, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_25, #NULL.base=|v_#NULL.base_4|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_114, ULTIMATE.start_main_~#t2060~0.base=|v_ULTIMATE.start_main_~#t2060~0.base_21|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_12|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_7, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_62|, #memory_int=|v_#memory_int_23|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_8, ~weak$$choice2~0=v_~weak$$choice2~0_33, ~x$read_delayed~0=v_~x$read_delayed~0_7} AuxVars[] AssignedVars[~x$w_buff0~0, ~x$flush_delayed~0, #NULL.offset, ~x$r_buff1_thd1~0, ULTIMATE.start_main_~#t2059~0.offset, ~x$r_buff0_thd3~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ~__unbuffered_p0_EAX~0, #length, ~__unbuffered_p2_EAX~0, ~x$r_buff0_thd0~0, ~__unbuffered_p0_EBX~0, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~x$read_delayed_var~0.base, ~weak$$choice0~0, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ~x~0, ULTIMATE.start_main_~#t2058~0.base, ~x$r_buff0_thd1~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, ~main$tmp_guard1~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2058~0.offset, ~y~0, ULTIMATE.start_main_~#t2060~0.offset, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2059~0.base, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, #NULL.base, ~x$w_buff0_used~0, ULTIMATE.start_main_~#t2060~0.base, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 22:27:50,819 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [780] [780] L818-1-->L820: Formula: (and (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2059~0.base_10| 4) |v_#length_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2059~0.base_10|) (not (= 0 |v_ULTIMATE.start_main_~#t2059~0.base_10|)) (= (select |v_#valid_32| |v_ULTIMATE.start_main_~#t2059~0.base_10|) 0) (= |v_#valid_31| (store |v_#valid_32| |v_ULTIMATE.start_main_~#t2059~0.base_10| 1)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2059~0.base_10| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2059~0.base_10|) |v_ULTIMATE.start_main_~#t2059~0.offset_9| 1)) |v_#memory_int_15|) (= |v_ULTIMATE.start_main_~#t2059~0.offset_9| 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_16|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_31|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_4|, ULTIMATE.start_main_~#t2059~0.base=|v_ULTIMATE.start_main_~#t2059~0.base_10|, #length=|v_#length_15|, ULTIMATE.start_main_~#t2059~0.offset=|v_ULTIMATE.start_main_~#t2059~0.offset_9|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ULTIMATE.start_main_~#t2059~0.base, #length, ULTIMATE.start_main_~#t2059~0.offset] because there is no mapped edge [2019-12-27 22:27:50,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L820-1-->L822: Formula: (and (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2060~0.base_11| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2060~0.base_11|) |v_ULTIMATE.start_main_~#t2060~0.offset_10| 2)) |v_#memory_int_13|) (not (= |v_ULTIMATE.start_main_~#t2060~0.base_11| 0)) (= (store |v_#length_14| |v_ULTIMATE.start_main_~#t2060~0.base_11| 4) |v_#length_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2060~0.base_11|) (= |v_#valid_29| (store |v_#valid_30| |v_ULTIMATE.start_main_~#t2060~0.base_11| 1)) (= 0 |v_ULTIMATE.start_main_~#t2060~0.offset_10|) (= (select |v_#valid_30| |v_ULTIMATE.start_main_~#t2060~0.base_11|) 0)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_30|, #memory_int=|v_#memory_int_14|, #length=|v_#length_14|} OutVars{ULTIMATE.start_main_~#t2060~0.base=|v_ULTIMATE.start_main_~#t2060~0.base_11|, ULTIMATE.start_main_~#t2060~0.offset=|v_ULTIMATE.start_main_~#t2060~0.offset_10|, #StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_29|, #memory_int=|v_#memory_int_13|, #length=|v_#length_13|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_4|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2060~0.base, ULTIMATE.start_main_~#t2060~0.offset, #valid, #memory_int, #length, ULTIMATE.start_main_#t~nondet39] because there is no mapped edge [2019-12-27 22:27:50,820 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [679] [679] P1ENTRY-->L5-3: Formula: (and (= v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_P1Thread1of1ForFork0_~arg.offset_5 |v_P1Thread1of1ForFork0_#in~arg.offset_5|) (= v_~x$w_buff1_used~0_42 v_~x$w_buff0_used~0_72) (= 0 (mod v_~x$w_buff1_used~0_42 256)) (= 1 v_~x$w_buff0_used~0_71) (= 1 v_~x$w_buff0~0_16) (= 1 |v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|) (= v_~x$w_buff0~0_17 v_~x$w_buff1~0_13) (= v_P1Thread1of1ForFork0_~arg.base_5 |v_P1Thread1of1ForFork0_#in~arg.base_5|)) InVars {~x$w_buff0~0=v_~x$w_buff0~0_17, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_72} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_16, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_7, P1Thread1of1ForFork0_~arg.offset=v_P1Thread1of1ForFork0_~arg.offset_5, P1Thread1of1ForFork0_~arg.base=v_P1Thread1of1ForFork0_~arg.base_5, P1Thread1of1ForFork0_#in~arg.base=|v_P1Thread1of1ForFork0_#in~arg.base_5|, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P1Thread1of1ForFork0___VERIFIER_assert_#in~expression_5|, ~x$w_buff1~0=v_~x$w_buff1~0_13, P1Thread1of1ForFork0_#in~arg.offset=|v_P1Thread1of1ForFork0_#in~arg.offset_5|, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_42, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_71} AuxVars[] AssignedVars[~x$w_buff0~0, P1Thread1of1ForFork0___VERIFIER_assert_~expression, P1Thread1of1ForFork0_~arg.offset, P1Thread1of1ForFork0_~arg.base, P1Thread1of1ForFork0___VERIFIER_assert_#in~expression, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$w_buff0_used~0] because there is no mapped edge [2019-12-27 22:27:50,824 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [756] [756] L795-2-->L795-4: Formula: (let ((.cse0 (= (mod ~x$r_buff1_thd3~0_In267255739 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In267255739 256) 0))) (or (and (or .cse0 .cse1) (= ~x~0_In267255739 |P2Thread1of1ForFork1_#t~ite32_Out267255739|)) (and (not .cse0) (not .cse1) (= ~x$w_buff1~0_In267255739 |P2Thread1of1ForFork1_#t~ite32_Out267255739|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In267255739, ~x$w_buff1_used~0=~x$w_buff1_used~0_In267255739, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In267255739, ~x~0=~x~0_In267255739} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out267255739|, ~x$w_buff1~0=~x$w_buff1~0_In267255739, ~x$w_buff1_used~0=~x$w_buff1_used~0_In267255739, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In267255739, ~x~0=~x~0_In267255739} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 22:27:50,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L795-4-->L796: Formula: (= v_~x~0_14 |v_P2Thread1of1ForFork1_#t~ite32_8|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_8|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_7|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_7|, ~x~0=v_~x~0_14} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 22:27:50,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L796-->L796-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd3~0_In166847850 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In166847850 256)))) (or (and (= ~x$w_buff0_used~0_In166847850 |P2Thread1of1ForFork1_#t~ite34_Out166847850|) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P2Thread1of1ForFork1_#t~ite34_Out166847850|)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In166847850, ~x$w_buff0_used~0=~x$w_buff0_used~0_In166847850} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out166847850|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In166847850, ~x$w_buff0_used~0=~x$w_buff0_used~0_In166847850} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 22:27:50,825 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L776-->L776-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-1843932393 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In-1843932393 256)))) (or (and (= |P1Thread1of1ForFork0_#t~ite28_Out-1843932393| ~x$w_buff0_used~0_In-1843932393) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-1843932393|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1843932393, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1843932393} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1843932393, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-1843932393|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1843932393} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 22:27:50,826 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff1_used~0_In402649809 256))) (.cse2 (= (mod ~x$r_buff1_thd2~0_In402649809 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In402649809 256))) (.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In402649809 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork0_#t~ite29_Out402649809| 0)) (and (= |P1Thread1of1ForFork0_#t~ite29_Out402649809| ~x$w_buff1_used~0_In402649809) (or .cse3 .cse2) (or .cse1 .cse0)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In402649809, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In402649809, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In402649809, ~x$w_buff0_used~0=~x$w_buff0_used~0_In402649809} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In402649809, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In402649809, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In402649809, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out402649809|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In402649809} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 22:27:50,828 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L740-->L740-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1933800339 256)))) (or (and (= ~x$w_buff0~0_In-1933800339 |P0Thread1of1ForFork2_#t~ite8_Out-1933800339|) .cse0 (= |P0Thread1of1ForFork2_#t~ite9_Out-1933800339| |P0Thread1of1ForFork2_#t~ite8_Out-1933800339|) (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-1933800339 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In-1933800339 256)) (and (= 0 (mod ~x$r_buff1_thd1~0_In-1933800339 256)) .cse1) (and (= 0 (mod ~x$w_buff1_used~0_In-1933800339 256)) .cse1)))) (and (= |P0Thread1of1ForFork2_#t~ite9_Out-1933800339| ~x$w_buff0~0_In-1933800339) (= |P0Thread1of1ForFork2_#t~ite8_In-1933800339| |P0Thread1of1ForFork2_#t~ite8_Out-1933800339|) (not .cse0)))) InVars {~x$w_buff0~0=~x$w_buff0~0_In-1933800339, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1933800339, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_In-1933800339|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1933800339, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1933800339, ~weak$$choice2~0=~weak$$choice2~0_In-1933800339, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1933800339} OutVars{~x$w_buff0~0=~x$w_buff0~0_In-1933800339, ~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1933800339, P0Thread1of1ForFork2_#t~ite8=|P0Thread1of1ForFork2_#t~ite8_Out-1933800339|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1933800339, P0Thread1of1ForFork2_#t~ite9=|P0Thread1of1ForFork2_#t~ite9_Out-1933800339|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1933800339, ~weak$$choice2~0=~weak$$choice2~0_In-1933800339, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1933800339} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite8, P0Thread1of1ForFork2_#t~ite9] because there is no mapped edge [2019-12-27 22:27:50,831 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L742-->L742-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-497874948 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite14_Out-497874948| |P0Thread1of1ForFork2_#t~ite15_Out-497874948|) (let ((.cse0 (= (mod ~x$r_buff0_thd1~0_In-497874948 256) 0))) (or (and (= 0 (mod ~x$w_buff1_used~0_In-497874948 256)) .cse0) (and (= (mod ~x$r_buff1_thd1~0_In-497874948 256) 0) .cse0) (= 0 (mod ~x$w_buff0_used~0_In-497874948 256)))) (= ~x$w_buff0_used~0_In-497874948 |P0Thread1of1ForFork2_#t~ite14_Out-497874948|) .cse1) (and (not .cse1) (= |P0Thread1of1ForFork2_#t~ite14_In-497874948| |P0Thread1of1ForFork2_#t~ite14_Out-497874948|) (= ~x$w_buff0_used~0_In-497874948 |P0Thread1of1ForFork2_#t~ite15_Out-497874948|)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-497874948, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-497874948, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-497874948, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-497874948|, ~weak$$choice2~0=~weak$$choice2~0_In-497874948, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-497874948} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-497874948, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-497874948, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-497874948|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-497874948, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-497874948|, ~weak$$choice2~0=~weak$$choice2~0_In-497874948, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-497874948} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 22:27:50,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [791] [791] L743-->L743-8: Formula: (let ((.cse0 (= 0 (mod ~weak$$choice2~0_In-1811447814 256)))) (or (and (= |P0Thread1of1ForFork2_#t~ite17_Out-1811447814| ~x$w_buff1_used~0_In-1811447814) .cse0 (let ((.cse1 (= (mod ~x$r_buff0_thd1~0_In-1811447814 256) 0))) (or (= 0 (mod ~x$w_buff0_used~0_In-1811447814 256)) (and .cse1 (= (mod ~x$r_buff1_thd1~0_In-1811447814 256) 0)) (and .cse1 (= (mod ~x$w_buff1_used~0_In-1811447814 256) 0)))) (= |P0Thread1of1ForFork2_#t~ite17_Out-1811447814| |P0Thread1of1ForFork2_#t~ite18_Out-1811447814|)) (and (= ~x$w_buff1_used~0_In-1811447814 |P0Thread1of1ForFork2_#t~ite18_Out-1811447814|) (= |P0Thread1of1ForFork2_#t~ite17_In-1811447814| |P0Thread1of1ForFork2_#t~ite17_Out-1811447814|) (not .cse0)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1811447814, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_In-1811447814|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1811447814, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1811447814, ~weak$$choice2~0=~weak$$choice2~0_In-1811447814, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1811447814} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1811447814, P0Thread1of1ForFork2_#t~ite18=|P0Thread1of1ForFork2_#t~ite18_Out-1811447814|, P0Thread1of1ForFork2_#t~ite17=|P0Thread1of1ForFork2_#t~ite17_Out-1811447814|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1811447814, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1811447814, ~weak$$choice2~0=~weak$$choice2~0_In-1811447814, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1811447814} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite18, P0Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-27 22:27:50,832 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [734] [734] L744-->L745: Formula: (and (= v_~x$r_buff0_thd1~0_58 v_~x$r_buff0_thd1~0_57) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_58, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_10|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_57, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_9|, ~weak$$choice2~0=v_~weak$$choice2~0_23, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_8|} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite20, ~x$r_buff0_thd1~0, P0Thread1of1ForFork2_#t~ite19, P0Thread1of1ForFork2_#t~ite21] because there is no mapped edge [2019-12-27 22:27:50,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [802] [802] L745-->L745-8: Formula: (let ((.cse0 (= |P0Thread1of1ForFork2_#t~ite24_Out824688624| |P0Thread1of1ForFork2_#t~ite23_Out824688624|)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In824688624 256))) (.cse4 (= (mod ~x$r_buff1_thd1~0_In824688624 256) 0)) (.cse5 (= 0 (mod ~weak$$choice2~0_In824688624 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In824688624 256))) (.cse2 (= (mod ~x$r_buff0_thd1~0_In824688624 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite22_In824688624| |P0Thread1of1ForFork2_#t~ite22_Out824688624|) (or (and .cse0 (or (and .cse1 .cse2) .cse3 (and .cse2 .cse4)) .cse5 (= ~x$r_buff1_thd1~0_In824688624 |P0Thread1of1ForFork2_#t~ite23_Out824688624|)) (and (= |P0Thread1of1ForFork2_#t~ite23_In824688624| |P0Thread1of1ForFork2_#t~ite23_Out824688624|) (= ~x$r_buff1_thd1~0_In824688624 |P0Thread1of1ForFork2_#t~ite24_Out824688624|) (not .cse5)))) (let ((.cse6 (not .cse2))) (and .cse0 (not .cse3) (or .cse6 (not .cse4)) .cse5 (or (not .cse1) .cse6) (= |P0Thread1of1ForFork2_#t~ite23_Out824688624| |P0Thread1of1ForFork2_#t~ite22_Out824688624|) (= 0 |P0Thread1of1ForFork2_#t~ite22_Out824688624|))))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In824688624, ~x$w_buff1_used~0=~x$w_buff1_used~0_In824688624, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In824688624, ~weak$$choice2~0=~weak$$choice2~0_In824688624, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In824688624|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_In824688624|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In824688624} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In824688624, ~x$w_buff1_used~0=~x$w_buff1_used~0_In824688624, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In824688624, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out824688624|, ~weak$$choice2~0=~weak$$choice2~0_In824688624, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out824688624|, P0Thread1of1ForFork2_#t~ite22=|P0Thread1of1ForFork2_#t~ite22_Out824688624|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In824688624} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23, P0Thread1of1ForFork2_#t~ite22] because there is no mapped edge [2019-12-27 22:27:50,833 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L797-->L797-2: Formula: (let ((.cse3 (= (mod ~x$r_buff1_thd3~0_In-1784525651 256) 0)) (.cse2 (= (mod ~x$w_buff1_used~0_In-1784525651 256) 0)) (.cse0 (= (mod ~x$w_buff0_used~0_In-1784525651 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd3~0_In-1784525651 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out-1784525651| 0)) (and (or .cse3 .cse2) (= |P2Thread1of1ForFork1_#t~ite35_Out-1784525651| ~x$w_buff1_used~0_In-1784525651) (or .cse0 .cse1)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In-1784525651, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1784525651, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1784525651, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1784525651} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out-1784525651|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1784525651, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-1784525651, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In-1784525651, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1784525651} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 22:27:50,834 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [744] [744] L798-->L798-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd3~0_In1629373109 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1629373109 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite36_Out1629373109| ~x$r_buff0_thd3~0_In1629373109) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite36_Out1629373109| 0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1629373109, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1629373109} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out1629373109|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In1629373109, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1629373109} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 22:27:50,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [749] [749] L799-->L799-2: Formula: (let ((.cse1 (= (mod ~x$w_buff0_used~0_In452730106 256) 0)) (.cse0 (= (mod ~x$r_buff0_thd3~0_In452730106 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In452730106 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd3~0_In452730106 256)))) (or (and (= 0 |P2Thread1of1ForFork1_#t~ite37_Out452730106|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (or .cse3 .cse2) (= ~x$r_buff1_thd3~0_In452730106 |P2Thread1of1ForFork1_#t~ite37_Out452730106|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In452730106, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In452730106, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In452730106, ~x$w_buff0_used~0=~x$w_buff0_used~0_In452730106} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out452730106|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In452730106, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In452730106, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In452730106, ~x$w_buff0_used~0=~x$w_buff0_used~0_In452730106} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 22:27:50,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L799-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_13 1) v_~__unbuffered_cnt~0_12) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_12 |v_P2Thread1of1ForFork1_#t~ite37_8|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_13} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_7|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_12, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_12, P2Thread1of1ForFork1_#res.offset=|v_P2Thread1of1ForFork1_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37, P2Thread1of1ForFork1_#res.base, ~x$r_buff1_thd3~0, ~__unbuffered_cnt~0, P2Thread1of1ForFork1_#res.offset] because there is no mapped edge [2019-12-27 22:27:50,835 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L778-->L779: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In291041392 256))) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In291041392 256)))) (or (and (not .cse0) (= 0 ~x$r_buff0_thd2~0_Out291041392) (not .cse1)) (and (= ~x$r_buff0_thd2~0_In291041392 ~x$r_buff0_thd2~0_Out291041392) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In291041392, ~x$w_buff0_used~0=~x$w_buff0_used~0_In291041392} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out291041392|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out291041392, ~x$w_buff0_used~0=~x$w_buff0_used~0_In291041392} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 22:27:50,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [758] [758] L779-->L779-2: Formula: (let ((.cse2 (= 0 (mod ~x$w_buff1_used~0_In1406220233 256))) (.cse3 (= 0 (mod ~x$r_buff1_thd2~0_In1406220233 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd2~0_In1406220233 256))) (.cse0 (= (mod ~x$w_buff0_used~0_In1406220233 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1406220233|)) (and (or .cse2 .cse3) (or .cse1 .cse0) (= ~x$r_buff1_thd2~0_In1406220233 |P1Thread1of1ForFork0_#t~ite31_Out1406220233|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1406220233, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1406220233, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1406220233, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1406220233} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1406220233|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1406220233, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1406220233, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1406220233, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1406220233} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 22:27:50,836 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L779-2-->P1EXIT: Formula: (and (= v_~__unbuffered_cnt~0_14 (+ v_~__unbuffered_cnt~0_15 1)) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= v_~x$r_buff1_thd2~0_14 |v_P1Thread1of1ForFork0_#t~ite31_8|)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_15} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_7|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_14, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_14, P1Thread1of1ForFork0_#res.offset=|v_P1Thread1of1ForFork0_#res.offset_5|, P1Thread1of1ForFork0_#res.base=|v_P1Thread1of1ForFork0_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31, ~x$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork0_#res.offset, P1Thread1of1ForFork0_#res.base] because there is no mapped edge [2019-12-27 22:27:50,837 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [709] [709] L747-->L755: Formula: (and (= 0 v_~x$flush_delayed~0_6) (= v_~x$mem_tmp~0_4 v_~x~0_16) (not (= 0 (mod v_~x$flush_delayed~0_7 256))) (= (+ v_~__unbuffered_cnt~0_11 1) v_~__unbuffered_cnt~0_10)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_7, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_11, ~x$mem_tmp~0=v_~x$mem_tmp~0_4} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_7|, ~x$flush_delayed~0=v_~x$flush_delayed~0_6, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_10, ~x$mem_tmp~0=v_~x$mem_tmp~0_4, ~x~0=v_~x~0_16} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 22:27:50,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [703] [703] L826-->L828-2: Formula: (and (or (= (mod v_~x$r_buff0_thd0~0_15 256) 0) (= 0 (mod v_~x$w_buff0_used~0_86 256))) (not (= (mod v_~main$tmp_guard0~0_4 256) 0))) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_86} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_4, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_86} AuxVars[] AssignedVars[] because there is no mapped edge [2019-12-27 22:27:50,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [755] [755] L828-2-->L828-4: Formula: (let ((.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In1214280787 256))) (.cse0 (= (mod ~x$w_buff1_used~0_In1214280787 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite41_Out1214280787| ~x~0_In1214280787) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= ~x$w_buff1~0_In1214280787 |ULTIMATE.start_main_#t~ite41_Out1214280787|)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In1214280787, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1214280787, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1214280787, ~x~0=~x~0_In1214280787} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out1214280787|, ~x$w_buff1~0=~x$w_buff1~0_In1214280787, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1214280787, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1214280787, ~x~0=~x~0_In1214280787} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41] because there is no mapped edge [2019-12-27 22:27:50,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [693] [693] L828-4-->L829: Formula: (= v_~x~0_15 |v_ULTIMATE.start_main_#t~ite41_7|) InVars {ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_7|} OutVars{ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_6|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_6|, ~x~0=v_~x~0_15} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42, ~x~0] because there is no mapped edge [2019-12-27 22:27:50,838 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [743] [743] L829-->L829-2: Formula: (let ((.cse0 (= 0 (mod ~x$w_buff0_used~0_In1832296787 256))) (.cse1 (= 0 (mod ~x$r_buff0_thd0~0_In1832296787 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite43_Out1832296787| ~x$w_buff0_used~0_In1832296787)) (and (not .cse0) (= |ULTIMATE.start_main_#t~ite43_Out1832296787| 0) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1832296787, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1832296787} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1832296787, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1832296787|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1832296787} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 22:27:50,839 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L830-->L830-2: Formula: (let ((.cse1 (= (mod ~x$r_buff1_thd0~0_In534998676 256) 0)) (.cse0 (= (mod ~x$w_buff1_used~0_In534998676 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd0~0_In534998676 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In534998676 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite44_Out534998676| ~x$w_buff1_used~0_In534998676)) (and (= |ULTIMATE.start_main_#t~ite44_Out534998676| 0) (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In534998676, ~x$w_buff1_used~0=~x$w_buff1_used~0_In534998676, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In534998676, ~x$w_buff0_used~0=~x$w_buff0_used~0_In534998676} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In534998676, ~x$w_buff1_used~0=~x$w_buff1_used~0_In534998676, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In534998676, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out534998676|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In534998676} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 22:27:50,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L831-->L831-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In2129325763 256))) (.cse0 (= (mod ~x$r_buff0_thd0~0_In2129325763 256) 0))) (or (and (= |ULTIMATE.start_main_#t~ite45_Out2129325763| ~x$r_buff0_thd0~0_In2129325763) (or .cse0 .cse1)) (and (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite45_Out2129325763| 0)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2129325763, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2129325763} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In2129325763, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out2129325763|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2129325763} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 22:27:50,840 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L832-->L832-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd0~0_In1280788763 256))) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1280788763 256))) (.cse2 (= (mod ~x$r_buff1_thd0~0_In1280788763 256) 0)) (.cse3 (= (mod ~x$w_buff1_used~0_In1280788763 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |ULTIMATE.start_main_#t~ite46_Out1280788763|)) (and (= ~x$r_buff1_thd0~0_In1280788763 |ULTIMATE.start_main_#t~ite46_Out1280788763|) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1280788763, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1280788763, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1280788763, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1280788763} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1280788763, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1280788763|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1280788763, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1280788763, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1280788763} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 22:27:50,841 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L832-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_8| (mod v_~main$tmp_guard1~0_11 256)) (= v_ULTIMATE.start___VERIFIER_assert_~expression_16 0) (= v_~x$r_buff1_thd0~0_13 |v_ULTIMATE.start_main_#t~ite46_10|) (= v_~__unbuffered_p0_EBX~0_7 0) (= v_~main$tmp_guard1~0_11 0) (= v_~__unbuffered_p2_EAX~0_7 1) (= v_~__unbuffered_p0_EAX~0_7 1)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_7, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_16, ~__unbuffered_p0_EBX~0=v_~__unbuffered_p0_EBX~0_7, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_9|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_11, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_7, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_13, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_8|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression, ULTIMATE.start_main_#t~ite46, ~main$tmp_guard1~0, ~x$r_buff1_thd0~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-27 22:27:50,918 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 10:27:50 BasicIcfg [2019-12-27 22:27:50,918 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 22:27:50,921 INFO L168 Benchmark]: Toolchain (without parser) took 149991.22 ms. Allocated memory was 138.4 MB in the beginning and 3.1 GB in the end (delta: 3.0 GB). Free memory was 100.3 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 993.1 MB. Max. memory is 7.1 GB. [2019-12-27 22:27:50,922 INFO L168 Benchmark]: CDTParser took 0.29 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. [2019-12-27 22:27:50,922 INFO L168 Benchmark]: CACSL2BoogieTranslator took 774.53 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.0 MB in the beginning and 155.7 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. [2019-12-27 22:27:50,923 INFO L168 Benchmark]: Boogie Procedure Inliner took 63.32 ms. Allocated memory is still 202.9 MB. Free memory was 155.7 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:27:50,923 INFO L168 Benchmark]: Boogie Preprocessor took 37.83 ms. Allocated memory is still 202.9 MB. Free memory was 153.0 MB in the beginning and 150.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:27:50,929 INFO L168 Benchmark]: RCFGBuilder took 801.32 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 103.7 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. [2019-12-27 22:27:50,930 INFO L168 Benchmark]: TraceAbstraction took 148308.60 ms. Allocated memory was 202.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 103.7 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 932.0 MB. Max. memory is 7.1 GB. [2019-12-27 22:27:50,935 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.29 ms. Allocated memory is still 138.4 MB. Free memory was 120.3 MB in the beginning and 120.1 MB in the end (delta: 209.9 kB). Peak memory consumption was 209.9 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 774.53 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 100.0 MB in the beginning and 155.7 MB in the end (delta: -55.7 MB). Peak memory consumption was 24.5 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 63.32 ms. Allocated memory is still 202.9 MB. Free memory was 155.7 MB in the beginning and 153.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 37.83 ms. Allocated memory is still 202.9 MB. Free memory was 153.0 MB in the beginning and 150.4 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * RCFGBuilder took 801.32 ms. Allocated memory is still 202.9 MB. Free memory was 150.4 MB in the beginning and 103.7 MB in the end (delta: 46.7 MB). Peak memory consumption was 46.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 148308.60 ms. Allocated memory was 202.9 MB in the beginning and 3.1 GB in the end (delta: 2.9 GB). Free memory was 103.7 MB in the beginning and 2.1 GB in the end (delta: -2.0 GB). Peak memory consumption was 932.0 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 4.1s, 164 ProgramPointsBefore, 82 ProgramPointsAfterwards, 195 TransitionsBefore, 89 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 33 TrivialSequentialCompositions, 49 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 32 ConcurrentYvCompositions, 28 ChoiceCompositions, 6736 VarBasedMoverChecksPositive, 197 VarBasedMoverChecksNegative, 0 SemBasedMoverChecksPositive, 0 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 0.0s, 0 MoverChecksTotal, 67273 CheckedPairsTotal, 114 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L818] FCALL, FORK 0 pthread_create(&t2058, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L820] FCALL, FORK 0 pthread_create(&t2059, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, y=0, z=0] [L765] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L766] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L767] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L768] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L769] 2 x$r_buff0_thd2 = (_Bool)1 [L772] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L775] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L822] FCALL, FORK 0 pthread_create(&t2060, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=0] [L789] 3 __unbuffered_p2_EAX = y [L792] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L795] 3 x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L775] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L776] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L732] 1 __unbuffered_p0_EAX = z [L735] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L736] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L737] 1 x$flush_delayed = weak$$choice2 [L738] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L739] EXPR 1 !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) VAL [!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1)=0, __unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L777] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L739] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L740] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L741] EXPR 1 weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1))=0, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L741] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L742] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L743] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L796] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L797] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L798] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L745] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L746] 1 __unbuffered_p0_EBX = x VAL [\result={0:0}, __unbuffered_cnt=2, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=1, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L824] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=1, __unbuffered_p0_EBX=0, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, y=1, z=1] [L829] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L830] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L831] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 155 locations, 2 error locations. Result: UNSAFE, OverallTime: 148.0s, OverallIterations: 22, TraceHistogramMax: 1, AutomataDifference: 44.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3237 SDtfs, 6154 SDslu, 13245 SDs, 0 SdLazy, 8651 SolverSat, 336 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 8.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 309 GetRequests, 69 SyntacticMatches, 34 SemanticMatches, 206 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 732 ImplicationChecksByTransitivity, 5.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=133631occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 82.2s AutomataMinimizationTime, 21 MinimizatonAttempts, 310888 StatesRemovedByMinimization, 19 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.4s InterpolantComputationTime, 665 NumberOfCodeBlocks, 665 NumberOfCodeBlocksAsserted, 22 NumberOfCheckSat, 588 ConstructedInterpolants, 0 QuantifiedInterpolants, 71929 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 21 InterpolantComputations, 21 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...