/usr/bin/java -Xmx8000000000 -Xss4m -jar ./plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata ./data -tc ../../../trunk/examples/toolchains/AutomizerCInline.xml -s ../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe031_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-4336eb1 [2019-12-27 18:48:03,513 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-27 18:48:03,516 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-27 18:48:03,533 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-27 18:48:03,534 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-27 18:48:03,535 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-27 18:48:03,537 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-27 18:48:03,547 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-27 18:48:03,550 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-27 18:48:03,553 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-27 18:48:03,555 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-27 18:48:03,557 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-27 18:48:03,557 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-27 18:48:03,559 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-27 18:48:03,561 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-27 18:48:03,562 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-27 18:48:03,564 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-27 18:48:03,565 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-27 18:48:03,568 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-27 18:48:03,573 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-27 18:48:03,577 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-27 18:48:03,581 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-27 18:48:03,583 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-27 18:48:03,583 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-27 18:48:03,585 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-27 18:48:03,586 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-27 18:48:03,586 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-27 18:48:03,587 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-27 18:48:03,589 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-27 18:48:03,590 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-27 18:48:03,590 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-27 18:48:03,591 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-27 18:48:03,592 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-27 18:48:03,593 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-27 18:48:03,594 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-27 18:48:03,594 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-27 18:48:03,594 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-27 18:48:03,595 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-27 18:48:03,595 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-27 18:48:03,596 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-27 18:48:03,596 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-27 18:48:03,597 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/settings/automizer/concurrent/svcomp-Reach-32bit-Automizer_Default-noMmResRef-FA-SemanticLbe-MCR.epf [2019-12-27 18:48:03,611 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-27 18:48:03,611 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-27 18:48:03,612 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-27 18:48:03,612 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-27 18:48:03,613 INFO L138 SettingsManager]: * Use SBE=true [2019-12-27 18:48:03,613 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-27 18:48:03,613 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-27 18:48:03,613 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-27 18:48:03,613 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-27 18:48:03,614 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-27 18:48:03,614 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-27 18:48:03,614 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-27 18:48:03,614 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-27 18:48:03,614 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-27 18:48:03,615 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-27 18:48:03,615 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-27 18:48:03,615 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-27 18:48:03,615 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-27 18:48:03,615 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-27 18:48:03,615 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-27 18:48:03,616 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-27 18:48:03,616 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-27 18:48:03,616 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-27 18:48:03,616 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-27 18:48:03,616 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-27 18:48:03,617 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-27 18:48:03,617 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-27 18:48:03,617 INFO L138 SettingsManager]: * Override the interpolant automaton setting of the refinement strategy=true [2019-12-27 18:48:03,617 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-27 18:48:03,617 INFO L138 SettingsManager]: * Interpolant automaton=MCR [2019-12-27 18:48:03,618 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-27 18:48:03,906 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-27 18:48:03,926 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-27 18:48:03,930 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-27 18:48:03,931 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-27 18:48:03,932 INFO L275 PluginConnector]: CDTParser initialized [2019-12-27 18:48:03,934 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe031_rmo.oepc.i [2019-12-27 18:48:04,010 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd9f74acb/ff3e3dec9ff54d2eb8a6c732557f1093/FLAG745414a4c [2019-12-27 18:48:04,574 INFO L306 CDTParser]: Found 1 translation units. [2019-12-27 18:48:04,575 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe031_rmo.oepc.i [2019-12-27 18:48:04,591 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd9f74acb/ff3e3dec9ff54d2eb8a6c732557f1093/FLAG745414a4c [2019-12-27 18:48:04,863 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/bd9f74acb/ff3e3dec9ff54d2eb8a6c732557f1093 [2019-12-27 18:48:04,873 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-27 18:48:04,875 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-27 18:48:04,876 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-27 18:48:04,876 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-27 18:48:04,880 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-27 18:48:04,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:48:04" (1/1) ... [2019-12-27 18:48:04,884 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@72a8adc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:04, skipping insertion in model container [2019-12-27 18:48:04,884 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 27.12 06:48:04" (1/1) ... [2019-12-27 18:48:04,892 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-27 18:48:04,947 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-27 18:48:05,695 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:48:05,719 INFO L203 MainTranslator]: Completed pre-run [2019-12-27 18:48:05,815 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-27 18:48:05,902 INFO L208 MainTranslator]: Completed translation [2019-12-27 18:48:05,902 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:05 WrapperNode [2019-12-27 18:48:05,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-27 18:48:05,903 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-27 18:48:05,904 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-27 18:48:05,904 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-27 18:48:05,913 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:05" (1/1) ... [2019-12-27 18:48:05,953 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:05" (1/1) ... [2019-12-27 18:48:05,998 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-27 18:48:05,998 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-27 18:48:06,000 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-27 18:48:06,001 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-27 18:48:06,011 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:05" (1/1) ... [2019-12-27 18:48:06,011 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:05" (1/1) ... [2019-12-27 18:48:06,027 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:05" (1/1) ... [2019-12-27 18:48:06,027 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:05" (1/1) ... [2019-12-27 18:48:06,046 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:05" (1/1) ... [2019-12-27 18:48:06,056 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:05" (1/1) ... [2019-12-27 18:48:06,060 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:05" (1/1) ... [2019-12-27 18:48:06,073 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-27 18:48:06,074 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-27 18:48:06,074 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-27 18:48:06,075 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-27 18:48:06,075 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:05" (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 18:48:06,147 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-27 18:48:06,148 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-27 18:48:06,148 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-27 18:48:06,148 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-27 18:48:06,149 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-27 18:48:06,149 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-27 18:48:06,150 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-27 18:48:06,150 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-27 18:48:06,151 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-27 18:48:06,151 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-27 18:48:06,151 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-27 18:48:06,151 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-27 18:48:06,152 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-27 18:48:06,155 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 18:48:06,904 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-27 18:48:06,905 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-27 18:48:06,907 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:48:06 BoogieIcfgContainer [2019-12-27 18:48:06,907 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-27 18:48:06,908 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-27 18:48:06,908 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-27 18:48:06,913 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-27 18:48:06,913 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 27.12 06:48:04" (1/3) ... [2019-12-27 18:48:06,914 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3adfbc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:48:06, skipping insertion in model container [2019-12-27 18:48:06,914 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 27.12 06:48:05" (2/3) ... [2019-12-27 18:48:06,915 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3adfbc1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 27.12 06:48:06, skipping insertion in model container [2019-12-27 18:48:06,915 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 27.12 06:48:06" (3/3) ... [2019-12-27 18:48:06,917 INFO L109 eAbstractionObserver]: Analyzing ICFG safe031_rmo.oepc.i [2019-12-27 18:48:06,928 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-27 18:48:06,928 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-27 18:48:06,939 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-27 18:48:06,941 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-27 18:48:06,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,985 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,986 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,986 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,986 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,987 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,988 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,992 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,993 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,994 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,995 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,996 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,997 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,998 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:06,999 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,000 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,001 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,002 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,003 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,004 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,005 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,006 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,007 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,008 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,012 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,013 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,014 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,015 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,015 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,015 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,016 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,016 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,035 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,036 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,037 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,038 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,039 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,040 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,041 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,042 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,042 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,042 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,043 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,043 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,044 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,045 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,046 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,047 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,048 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,051 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,051 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,051 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,051 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite31| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite30| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite28| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,052 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite29| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite26| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,053 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork0_#t~ite27| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,055 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite36| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite35| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite37| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite32| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,056 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,056 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,056 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite34| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#t~ite33| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,057 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,059 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,059 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,060 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,060 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,061 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite25| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,062 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite24| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite23| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~nondet3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,063 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite22| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,064 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork2_#t~ite21| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-27 18:48:07,078 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-27 18:48:07,098 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-27 18:48:07,098 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-27 18:48:07,098 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-27 18:48:07,098 INFO L376 AbstractCegarLoop]: Backedges is MCR [2019-12-27 18:48:07,098 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-27 18:48:07,098 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-27 18:48:07,099 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-27 18:48:07,099 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-27 18:48:07,119 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 162 places, 193 transitions [2019-12-27 18:48:07,121 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 18:48:07,228 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 18:48:07,229 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:48:07,244 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:48:07,266 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 162 places, 193 transitions [2019-12-27 18:48:07,316 INFO L132 PetriNetUnfolder]: 41/190 cut-off events. [2019-12-27 18:48:07,316 INFO L133 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-27 18:48:07,324 INFO L76 FinitePrefix]: Finished finitePrefix Result has 200 conditions, 190 events. 41/190 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 447 event pairs. 0/147 useless extension candidates. Maximal degree in co-relation 161. Up to 2 conditions per place. [2019-12-27 18:48:07,344 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 16696 [2019-12-27 18:48:07,345 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-27 18:48:12,806 WARN L192 SmtUtils]: Spent 238.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-27 18:48:12,939 WARN L192 SmtUtils]: Spent 131.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-27 18:48:12,964 INFO L206 etLargeBlockEncoding]: Checked pairs total: 64880 [2019-12-27 18:48:12,964 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-27 18:48:12,968 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 83 places, 92 transitions [2019-12-27 18:48:24,746 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 83222 states. [2019-12-27 18:48:24,749 INFO L276 IsEmpty]: Start isEmpty. Operand 83222 states. [2019-12-27 18:48:24,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2019-12-27 18:48:24,757 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:24,758 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2019-12-27 18:48:24,758 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 18:48:24,762 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:24,763 INFO L82 PathProgramCache]: Analyzing trace with hash 793650723, now seen corresponding path program 1 times [2019-12-27 18:48:24,770 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:24,771 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975292274] [2019-12-27 18:48:24,771 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:24,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:25,029 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 18:48:25,030 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975292274] [2019-12-27 18:48:25,032 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:25,032 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-27 18:48:25,033 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1856025729] [2019-12-27 18:48:25,034 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:25,038 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:25,048 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 6 states and 5 transitions. [2019-12-27 18:48:25,048 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:25,052 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:48:25,052 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:48:25,052 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:25,063 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:48:25,063 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:48:25,064 INFO L87 Difference]: Start difference. First operand 83222 states. Second operand 3 states. [2019-12-27 18:48:27,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:27,261 INFO L93 Difference]: Finished difference Result 82272 states and 355122 transitions. [2019-12-27 18:48:27,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:48:27,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 5 [2019-12-27 18:48:27,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:27,782 INFO L225 Difference]: With dead ends: 82272 [2019-12-27 18:48:27,782 INFO L226 Difference]: Without dead ends: 77232 [2019-12-27 18:48:27,785 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 18:48:32,616 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77232 states. [2019-12-27 18:48:34,892 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77232 to 77232. [2019-12-27 18:48:34,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 77232 states. [2019-12-27 18:48:35,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77232 states to 77232 states and 332862 transitions. [2019-12-27 18:48:35,265 INFO L78 Accepts]: Start accepts. Automaton has 77232 states and 332862 transitions. Word has length 5 [2019-12-27 18:48:35,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:35,265 INFO L462 AbstractCegarLoop]: Abstraction has 77232 states and 332862 transitions. [2019-12-27 18:48:35,265 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:48:35,265 INFO L276 IsEmpty]: Start isEmpty. Operand 77232 states and 332862 transitions. [2019-12-27 18:48:35,273 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:48:35,274 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:35,274 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:48:35,274 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 18:48:35,275 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:35,275 INFO L82 PathProgramCache]: Analyzing trace with hash -187432799, now seen corresponding path program 1 times [2019-12-27 18:48:35,275 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:35,276 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [458929705] [2019-12-27 18:48:35,276 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:35,306 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:35,390 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 18:48:35,390 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [458929705] [2019-12-27 18:48:35,390 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:35,391 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:48:35,391 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1066073724] [2019-12-27 18:48:35,391 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:35,392 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:35,396 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:48:35,396 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:35,397 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:48:35,398 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:48:35,398 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:35,398 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:48:35,399 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:48:35,399 INFO L87 Difference]: Start difference. First operand 77232 states and 332862 transitions. Second operand 4 states. [2019-12-27 18:48:39,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:39,427 INFO L93 Difference]: Finished difference Result 119112 states and 491884 transitions. [2019-12-27 18:48:39,427 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-27 18:48:39,428 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-27 18:48:39,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:39,986 INFO L225 Difference]: With dead ends: 119112 [2019-12-27 18:48:39,986 INFO L226 Difference]: Without dead ends: 119007 [2019-12-27 18:48:39,987 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 18:48:46,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119007 states. [2019-12-27 18:48:48,574 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119007 to 111499. [2019-12-27 18:48:48,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 111499 states. [2019-12-27 18:48:48,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111499 states to 111499 states and 464543 transitions. [2019-12-27 18:48:48,924 INFO L78 Accepts]: Start accepts. Automaton has 111499 states and 464543 transitions. Word has length 13 [2019-12-27 18:48:48,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:48,925 INFO L462 AbstractCegarLoop]: Abstraction has 111499 states and 464543 transitions. [2019-12-27 18:48:48,925 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:48:48,925 INFO L276 IsEmpty]: Start isEmpty. Operand 111499 states and 464543 transitions. [2019-12-27 18:48:48,929 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-27 18:48:48,929 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:48,929 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:48:48,930 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 18:48:48,930 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:48,930 INFO L82 PathProgramCache]: Analyzing trace with hash -1509262706, now seen corresponding path program 1 times [2019-12-27 18:48:48,930 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:48,931 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1194665612] [2019-12-27 18:48:48,931 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:48,955 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:48,992 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 18:48:48,993 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1194665612] [2019-12-27 18:48:48,993 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:48,993 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:48:48,994 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [718995224] [2019-12-27 18:48:48,994 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:48,995 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:48,996 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 14 states and 13 transitions. [2019-12-27 18:48:48,996 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:48,996 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:48:48,997 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:48:48,997 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:48,997 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:48:48,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:48:48,997 INFO L87 Difference]: Start difference. First operand 111499 states and 464543 transitions. Second operand 3 states. [2019-12-27 18:48:52,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:52,408 INFO L93 Difference]: Finished difference Result 27724 states and 93399 transitions. [2019-12-27 18:48:52,409 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:48:52,409 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-27 18:48:52,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:52,456 INFO L225 Difference]: With dead ends: 27724 [2019-12-27 18:48:52,456 INFO L226 Difference]: Without dead ends: 27724 [2019-12-27 18:48:52,456 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:48:52,617 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27724 states. [2019-12-27 18:48:52,916 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27724 to 27724. [2019-12-27 18:48:52,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27724 states. [2019-12-27 18:48:52,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27724 states to 27724 states and 93399 transitions. [2019-12-27 18:48:52,972 INFO L78 Accepts]: Start accepts. Automaton has 27724 states and 93399 transitions. Word has length 13 [2019-12-27 18:48:52,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:52,973 INFO L462 AbstractCegarLoop]: Abstraction has 27724 states and 93399 transitions. [2019-12-27 18:48:52,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:48:52,973 INFO L276 IsEmpty]: Start isEmpty. Operand 27724 states and 93399 transitions. [2019-12-27 18:48:52,975 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-12-27 18:48:52,975 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:52,975 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:48:52,975 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 18:48:52,976 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:52,976 INFO L82 PathProgramCache]: Analyzing trace with hash 2053226586, now seen corresponding path program 1 times [2019-12-27 18:48:52,976 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:52,977 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127197712] [2019-12-27 18:48:52,977 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:52,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:53,060 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 18:48:53,060 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127197712] [2019-12-27 18:48:53,060 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:53,061 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:48:53,061 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [282919493] [2019-12-27 18:48:53,061 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:53,063 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:53,066 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 33 states and 50 transitions. [2019-12-27 18:48:53,067 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:53,135 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:48:53,135 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:48:53,136 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:53,136 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:48:53,136 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:48:53,136 INFO L87 Difference]: Start difference. First operand 27724 states and 93399 transitions. Second operand 7 states. [2019-12-27 18:48:53,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:53,758 INFO L93 Difference]: Finished difference Result 40807 states and 134933 transitions. [2019-12-27 18:48:53,758 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-12-27 18:48:53,759 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-12-27 18:48:53,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:53,828 INFO L225 Difference]: With dead ends: 40807 [2019-12-27 18:48:53,828 INFO L226 Difference]: Without dead ends: 40789 [2019-12-27 18:48:53,828 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 18:48:54,009 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40789 states. [2019-12-27 18:48:54,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40789 to 32055. [2019-12-27 18:48:54,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32055 states. [2019-12-27 18:48:54,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32055 states to 32055 states and 107275 transitions. [2019-12-27 18:48:54,715 INFO L78 Accepts]: Start accepts. Automaton has 32055 states and 107275 transitions. Word has length 14 [2019-12-27 18:48:54,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:54,716 INFO L462 AbstractCegarLoop]: Abstraction has 32055 states and 107275 transitions. [2019-12-27 18:48:54,716 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:48:54,716 INFO L276 IsEmpty]: Start isEmpty. Operand 32055 states and 107275 transitions. [2019-12-27 18:48:54,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:48:54,726 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:54,726 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 18:48:54,726 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 18:48:54,727 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:54,727 INFO L82 PathProgramCache]: Analyzing trace with hash 112714396, now seen corresponding path program 1 times [2019-12-27 18:48:54,727 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:54,728 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2140987436] [2019-12-27 18:48:54,728 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:54,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:54,893 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 18:48:54,894 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2140987436] [2019-12-27 18:48:54,894 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:54,894 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:48:54,895 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [758896299] [2019-12-27 18:48:54,895 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:54,898 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:54,909 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 61 states and 98 transitions. [2019-12-27 18:48:54,910 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:54,968 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:48:54,970 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:48:54,970 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:54,970 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:48:54,970 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:48:54,971 INFO L87 Difference]: Start difference. First operand 32055 states and 107275 transitions. Second operand 8 states. [2019-12-27 18:48:56,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:48:56,581 INFO L93 Difference]: Finished difference Result 100259 states and 328974 transitions. [2019-12-27 18:48:56,586 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 18:48:56,586 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-27 18:48:56,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:48:57,156 INFO L225 Difference]: With dead ends: 100259 [2019-12-27 18:48:57,157 INFO L226 Difference]: Without dead ends: 100206 [2019-12-27 18:48:57,157 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-12-27 18:48:57,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100206 states. [2019-12-27 18:48:58,182 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100206 to 46973. [2019-12-27 18:48:58,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46973 states. [2019-12-27 18:48:58,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46973 states to 46973 states and 156335 transitions. [2019-12-27 18:48:58,863 INFO L78 Accepts]: Start accepts. Automaton has 46973 states and 156335 transitions. Word has length 22 [2019-12-27 18:48:58,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:48:58,864 INFO L462 AbstractCegarLoop]: Abstraction has 46973 states and 156335 transitions. [2019-12-27 18:48:58,864 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:48:58,864 INFO L276 IsEmpty]: Start isEmpty. Operand 46973 states and 156335 transitions. [2019-12-27 18:48:58,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2019-12-27 18:48:58,878 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:48:58,878 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 18:48:58,878 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 18:48:58,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:48:58,879 INFO L82 PathProgramCache]: Analyzing trace with hash -350555304, now seen corresponding path program 2 times [2019-12-27 18:48:58,879 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:48:58,880 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1033464206] [2019-12-27 18:48:58,880 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:48:58,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:48:58,966 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 18:48:58,967 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1033464206] [2019-12-27 18:48:58,967 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:48:58,967 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:48:58,968 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [510879290] [2019-12-27 18:48:58,968 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:48:58,971 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:48:58,977 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 31 states and 38 transitions. [2019-12-27 18:48:58,977 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:48:58,989 INFO L319 QuantifierPusher]: Applying distributivity, recursing on 2 terms [2019-12-27 18:48:59,037 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 3 times. [2019-12-27 18:48:59,038 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:48:59,038 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:48:59,038 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:48:59,039 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:48:59,039 INFO L87 Difference]: Start difference. First operand 46973 states and 156335 transitions. Second operand 8 states. [2019-12-27 18:49:00,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:49:00,221 INFO L93 Difference]: Finished difference Result 71463 states and 232688 transitions. [2019-12-27 18:49:00,222 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2019-12-27 18:49:00,222 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 22 [2019-12-27 18:49:00,222 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:49:00,356 INFO L225 Difference]: With dead ends: 71463 [2019-12-27 18:49:00,356 INFO L226 Difference]: Without dead ends: 71441 [2019-12-27 18:49:00,357 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 30 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2019-12-27 18:49:00,627 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71441 states. [2019-12-27 18:49:01,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71441 to 42319. [2019-12-27 18:49:01,576 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42319 states. [2019-12-27 18:49:01,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42319 states to 42319 states and 141589 transitions. [2019-12-27 18:49:01,666 INFO L78 Accepts]: Start accepts. Automaton has 42319 states and 141589 transitions. Word has length 22 [2019-12-27 18:49:01,666 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:49:01,666 INFO L462 AbstractCegarLoop]: Abstraction has 42319 states and 141589 transitions. [2019-12-27 18:49:01,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:49:01,666 INFO L276 IsEmpty]: Start isEmpty. Operand 42319 states and 141589 transitions. [2019-12-27 18:49:01,681 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-27 18:49:01,681 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:49:01,681 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:49:01,681 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 18:49:01,682 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:49:01,682 INFO L82 PathProgramCache]: Analyzing trace with hash -1691433742, now seen corresponding path program 1 times [2019-12-27 18:49:01,682 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:49:01,682 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [268236360] [2019-12-27 18:49:01,683 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:49:01,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:49:01,748 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 18:49:01,748 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [268236360] [2019-12-27 18:49:01,748 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:49:01,749 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:49:01,750 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [2122929137] [2019-12-27 18:49:01,750 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:49:01,753 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:49:01,758 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 26 states and 25 transitions. [2019-12-27 18:49:01,759 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:49:01,759 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:49:01,759 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-27 18:49:01,759 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:49:01,759 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-27 18:49:01,760 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:49:01,760 INFO L87 Difference]: Start difference. First operand 42319 states and 141589 transitions. Second operand 4 states. [2019-12-27 18:49:01,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:49:01,844 INFO L93 Difference]: Finished difference Result 17250 states and 53903 transitions. [2019-12-27 18:49:01,844 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-27 18:49:01,844 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-27 18:49:01,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:49:01,879 INFO L225 Difference]: With dead ends: 17250 [2019-12-27 18:49:01,879 INFO L226 Difference]: Without dead ends: 17250 [2019-12-27 18:49:01,879 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-27 18:49:01,955 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17250 states. [2019-12-27 18:49:02,112 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17250 to 16816. [2019-12-27 18:49:02,113 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16816 states. [2019-12-27 18:49:02,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16816 states to 16816 states and 52590 transitions. [2019-12-27 18:49:02,143 INFO L78 Accepts]: Start accepts. Automaton has 16816 states and 52590 transitions. Word has length 25 [2019-12-27 18:49:02,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:49:02,143 INFO L462 AbstractCegarLoop]: Abstraction has 16816 states and 52590 transitions. [2019-12-27 18:49:02,143 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-27 18:49:02,143 INFO L276 IsEmpty]: Start isEmpty. Operand 16816 states and 52590 transitions. [2019-12-27 18:49:02,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2019-12-27 18:49:02,166 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:49:02,166 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-27 18:49:02,166 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 18:49:02,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:49:02,167 INFO L82 PathProgramCache]: Analyzing trace with hash -1334742722, now seen corresponding path program 1 times [2019-12-27 18:49:02,167 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:49:02,167 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604853945] [2019-12-27 18:49:02,167 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:49:02,191 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:49:02,229 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 18:49:02,229 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604853945] [2019-12-27 18:49:02,230 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:49:02,230 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:49:02,230 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1155387540] [2019-12-27 18:49:02,230 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:49:02,237 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:49:02,262 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 73 states and 100 transitions. [2019-12-27 18:49:02,262 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:49:02,263 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:49:02,263 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:49:02,264 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:49:02,264 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:49:02,264 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:49:02,264 INFO L87 Difference]: Start difference. First operand 16816 states and 52590 transitions. Second operand 3 states. [2019-12-27 18:49:02,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:49:02,366 INFO L93 Difference]: Finished difference Result 30574 states and 95374 transitions. [2019-12-27 18:49:02,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:49:02,367 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 39 [2019-12-27 18:49:02,367 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:49:02,391 INFO L225 Difference]: With dead ends: 30574 [2019-12-27 18:49:02,392 INFO L226 Difference]: Without dead ends: 16877 [2019-12-27 18:49:02,392 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:49:02,452 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16877 states. [2019-12-27 18:49:02,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16877 to 16618. [2019-12-27 18:49:02,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16618 states. [2019-12-27 18:49:02,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16618 states to 16618 states and 50842 transitions. [2019-12-27 18:49:02,659 INFO L78 Accepts]: Start accepts. Automaton has 16618 states and 50842 transitions. Word has length 39 [2019-12-27 18:49:02,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:49:02,660 INFO L462 AbstractCegarLoop]: Abstraction has 16618 states and 50842 transitions. [2019-12-27 18:49:02,660 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:49:02,660 INFO L276 IsEmpty]: Start isEmpty. Operand 16618 states and 50842 transitions. [2019-12-27 18:49:02,792 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2019-12-27 18:49:02,792 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:49:02,793 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 18:49:02,793 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 18:49:02,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:49:02,793 INFO L82 PathProgramCache]: Analyzing trace with hash -1169825091, now seen corresponding path program 1 times [2019-12-27 18:49:02,794 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:49:02,794 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902087219] [2019-12-27 18:49:02,794 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:49:02,812 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:49:02,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 18:49:02,861 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902087219] [2019-12-27 18:49:02,861 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:49:02,861 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-27 18:49:02,861 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1811819629] [2019-12-27 18:49:02,861 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:49:02,870 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:49:02,926 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 109 states and 176 transitions. [2019-12-27 18:49:02,926 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:49:02,939 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:49:02,939 INFO L442 AbstractCegarLoop]: Interpolant automaton has 6 states [2019-12-27 18:49:02,940 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:49:02,940 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2019-12-27 18:49:02,940 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2019-12-27 18:49:02,940 INFO L87 Difference]: Start difference. First operand 16618 states and 50842 transitions. Second operand 6 states. [2019-12-27 18:49:03,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:49:03,091 INFO L93 Difference]: Finished difference Result 15189 states and 47148 transitions. [2019-12-27 18:49:03,092 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-27 18:49:03,092 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2019-12-27 18:49:03,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:49:03,111 INFO L225 Difference]: With dead ends: 15189 [2019-12-27 18:49:03,111 INFO L226 Difference]: Without dead ends: 12770 [2019-12-27 18:49:03,111 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=20, Invalid=22, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:49:03,163 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 12770 states. [2019-12-27 18:49:03,276 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 12770 to 11833. [2019-12-27 18:49:03,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11833 states. [2019-12-27 18:49:03,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11833 states to 11833 states and 37636 transitions. [2019-12-27 18:49:03,298 INFO L78 Accepts]: Start accepts. Automaton has 11833 states and 37636 transitions. Word has length 40 [2019-12-27 18:49:03,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:49:03,299 INFO L462 AbstractCegarLoop]: Abstraction has 11833 states and 37636 transitions. [2019-12-27 18:49:03,299 INFO L463 AbstractCegarLoop]: Interpolant automaton has 6 states. [2019-12-27 18:49:03,299 INFO L276 IsEmpty]: Start isEmpty. Operand 11833 states and 37636 transitions. [2019-12-27 18:49:03,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:49:03,318 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:49:03,318 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] [2019-12-27 18:49:03,318 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 18:49:03,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:49:03,318 INFO L82 PathProgramCache]: Analyzing trace with hash 612716425, now seen corresponding path program 1 times [2019-12-27 18:49:03,319 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:49:03,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1364017051] [2019-12-27 18:49:03,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:49:03,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:49:03,384 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 18:49:03,384 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1364017051] [2019-12-27 18:49:03,384 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:49:03,385 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:49:03,385 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [19237782] [2019-12-27 18:49:03,385 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:49:03,400 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:49:03,589 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 200 states and 380 transitions. [2019-12-27 18:49:03,589 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:49:03,605 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 4 times. [2019-12-27 18:49:03,606 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:49:03,606 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:49:03,606 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:49:03,606 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:49:03,607 INFO L87 Difference]: Start difference. First operand 11833 states and 37636 transitions. Second operand 3 states. [2019-12-27 18:49:03,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:49:03,708 INFO L93 Difference]: Finished difference Result 14492 states and 44945 transitions. [2019-12-27 18:49:03,709 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:49:03,709 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 18:49:03,709 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:49:03,736 INFO L225 Difference]: With dead ends: 14492 [2019-12-27 18:49:03,736 INFO L226 Difference]: Without dead ends: 14492 [2019-12-27 18:49:03,737 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 SyntacticMatches, 2 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 18:49:03,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 14492 states. [2019-12-27 18:49:03,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 14492 to 10563. [2019-12-27 18:49:03,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10563 states. [2019-12-27 18:49:03,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10563 states to 10563 states and 32977 transitions. [2019-12-27 18:49:03,957 INFO L78 Accepts]: Start accepts. Automaton has 10563 states and 32977 transitions. Word has length 54 [2019-12-27 18:49:03,957 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:49:03,957 INFO L462 AbstractCegarLoop]: Abstraction has 10563 states and 32977 transitions. [2019-12-27 18:49:03,957 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:49:03,957 INFO L276 IsEmpty]: Start isEmpty. Operand 10563 states and 32977 transitions. [2019-12-27 18:49:03,969 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:49:03,969 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:49:03,969 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] [2019-12-27 18:49:03,970 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 18:49:03,970 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:49:03,970 INFO L82 PathProgramCache]: Analyzing trace with hash 2132180587, now seen corresponding path program 1 times [2019-12-27 18:49:03,971 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:49:03,971 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [784745612] [2019-12-27 18:49:03,971 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:49:03,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:49:04,054 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 18:49:04,055 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [784745612] [2019-12-27 18:49:04,055 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:49:04,055 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-27 18:49:04,056 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [306307494] [2019-12-27 18:49:04,056 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:49:04,071 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:49:04,359 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 200 states and 380 transitions. [2019-12-27 18:49:04,359 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:49:04,451 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 18:49:04,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 8 states [2019-12-27 18:49:04,452 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:49:04,452 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2019-12-27 18:49:04,452 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2019-12-27 18:49:04,452 INFO L87 Difference]: Start difference. First operand 10563 states and 32977 transitions. Second operand 8 states. [2019-12-27 18:49:05,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:49:05,757 INFO L93 Difference]: Finished difference Result 69168 states and 212624 transitions. [2019-12-27 18:49:05,757 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2019-12-27 18:49:05,757 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 54 [2019-12-27 18:49:05,757 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:49:05,832 INFO L225 Difference]: With dead ends: 69168 [2019-12-27 18:49:05,832 INFO L226 Difference]: Without dead ends: 49095 [2019-12-27 18:49:05,832 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 13 SyntacticMatches, 8 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=234, Invalid=696, Unknown=0, NotChecked=0, Total=930 [2019-12-27 18:49:05,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49095 states. [2019-12-27 18:49:06,338 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49095 to 17341. [2019-12-27 18:49:06,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17341 states. [2019-12-27 18:49:06,371 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17341 states to 17341 states and 54573 transitions. [2019-12-27 18:49:06,371 INFO L78 Accepts]: Start accepts. Automaton has 17341 states and 54573 transitions. Word has length 54 [2019-12-27 18:49:06,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:49:06,371 INFO L462 AbstractCegarLoop]: Abstraction has 17341 states and 54573 transitions. [2019-12-27 18:49:06,372 INFO L463 AbstractCegarLoop]: Interpolant automaton has 8 states. [2019-12-27 18:49:06,372 INFO L276 IsEmpty]: Start isEmpty. Operand 17341 states and 54573 transitions. [2019-12-27 18:49:06,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:49:06,391 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:49:06,391 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] [2019-12-27 18:49:06,391 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 18:49:06,392 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:49:06,392 INFO L82 PathProgramCache]: Analyzing trace with hash -1318577837, now seen corresponding path program 2 times [2019-12-27 18:49:06,392 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:49:06,392 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942898450] [2019-12-27 18:49:06,392 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:49:06,410 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:49:06,480 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 18:49:06,480 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942898450] [2019-12-27 18:49:06,480 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:49:06,481 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:49:06,481 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1542089225] [2019-12-27 18:49:06,481 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:49:06,497 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:49:06,830 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 215 states and 381 transitions. [2019-12-27 18:49:06,830 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:49:06,841 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 2 times. [2019-12-27 18:49:06,842 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:49:06,842 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:49:06,842 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:49:06,842 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:49:06,842 INFO L87 Difference]: Start difference. First operand 17341 states and 54573 transitions. Second operand 7 states. [2019-12-27 18:49:07,287 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:49:07,287 INFO L93 Difference]: Finished difference Result 45504 states and 140069 transitions. [2019-12-27 18:49:07,287 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2019-12-27 18:49:07,288 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 18:49:07,288 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:49:07,339 INFO L225 Difference]: With dead ends: 45504 [2019-12-27 18:49:07,339 INFO L226 Difference]: Without dead ends: 33941 [2019-12-27 18:49:07,339 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=46, Invalid=136, Unknown=0, NotChecked=0, Total=182 [2019-12-27 18:49:07,439 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33941 states. [2019-12-27 18:49:07,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33941 to 20537. [2019-12-27 18:49:07,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20537 states. [2019-12-27 18:49:07,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20537 states to 20537 states and 64676 transitions. [2019-12-27 18:49:07,757 INFO L78 Accepts]: Start accepts. Automaton has 20537 states and 64676 transitions. Word has length 54 [2019-12-27 18:49:07,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:49:07,758 INFO L462 AbstractCegarLoop]: Abstraction has 20537 states and 64676 transitions. [2019-12-27 18:49:07,758 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:49:07,758 INFO L276 IsEmpty]: Start isEmpty. Operand 20537 states and 64676 transitions. [2019-12-27 18:49:07,783 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:49:07,783 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:49:07,784 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] [2019-12-27 18:49:07,784 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 18:49:07,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:49:07,784 INFO L82 PathProgramCache]: Analyzing trace with hash 1742027941, now seen corresponding path program 3 times [2019-12-27 18:49:07,785 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:49:07,785 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [80249276] [2019-12-27 18:49:07,785 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:49:07,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:49:07,899 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 18:49:07,899 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [80249276] [2019-12-27 18:49:07,899 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:49:07,900 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:49:07,900 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [1842424425] [2019-12-27 18:49:07,900 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:49:07,917 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:49:08,054 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 277 transitions. [2019-12-27 18:49:08,055 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:49:08,256 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 21 times. [2019-12-27 18:49:08,256 INFO L442 AbstractCegarLoop]: Interpolant automaton has 11 states [2019-12-27 18:49:08,256 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:49:08,257 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2019-12-27 18:49:08,257 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2019-12-27 18:49:08,257 INFO L87 Difference]: Start difference. First operand 20537 states and 64676 transitions. Second operand 11 states. [2019-12-27 18:49:09,008 WARN L192 SmtUtils]: Spent 147.00 ms on a formula simplification that was a NOOP. DAG size: 31 [2019-12-27 18:49:12,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:49:12,018 INFO L93 Difference]: Finished difference Result 102067 states and 310412 transitions. [2019-12-27 18:49:12,019 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2019-12-27 18:49:12,019 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 54 [2019-12-27 18:49:12,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:49:12,149 INFO L225 Difference]: With dead ends: 102067 [2019-12-27 18:49:12,149 INFO L226 Difference]: Without dead ends: 80441 [2019-12-27 18:49:12,150 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 20 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 574 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=433, Invalid=1729, Unknown=0, NotChecked=0, Total=2162 [2019-12-27 18:49:12,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80441 states. [2019-12-27 18:49:13,235 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80441 to 22410. [2019-12-27 18:49:13,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22410 states. [2019-12-27 18:49:13,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22410 states to 22410 states and 70911 transitions. [2019-12-27 18:49:13,282 INFO L78 Accepts]: Start accepts. Automaton has 22410 states and 70911 transitions. Word has length 54 [2019-12-27 18:49:13,282 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:49:13,282 INFO L462 AbstractCegarLoop]: Abstraction has 22410 states and 70911 transitions. [2019-12-27 18:49:13,282 INFO L463 AbstractCegarLoop]: Interpolant automaton has 11 states. [2019-12-27 18:49:13,282 INFO L276 IsEmpty]: Start isEmpty. Operand 22410 states and 70911 transitions. [2019-12-27 18:49:13,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:49:13,317 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:49:13,317 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] [2019-12-27 18:49:13,317 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 18:49:13,318 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:49:13,318 INFO L82 PathProgramCache]: Analyzing trace with hash 1733304659, now seen corresponding path program 1 times [2019-12-27 18:49:13,318 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:49:13,319 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665145086] [2019-12-27 18:49:13,319 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:49:13,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:49:13,365 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 18:49:13,365 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665145086] [2019-12-27 18:49:13,366 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:49:13,366 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-27 18:49:13,366 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [111555353] [2019-12-27 18:49:13,366 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:49:13,382 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:49:13,512 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 155 states and 254 transitions. [2019-12-27 18:49:13,512 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:49:13,516 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 1 times. [2019-12-27 18:49:13,516 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:49:13,518 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:49:13,518 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:49:13,518 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:49:13,518 INFO L87 Difference]: Start difference. First operand 22410 states and 70911 transitions. Second operand 3 states. [2019-12-27 18:49:13,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:49:13,614 INFO L93 Difference]: Finished difference Result 23994 states and 73760 transitions. [2019-12-27 18:49:13,614 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:49:13,614 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 18:49:13,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:49:13,647 INFO L225 Difference]: With dead ends: 23994 [2019-12-27 18:49:13,647 INFO L226 Difference]: Without dead ends: 23994 [2019-12-27 18:49:13,647 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 18:49:13,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 23994 states. [2019-12-27 18:49:13,947 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 23994 to 18165. [2019-12-27 18:49:13,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18165 states. [2019-12-27 18:49:13,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18165 states to 18165 states and 56191 transitions. [2019-12-27 18:49:13,981 INFO L78 Accepts]: Start accepts. Automaton has 18165 states and 56191 transitions. Word has length 54 [2019-12-27 18:49:13,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:49:13,982 INFO L462 AbstractCegarLoop]: Abstraction has 18165 states and 56191 transitions. [2019-12-27 18:49:13,982 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:49:13,982 INFO L276 IsEmpty]: Start isEmpty. Operand 18165 states and 56191 transitions. [2019-12-27 18:49:14,001 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:49:14,002 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:49:14,002 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] [2019-12-27 18:49:14,002 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 18:49:14,002 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:49:14,002 INFO L82 PathProgramCache]: Analyzing trace with hash 1573799015, now seen corresponding path program 4 times [2019-12-27 18:49:14,003 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:49:14,003 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [42526104] [2019-12-27 18:49:14,003 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:49:14,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:49:14,076 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 18:49:14,077 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [42526104] [2019-12-27 18:49:14,077 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:49:14,077 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-12-27 18:49:14,077 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [402716075] [2019-12-27 18:49:14,077 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:49:14,105 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:49:14,271 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 173 states and 315 transitions. [2019-12-27 18:49:14,271 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:49:14,337 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 18 times. [2019-12-27 18:49:14,338 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-12-27 18:49:14,338 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:49:14,338 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-12-27 18:49:14,338 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2019-12-27 18:49:14,338 INFO L87 Difference]: Start difference. First operand 18165 states and 56191 transitions. Second operand 7 states. [2019-12-27 18:49:14,955 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:49:14,955 INFO L93 Difference]: Finished difference Result 36930 states and 110528 transitions. [2019-12-27 18:49:14,955 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2019-12-27 18:49:14,955 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 54 [2019-12-27 18:49:14,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:49:15,025 INFO L225 Difference]: With dead ends: 36930 [2019-12-27 18:49:15,025 INFO L226 Difference]: Without dead ends: 31428 [2019-12-27 18:49:15,026 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 14 SyntacticMatches, 8 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=98, Unknown=0, NotChecked=0, Total=132 [2019-12-27 18:49:15,183 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31428 states. [2019-12-27 18:49:15,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31428 to 18321. [2019-12-27 18:49:15,498 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18321 states. [2019-12-27 18:49:15,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18321 states to 18321 states and 56621 transitions. [2019-12-27 18:49:15,533 INFO L78 Accepts]: Start accepts. Automaton has 18321 states and 56621 transitions. Word has length 54 [2019-12-27 18:49:15,533 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:49:15,533 INFO L462 AbstractCegarLoop]: Abstraction has 18321 states and 56621 transitions. [2019-12-27 18:49:15,533 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-12-27 18:49:15,533 INFO L276 IsEmpty]: Start isEmpty. Operand 18321 states and 56621 transitions. [2019-12-27 18:49:15,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2019-12-27 18:49:15,553 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:49:15,554 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] [2019-12-27 18:49:15,554 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 18:49:15,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:49:15,554 INFO L82 PathProgramCache]: Analyzing trace with hash 721174547, now seen corresponding path program 5 times [2019-12-27 18:49:15,554 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:49:15,555 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1095337065] [2019-12-27 18:49:15,555 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:49:15,574 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:49:15,642 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 18:49:15,643 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1095337065] [2019-12-27 18:49:15,645 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:49:15,645 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:49:15,645 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [778424705] [2019-12-27 18:49:15,646 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:49:15,664 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:49:15,897 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 238 states and 427 transitions. [2019-12-27 18:49:15,897 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:49:15,898 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:49:15,898 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:49:15,899 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:49:15,901 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:49:15,901 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:49:15,901 INFO L87 Difference]: Start difference. First operand 18321 states and 56621 transitions. Second operand 3 states. [2019-12-27 18:49:15,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:49:15,981 INFO L93 Difference]: Finished difference Result 15568 states and 47089 transitions. [2019-12-27 18:49:15,981 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:49:15,981 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 54 [2019-12-27 18:49:15,981 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:49:16,010 INFO L225 Difference]: With dead ends: 15568 [2019-12-27 18:49:16,011 INFO L226 Difference]: Without dead ends: 15568 [2019-12-27 18:49:16,011 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:49:16,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15568 states. [2019-12-27 18:49:16,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15568 to 15026. [2019-12-27 18:49:16,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15026 states. [2019-12-27 18:49:16,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15026 states to 15026 states and 45411 transitions. [2019-12-27 18:49:16,290 INFO L78 Accepts]: Start accepts. Automaton has 15026 states and 45411 transitions. Word has length 54 [2019-12-27 18:49:16,290 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:49:16,290 INFO L462 AbstractCegarLoop]: Abstraction has 15026 states and 45411 transitions. [2019-12-27 18:49:16,290 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:49:16,290 INFO L276 IsEmpty]: Start isEmpty. Operand 15026 states and 45411 transitions. [2019-12-27 18:49:16,304 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2019-12-27 18:49:16,305 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:49:16,305 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] [2019-12-27 18:49:16,305 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 18:49:16,305 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:49:16,305 INFO L82 PathProgramCache]: Analyzing trace with hash 262840158, now seen corresponding path program 1 times [2019-12-27 18:49:16,306 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:49:16,306 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [595153005] [2019-12-27 18:49:16,306 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:49:16,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-27 18:49:16,393 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-27 18:49:16,393 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [595153005] [2019-12-27 18:49:16,394 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-27 18:49:16,394 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-27 18:49:16,394 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleMcr [805439376] [2019-12-27 18:49:16,394 INFO L132 pAbStrategyModuleMcr]: Constructing automaton for MCR equivalence class. [2019-12-27 18:49:16,408 INFO L197 pAbStrategyModuleMcr]: Started intersection. [2019-12-27 18:49:16,761 INFO L208 pAbStrategyModuleMcr]: Finished intersection with 160 states and 258 transitions. [2019-12-27 18:49:16,761 INFO L219 pAbStrategyModuleMcr]: Constructing interpolant automaton by labelling MCR automaton. [2019-12-27 18:49:16,762 INFO L288 pAbStrategyModuleMcr]: Construction finished. Needed to calculate wp 0 times. [2019-12-27 18:49:16,762 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-27 18:49:16,762 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-27 18:49:16,763 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-27 18:49:16,763 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:49:16,763 INFO L87 Difference]: Start difference. First operand 15026 states and 45411 transitions. Second operand 3 states. [2019-12-27 18:49:16,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-27 18:49:16,841 INFO L93 Difference]: Finished difference Result 15026 states and 45409 transitions. [2019-12-27 18:49:16,841 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-27 18:49:16,842 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 55 [2019-12-27 18:49:16,842 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-27 18:49:16,871 INFO L225 Difference]: With dead ends: 15026 [2019-12-27 18:49:16,871 INFO L226 Difference]: Without dead ends: 15026 [2019-12-27 18:49:16,872 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-27 18:49:16,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15026 states. [2019-12-27 18:49:17,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15026 to 13497. [2019-12-27 18:49:17,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13497 states. [2019-12-27 18:49:17,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13497 states to 13497 states and 41162 transitions. [2019-12-27 18:49:17,120 INFO L78 Accepts]: Start accepts. Automaton has 13497 states and 41162 transitions. Word has length 55 [2019-12-27 18:49:17,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-27 18:49:17,121 INFO L462 AbstractCegarLoop]: Abstraction has 13497 states and 41162 transitions. [2019-12-27 18:49:17,121 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-27 18:49:17,121 INFO L276 IsEmpty]: Start isEmpty. Operand 13497 states and 41162 transitions. [2019-12-27 18:49:17,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 57 [2019-12-27 18:49:17,141 INFO L403 BasicCegarLoop]: Found error trace [2019-12-27 18:49:17,141 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 18:49:17,141 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 18:49:17,141 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-27 18:49:17,142 INFO L82 PathProgramCache]: Analyzing trace with hash -1377038518, now seen corresponding path program 1 times [2019-12-27 18:49:17,142 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-27 18:49:17,142 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [446862136] [2019-12-27 18:49:17,143 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-27 18:49:17,178 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:49:17,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-27 18:49:17,285 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-27 18:49:17,286 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-27 18:49:17,290 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [806] [806] ULTIMATE.startENTRY-->L816: Formula: (let ((.cse0 (store |v_#valid_78| 0 0))) (and (= 0 v_~x$read_delayed_var~0.base_6) (= 0 v_~x$read_delayed_var~0.offset_6) (= 0 v_~x~0_189) (= v_~main$tmp_guard0~0_19 0) (= |v_#valid_76| (store .cse0 |v_ULTIMATE.start_main_~#t2525~0.base_30| 1)) (= 0 v_~x$w_buff0~0_458) (= 0 v_~x$w_buff1~0_338) (= v_~main$tmp_guard1~0_59 0) (< 0 |v_#StackHeapBarrier_17|) (= v_~x$mem_tmp~0_36 0) (= 0 v_~__unbuffered_p0_EAX~0_70) (= 0 v_~weak$$choice0~0_29) (= 0 v_~x$read_delayed~0_6) (= v_~__unbuffered_cnt~0_127 0) (= 0 v_~x$r_buff1_thd2~0_267) (= 0 v_~x$w_buff0_used~0_920) (= 0 v_~x$w_buff1_used~0_659) (= 0 v_~x$r_buff0_thd2~0_309) (= 0 v_~x$r_buff1_thd3~0_288) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2525~0.base_30| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2525~0.base_30|) |v_ULTIMATE.start_main_~#t2525~0.offset_17| 0)) |v_#memory_int_21|) (= v_~x$r_buff1_thd1~0_390 0) (= (select .cse0 |v_ULTIMATE.start_main_~#t2525~0.base_30|) 0) (= v_~y~0_272 0) (= v_~weak$$choice2~0_165 0) (= 0 v_~x$r_buff0_thd3~0_149) (= v_~x$r_buff0_thd1~0_356 0) (= |v_#NULL.offset_5| 0) (= v_~z~0_94 0) (= v_~x$flush_delayed~0_66 0) (= (store |v_#length_24| |v_ULTIMATE.start_main_~#t2525~0.base_30| 4) |v_#length_23|) (= 0 |v_ULTIMATE.start_main_~#t2525~0.offset_17|) (< |v_#StackHeapBarrier_17| |v_ULTIMATE.start_main_~#t2525~0.base_30|) (= 0 |v_#NULL.base_5|) (= v_~x$r_buff0_thd0~0_158 0) (= v_~x$r_buff1_thd0~0_324 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_17|, #valid=|v_#valid_78|, #memory_int=|v_#memory_int_22|, #length=|v_#length_24|} OutVars{~x$w_buff0~0=v_~x$w_buff0~0_458, ULTIMATE.start_main_~#t2526~0.offset=|v_ULTIMATE.start_main_~#t2526~0.offset_18|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_356, ~x$flush_delayed~0=v_~x$flush_delayed~0_66, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_124|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_288, #NULL.offset=|v_#NULL.offset_5|, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_390, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_59, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_149, ~x$mem_tmp~0=v_~x$mem_tmp~0_36, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_44|, ULTIMATE.start_main_~#t2525~0.base=|v_ULTIMATE.start_main_~#t2525~0.base_30|, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_42|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_38|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_226|, ~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_70, ULTIMATE.start_main_~#t2527~0.base=|v_ULTIMATE.start_main_~#t2527~0.base_24|, #length=|v_#length_23|, ~y~0=v_~y~0_272, ~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_158, ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_18|, ULTIMATE.start_main_~#t2526~0.base=|v_ULTIMATE.start_main_~#t2526~0.base_24|, ~x$w_buff1~0=v_~x$w_buff1~0_338, ~x$w_buff1_used~0=v_~x$w_buff1_used~0_659, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_267, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_19, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_324, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_309, ULTIMATE.start_main_~#t2527~0.offset=|v_ULTIMATE.start_main_~#t2527~0.offset_18|, ~x$read_delayed_var~0.base=v_~x$read_delayed_var~0.base_6, #NULL.base=|v_#NULL.base_5|, ~x$w_buff0_used~0=v_~x$w_buff0_used~0_920, ~weak$$choice0~0=v_~weak$$choice0~0_29, ULTIMATE.start_main_~#t2525~0.offset=|v_ULTIMATE.start_main_~#t2525~0.offset_17|, #StackHeapBarrier=|v_#StackHeapBarrier_17|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ~x$read_delayed_var~0.offset=v_~x$read_delayed_var~0.offset_6, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_37|, #valid=|v_#valid_76|, #memory_int=|v_#memory_int_21|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_8|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_127, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_8|, ~z~0=v_~z~0_94, ~weak$$choice2~0=v_~weak$$choice2~0_165, ~x~0=v_~x~0_189, ~x$read_delayed~0=v_~x$read_delayed~0_6} AuxVars[] AssignedVars[~x$w_buff0~0, ULTIMATE.start_main_~#t2526~0.offset, ~x$r_buff0_thd1~0, ~x$flush_delayed~0, ULTIMATE.start_main_#t~ite46, ~x$r_buff1_thd3~0, #NULL.offset, ~x$r_buff1_thd1~0, ~main$tmp_guard1~0, ~x$r_buff0_thd3~0, ~x$mem_tmp~0, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_~#t2525~0.base, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite44, ~__unbuffered_p0_EAX~0, ULTIMATE.start_main_~#t2527~0.base, #length, ~y~0, ~x$r_buff0_thd0~0, ULTIMATE.start_main_#t~nondet40, ULTIMATE.start_main_~#t2526~0.base, ~x$w_buff1~0, ~x$w_buff1_used~0, ~x$r_buff1_thd2~0, ~main$tmp_guard0~0, ~x$r_buff1_thd0~0, ~x$r_buff0_thd2~0, ULTIMATE.start_main_~#t2527~0.offset, ~x$read_delayed_var~0.base, #NULL.base, ~x$w_buff0_used~0, ~weak$$choice0~0, ULTIMATE.start_main_~#t2525~0.offset, ULTIMATE.start_main_#t~ite41, ~x$read_delayed_var~0.offset, ULTIMATE.start_main_#res, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, ~__unbuffered_cnt~0, ULTIMATE.start_main_#t~nondet39, ~z~0, ~weak$$choice2~0, ~x~0, ~x$read_delayed~0] because there is no mapped edge [2019-12-27 18:49:17,291 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L816-1-->L818: Formula: (and (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2526~0.base_13| 4)) (not (= |v_ULTIMATE.start_main_~#t2526~0.base_13| 0)) (= (store |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2526~0.base_13| (store (select |v_#memory_int_16| |v_ULTIMATE.start_main_~#t2526~0.base_13|) |v_ULTIMATE.start_main_~#t2526~0.offset_11| 1)) |v_#memory_int_15|) (< |v_#StackHeapBarrier_11| |v_ULTIMATE.start_main_~#t2526~0.base_13|) (= |v_#valid_34| (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2526~0.base_13| 1)) (= 0 |v_ULTIMATE.start_main_~#t2526~0.offset_11|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2526~0.base_13|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_11|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_16|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2526~0.offset=|v_ULTIMATE.start_main_~#t2526~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_11|, ULTIMATE.start_main_~#t2526~0.base=|v_ULTIMATE.start_main_~#t2526~0.base_13|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_15|, ULTIMATE.start_main_#t~nondet38=|v_ULTIMATE.start_main_#t~nondet38_5|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2526~0.offset, ULTIMATE.start_main_~#t2526~0.base, #valid, #memory_int, ULTIMATE.start_main_#t~nondet38, #length] because there is no mapped edge [2019-12-27 18:49:17,292 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [672] [672] L5-->L773: Formula: (and (= v_~x$r_buff1_thd3~0_11 v_~x$r_buff0_thd3~0_15) (= 1 v_~x$r_buff0_thd2~0_17) (not (= 0 v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6)) (= 1 v_~y~0_6) (= v_~x$r_buff1_thd1~0_25 v_~x$r_buff0_thd1~0_43) (= v_~x$r_buff1_thd2~0_11 v_~x$r_buff0_thd2~0_18) (= v_~x$r_buff1_thd0~0_11 v_~x$r_buff0_thd0~0_15)) InVars {~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_18} OutVars{~x$r_buff0_thd0~0=v_~x$r_buff0_thd0~0_15, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_43, P1Thread1of1ForFork0___VERIFIER_assert_~expression=v_P1Thread1of1ForFork0___VERIFIER_assert_~expression_6, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_11, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_11, ~x$r_buff1_thd1~0=v_~x$r_buff1_thd1~0_25, ~x$r_buff0_thd3~0=v_~x$r_buff0_thd3~0_15, ~y~0=v_~y~0_6, ~x$r_buff0_thd2~0=v_~x$r_buff0_thd2~0_17, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_11} AuxVars[] AssignedVars[~x$r_buff1_thd3~0, ~x$r_buff1_thd2~0, ~x$r_buff1_thd1~0, ~y~0, ~x$r_buff0_thd2~0, ~x$r_buff1_thd0~0] because there is no mapped edge [2019-12-27 18:49:17,293 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [765] [765] L818-1-->L820: Formula: (and (not (= |v_ULTIMATE.start_main_~#t2527~0.base_13| 0)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2527~0.base_13| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2527~0.base_13|) |v_ULTIMATE.start_main_~#t2527~0.offset_11| 2)) |v_#memory_int_13|) (< |v_#StackHeapBarrier_10| |v_ULTIMATE.start_main_~#t2527~0.base_13|) (= (store |v_#valid_33| |v_ULTIMATE.start_main_~#t2527~0.base_13| 1) |v_#valid_32|) (= 0 |v_ULTIMATE.start_main_~#t2527~0.offset_11|) (= 0 (select |v_#valid_33| |v_ULTIMATE.start_main_~#t2527~0.base_13|)) (= (store |v_#length_16| |v_ULTIMATE.start_main_~#t2527~0.base_13| 4) |v_#length_15|)) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_33|, #memory_int=|v_#memory_int_14|, #length=|v_#length_16|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_10|, #valid=|v_#valid_32|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2527~0.base=|v_ULTIMATE.start_main_~#t2527~0.base_13|, #length=|v_#length_15|, ULTIMATE.start_main_#t~nondet39=|v_ULTIMATE.start_main_#t~nondet39_5|, ULTIMATE.start_main_~#t2527~0.offset=|v_ULTIMATE.start_main_~#t2527~0.offset_11|} AuxVars[] AssignedVars[#valid, #memory_int, ULTIMATE.start_main_~#t2527~0.base, #length, ULTIMATE.start_main_#t~nondet39, ULTIMATE.start_main_~#t2527~0.offset] because there is no mapped edge [2019-12-27 18:49:17,296 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [741] [741] L793-2-->L793-4: Formula: (let ((.cse0 (= (mod ~x$w_buff1_used~0_In-247582414 256) 0)) (.cse1 (= (mod ~x$r_buff1_thd3~0_In-247582414 256) 0))) (or (and (= |P2Thread1of1ForFork1_#t~ite32_Out-247582414| ~x~0_In-247582414) (or .cse0 .cse1)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork1_#t~ite32_Out-247582414| ~x$w_buff1~0_In-247582414)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In-247582414, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-247582414, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-247582414, ~x~0=~x~0_In-247582414} OutVars{P2Thread1of1ForFork1_#t~ite32=|P2Thread1of1ForFork1_#t~ite32_Out-247582414|, ~x$w_buff1~0=~x$w_buff1~0_In-247582414, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-247582414, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In-247582414, ~x~0=~x~0_In-247582414} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32] because there is no mapped edge [2019-12-27 18:49:17,300 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [718] [718] L793-4-->L794: Formula: (= v_~x~0_67 |v_P2Thread1of1ForFork1_#t~ite32_24|) InVars {P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_24|} OutVars{P2Thread1of1ForFork1_#t~ite32=|v_P2Thread1of1ForFork1_#t~ite32_23|, P2Thread1of1ForFork1_#t~ite33=|v_P2Thread1of1ForFork1_#t~ite33_39|, ~x~0=v_~x~0_67} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite32, P2Thread1of1ForFork1_#t~ite33, ~x~0] because there is no mapped edge [2019-12-27 18:49:17,301 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [753] [753] L794-->L794-2: Formula: (let ((.cse1 (= (mod ~x$r_buff0_thd3~0_In680347267 256) 0)) (.cse0 (= 0 (mod ~x$w_buff0_used~0_In680347267 256)))) (or (and (= |P2Thread1of1ForFork1_#t~ite34_Out680347267| 0) (not .cse0) (not .cse1)) (and (= ~x$w_buff0_used~0_In680347267 |P2Thread1of1ForFork1_#t~ite34_Out680347267|) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In680347267, ~x$w_buff0_used~0=~x$w_buff0_used~0_In680347267} OutVars{P2Thread1of1ForFork1_#t~ite34=|P2Thread1of1ForFork1_#t~ite34_Out680347267|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In680347267, ~x$w_buff0_used~0=~x$w_buff0_used~0_In680347267} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite34] because there is no mapped edge [2019-12-27 18:49:17,302 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [740] [740] L795-->L795-2: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff1_thd3~0_In932371876 256))) (.cse1 (= 0 (mod ~x$w_buff1_used~0_In932371876 256))) (.cse2 (= 0 (mod ~x$r_buff0_thd3~0_In932371876 256))) (.cse3 (= (mod ~x$w_buff0_used~0_In932371876 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P2Thread1of1ForFork1_#t~ite35_Out932371876| 0)) (and (or .cse0 .cse1) (= ~x$w_buff1_used~0_In932371876 |P2Thread1of1ForFork1_#t~ite35_Out932371876|) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In932371876, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In932371876, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In932371876, ~x$w_buff0_used~0=~x$w_buff0_used~0_In932371876} OutVars{P2Thread1of1ForFork1_#t~ite35=|P2Thread1of1ForFork1_#t~ite35_Out932371876|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In932371876, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In932371876, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In932371876, ~x$w_buff0_used~0=~x$w_buff0_used~0_In932371876} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite35] because there is no mapped edge [2019-12-27 18:49:17,303 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [754] [754] L796-->L796-2: Formula: (let ((.cse1 (= 0 (mod ~x$w_buff0_used~0_In2080582026 256))) (.cse0 (= (mod ~x$r_buff0_thd3~0_In2080582026 256) 0))) (or (and (not .cse0) (= |P2Thread1of1ForFork1_#t~ite36_Out2080582026| 0) (not .cse1)) (and (= |P2Thread1of1ForFork1_#t~ite36_Out2080582026| ~x$r_buff0_thd3~0_In2080582026) (or .cse1 .cse0)))) InVars {~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2080582026, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2080582026} OutVars{P2Thread1of1ForFork1_#t~ite36=|P2Thread1of1ForFork1_#t~ite36_Out2080582026|, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In2080582026, ~x$w_buff0_used~0=~x$w_buff0_used~0_In2080582026} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite36] because there is no mapped edge [2019-12-27 18:49:17,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [746] [746] L797-->L797-2: Formula: (let ((.cse1 (= (mod ~x$w_buff1_used~0_In545707159 256) 0)) (.cse0 (= (mod ~x$r_buff1_thd3~0_In545707159 256) 0)) (.cse3 (= 0 (mod ~x$r_buff0_thd3~0_In545707159 256))) (.cse2 (= (mod ~x$w_buff0_used~0_In545707159 256) 0))) (or (and (or .cse0 .cse1) (= ~x$r_buff1_thd3~0_In545707159 |P2Thread1of1ForFork1_#t~ite37_Out545707159|) (or .cse2 .cse3)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse3) (not .cse2))) (= 0 |P2Thread1of1ForFork1_#t~ite37_Out545707159|)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In545707159, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In545707159, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In545707159, ~x$w_buff0_used~0=~x$w_buff0_used~0_In545707159} OutVars{P2Thread1of1ForFork1_#t~ite37=|P2Thread1of1ForFork1_#t~ite37_Out545707159|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In545707159, ~x$r_buff1_thd3~0=~x$r_buff1_thd3~0_In545707159, ~x$r_buff0_thd3~0=~x$r_buff0_thd3~0_In545707159, ~x$w_buff0_used~0=~x$w_buff0_used~0_In545707159} AuxVars[] AssignedVars[P2Thread1of1ForFork1_#t~ite37] because there is no mapped edge [2019-12-27 18:49:17,304 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L797-2-->P2EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= 0 |v_P2Thread1of1ForFork1_#res.offset_5|) (= 0 |v_P2Thread1of1ForFork1_#res.base_5|) (= v_~x$r_buff1_thd3~0_57 |v_P2Thread1of1ForFork1_#t~ite37_36|)) InVars {P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_36|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61} OutVars{P2Thread1of1ForFork1_#t~ite37=|v_P2Thread1of1ForFork1_#t~ite37_35|, P2Thread1of1ForFork1_#res.base=|v_P2Thread1of1ForFork1_#res.base_5|, ~x$r_buff1_thd3~0=v_~x$r_buff1_thd3~0_57, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, 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 18:49:17,306 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [787] [787] L739-->L739-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In890526651 256) 0))) (or (and .cse0 (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In890526651 256)))) (or (= 0 (mod ~x$w_buff0_used~0_In890526651 256)) (and (= 0 (mod ~x$w_buff1_used~0_In890526651 256)) .cse1) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In890526651 256))))) (= |P0Thread1of1ForFork2_#t~ite11_Out890526651| ~x$w_buff1~0_In890526651) (= |P0Thread1of1ForFork2_#t~ite12_Out890526651| |P0Thread1of1ForFork2_#t~ite11_Out890526651|)) (and (not .cse0) (= |P0Thread1of1ForFork2_#t~ite11_In890526651| |P0Thread1of1ForFork2_#t~ite11_Out890526651|) (= |P0Thread1of1ForFork2_#t~ite12_Out890526651| ~x$w_buff1~0_In890526651)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In890526651, ~x$w_buff1~0=~x$w_buff1~0_In890526651, ~x$w_buff1_used~0=~x$w_buff1_used~0_In890526651, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In890526651, ~weak$$choice2~0=~weak$$choice2~0_In890526651, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_In890526651|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In890526651} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In890526651, ~x$w_buff1~0=~x$w_buff1~0_In890526651, ~x$w_buff1_used~0=~x$w_buff1_used~0_In890526651, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In890526651, ~weak$$choice2~0=~weak$$choice2~0_In890526651, P0Thread1of1ForFork2_#t~ite12=|P0Thread1of1ForFork2_#t~ite12_Out890526651|, P0Thread1of1ForFork2_#t~ite11=|P0Thread1of1ForFork2_#t~ite11_Out890526651|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In890526651} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite12, P0Thread1of1ForFork2_#t~ite11] because there is no mapped edge [2019-12-27 18:49:17,307 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [786] [786] L740-->L740-8: Formula: (let ((.cse1 (= (mod ~weak$$choice2~0_In-1166810134 256) 0))) (or (and (let ((.cse0 (= 0 (mod ~x$r_buff0_thd1~0_In-1166810134 256)))) (or (and .cse0 (= 0 (mod ~x$w_buff1_used~0_In-1166810134 256))) (and .cse0 (= 0 (mod ~x$r_buff1_thd1~0_In-1166810134 256))) (= 0 (mod ~x$w_buff0_used~0_In-1166810134 256)))) (= ~x$w_buff0_used~0_In-1166810134 |P0Thread1of1ForFork2_#t~ite14_Out-1166810134|) .cse1 (= |P0Thread1of1ForFork2_#t~ite15_Out-1166810134| |P0Thread1of1ForFork2_#t~ite14_Out-1166810134|)) (and (= ~x$w_buff0_used~0_In-1166810134 |P0Thread1of1ForFork2_#t~ite15_Out-1166810134|) (= |P0Thread1of1ForFork2_#t~ite14_In-1166810134| |P0Thread1of1ForFork2_#t~ite14_Out-1166810134|) (not .cse1)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1166810134, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1166810134, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1166810134, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_In-1166810134|, ~weak$$choice2~0=~weak$$choice2~0_In-1166810134, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1166810134} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-1166810134, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1166810134, P0Thread1of1ForFork2_#t~ite15=|P0Thread1of1ForFork2_#t~ite15_Out-1166810134|, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-1166810134, P0Thread1of1ForFork2_#t~ite14=|P0Thread1of1ForFork2_#t~ite14_Out-1166810134|, ~weak$$choice2~0=~weak$$choice2~0_In-1166810134, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1166810134} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite15, P0Thread1of1ForFork2_#t~ite14] because there is no mapped edge [2019-12-27 18:49:17,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [712] [712] L742-->L743: Formula: (and (= v_~x$r_buff0_thd1~0_88 v_~x$r_buff0_thd1~0_87) (not (= 0 (mod v_~weak$$choice2~0_29 256)))) InVars {~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_88, ~weak$$choice2~0=v_~weak$$choice2~0_29} OutVars{P0Thread1of1ForFork2_#t~ite20=|v_P0Thread1of1ForFork2_#t~ite20_11|, ~x$r_buff0_thd1~0=v_~x$r_buff0_thd1~0_87, P0Thread1of1ForFork2_#t~ite19=|v_P0Thread1of1ForFork2_#t~ite19_8|, ~weak$$choice2~0=v_~weak$$choice2~0_29, P0Thread1of1ForFork2_#t~ite21=|v_P0Thread1of1ForFork2_#t~ite21_9|} 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 18:49:17,310 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L743-->L743-8: Formula: (let ((.cse0 (= (mod ~weak$$choice2~0_In-619834098 256) 0))) (or (and (= |P0Thread1of1ForFork2_#t~ite23_In-619834098| |P0Thread1of1ForFork2_#t~ite23_Out-619834098|) (not .cse0) (= |P0Thread1of1ForFork2_#t~ite24_Out-619834098| ~x$r_buff1_thd1~0_In-619834098)) (and (let ((.cse1 (= 0 (mod ~x$r_buff0_thd1~0_In-619834098 256)))) (or (and (= (mod ~x$w_buff1_used~0_In-619834098 256) 0) .cse1) (and .cse1 (= 0 (mod ~x$r_buff1_thd1~0_In-619834098 256))) (= 0 (mod ~x$w_buff0_used~0_In-619834098 256)))) .cse0 (= |P0Thread1of1ForFork2_#t~ite23_Out-619834098| |P0Thread1of1ForFork2_#t~ite24_Out-619834098|) (= |P0Thread1of1ForFork2_#t~ite23_Out-619834098| ~x$r_buff1_thd1~0_In-619834098)))) InVars {~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-619834098, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-619834098, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-619834098, ~weak$$choice2~0=~weak$$choice2~0_In-619834098, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_In-619834098|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-619834098} OutVars{~x$r_buff0_thd1~0=~x$r_buff0_thd1~0_In-619834098, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-619834098, ~x$r_buff1_thd1~0=~x$r_buff1_thd1~0_In-619834098, P0Thread1of1ForFork2_#t~ite24=|P0Thread1of1ForFork2_#t~ite24_Out-619834098|, ~weak$$choice2~0=~weak$$choice2~0_In-619834098, P0Thread1of1ForFork2_#t~ite23=|P0Thread1of1ForFork2_#t~ite23_Out-619834098|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-619834098} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite24, P0Thread1of1ForFork2_#t~ite23] because there is no mapped edge [2019-12-27 18:49:17,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [680] [680] L745-->L753: Formula: (and (= 0 v_~x$flush_delayed~0_8) (= v_~x$mem_tmp~0_5 v_~x~0_24) (not (= (mod v_~x$flush_delayed~0_9 256) 0)) (= (+ v_~__unbuffered_cnt~0_20 1) v_~__unbuffered_cnt~0_19)) InVars {~x$flush_delayed~0=v_~x$flush_delayed~0_9, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_20, ~x$mem_tmp~0=v_~x$mem_tmp~0_5} OutVars{P0Thread1of1ForFork2_#t~ite25=|v_P0Thread1of1ForFork2_#t~ite25_11|, ~x$flush_delayed~0=v_~x$flush_delayed~0_8, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_19, ~x$mem_tmp~0=v_~x$mem_tmp~0_5, ~x~0=v_~x~0_24} AuxVars[] AssignedVars[P0Thread1of1ForFork2_#t~ite25, ~x$flush_delayed~0, ~__unbuffered_cnt~0, ~x~0] because there is no mapped edge [2019-12-27 18:49:17,312 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [747] [747] L774-->L774-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In-452837322 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In-452837322 256) 0))) (or (and (or .cse0 .cse1) (= ~x$w_buff0_used~0_In-452837322 |P1Thread1of1ForFork0_#t~ite28_Out-452837322|)) (and (not .cse0) (not .cse1) (= 0 |P1Thread1of1ForFork0_#t~ite28_Out-452837322|)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-452837322, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-452837322} OutVars{~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-452837322, P1Thread1of1ForFork0_#t~ite28=|P1Thread1of1ForFork0_#t~ite28_Out-452837322|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-452837322} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite28] because there is no mapped edge [2019-12-27 18:49:17,313 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [735] [735] L775-->L775-2: Formula: (let ((.cse2 (= (mod ~x$r_buff0_thd2~0_In1435266712 256) 0)) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In1435266712 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In1435266712 256))) (.cse1 (= (mod ~x$r_buff1_thd2~0_In1435266712 256) 0))) (or (and (= ~x$w_buff1_used~0_In1435266712 |P1Thread1of1ForFork0_#t~ite29_Out1435266712|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |P1Thread1of1ForFork0_#t~ite29_Out1435266712|) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1435266712, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1435266712, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1435266712, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1435266712} OutVars{~x$w_buff1_used~0=~x$w_buff1_used~0_In1435266712, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1435266712, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1435266712, P1Thread1of1ForFork0_#t~ite29=|P1Thread1of1ForFork0_#t~ite29_Out1435266712|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1435266712} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite29] because there is no mapped edge [2019-12-27 18:49:17,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [748] [748] L776-->L777: Formula: (let ((.cse0 (= 0 (mod ~x$r_buff0_thd2~0_In-1005683119 256))) (.cse1 (= (mod ~x$w_buff0_used~0_In-1005683119 256) 0))) (or (and (= ~x$r_buff0_thd2~0_In-1005683119 ~x$r_buff0_thd2~0_Out-1005683119) (or .cse0 .cse1)) (and (not .cse0) (= ~x$r_buff0_thd2~0_Out-1005683119 0) (not .cse1)))) InVars {~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In-1005683119, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1005683119} OutVars{P1Thread1of1ForFork0_#t~ite30=|P1Thread1of1ForFork0_#t~ite30_Out-1005683119|, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_Out-1005683119, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1005683119} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite30, ~x$r_buff0_thd2~0] because there is no mapped edge [2019-12-27 18:49:17,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [742] [742] L777-->L777-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd2~0_In1661161792 256) 0)) (.cse1 (= (mod ~x$w_buff0_used~0_In1661161792 256) 0)) (.cse2 (= 0 (mod ~x$r_buff1_thd2~0_In1661161792 256))) (.cse3 (= 0 (mod ~x$w_buff1_used~0_In1661161792 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P1Thread1of1ForFork0_#t~ite31_Out1661161792|)) (and (= |P1Thread1of1ForFork0_#t~ite31_Out1661161792| ~x$r_buff1_thd2~0_In1661161792) (or .cse0 .cse1) (or .cse2 .cse3)))) InVars {~x$w_buff1_used~0=~x$w_buff1_used~0_In1661161792, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1661161792, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1661161792, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1661161792} OutVars{P1Thread1of1ForFork0_#t~ite31=|P1Thread1of1ForFork0_#t~ite31_Out1661161792|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1661161792, ~x$r_buff1_thd2~0=~x$r_buff1_thd2~0_In1661161792, ~x$r_buff0_thd2~0=~x$r_buff0_thd2~0_In1661161792, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1661161792} AuxVars[] AssignedVars[P1Thread1of1ForFork0_#t~ite31] because there is no mapped edge [2019-12-27 18:49:17,314 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L777-2-->P1EXIT: Formula: (and (= v_~x$r_buff1_thd2~0_67 |v_P1Thread1of1ForFork0_#t~ite31_40|) (= 0 |v_P1Thread1of1ForFork0_#res.base_5|) (= 0 |v_P1Thread1of1ForFork0_#res.offset_5|) (= (+ v_~__unbuffered_cnt~0_89 1) v_~__unbuffered_cnt~0_88)) InVars {P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_40|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_89} OutVars{P1Thread1of1ForFork0_#t~ite31=|v_P1Thread1of1ForFork0_#t~ite31_39|, ~x$r_buff1_thd2~0=v_~x$r_buff1_thd2~0_67, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_88, 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 18:49:17,315 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [699] [699] L820-1-->L826: Formula: (and (= 3 v_~__unbuffered_cnt~0_29) (= v_~main$tmp_guard0~0_7 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29} OutVars{ULTIMATE.start_main_#t~nondet40=|v_ULTIMATE.start_main_#t~nondet40_6|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_29, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_7} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet40, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-27 18:49:17,316 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [751] [751] L826-2-->L826-5: Formula: (let ((.cse2 (= |ULTIMATE.start_main_#t~ite42_Out623920816| |ULTIMATE.start_main_#t~ite41_Out623920816|)) (.cse1 (= 0 (mod ~x$r_buff1_thd0~0_In623920816 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In623920816 256)))) (or (and (or .cse0 .cse1) (= ~x~0_In623920816 |ULTIMATE.start_main_#t~ite41_Out623920816|) .cse2) (and .cse2 (not .cse1) (not .cse0) (= |ULTIMATE.start_main_#t~ite41_Out623920816| ~x$w_buff1~0_In623920816)))) InVars {~x$w_buff1~0=~x$w_buff1~0_In623920816, ~x$w_buff1_used~0=~x$w_buff1_used~0_In623920816, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In623920816, ~x~0=~x~0_In623920816} OutVars{ULTIMATE.start_main_#t~ite41=|ULTIMATE.start_main_#t~ite41_Out623920816|, ~x$w_buff1~0=~x$w_buff1~0_In623920816, ~x$w_buff1_used~0=~x$w_buff1_used~0_In623920816, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In623920816, ULTIMATE.start_main_#t~ite42=|ULTIMATE.start_main_#t~ite42_Out623920816|, ~x~0=~x~0_In623920816} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#t~ite42] because there is no mapped edge [2019-12-27 18:49:17,317 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [745] [745] L827-->L827-2: Formula: (let ((.cse0 (= (mod ~x$r_buff0_thd0~0_In1761184808 256) 0)) (.cse1 (= 0 (mod ~x$w_buff0_used~0_In1761184808 256)))) (or (and (= ~x$w_buff0_used~0_In1761184808 |ULTIMATE.start_main_#t~ite43_Out1761184808|) (or .cse0 .cse1)) (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite43_Out1761184808|) (not .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1761184808, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1761184808} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1761184808, ULTIMATE.start_main_#t~ite43=|ULTIMATE.start_main_#t~ite43_Out1761184808|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1761184808} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite43] because there is no mapped edge [2019-12-27 18:49:17,318 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [737] [737] L828-->L828-2: Formula: (let ((.cse2 (= 0 (mod ~x$r_buff0_thd0~0_In-1552290743 256))) (.cse3 (= 0 (mod ~x$w_buff0_used~0_In-1552290743 256))) (.cse0 (= 0 (mod ~x$w_buff1_used~0_In-1552290743 256))) (.cse1 (= (mod ~x$r_buff1_thd0~0_In-1552290743 256) 0))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |ULTIMATE.start_main_#t~ite44_Out-1552290743| ~x$w_buff1_used~0_In-1552290743)) (and (= |ULTIMATE.start_main_#t~ite44_Out-1552290743| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1552290743, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1552290743, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1552290743, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1552290743} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1552290743, ~x$w_buff1_used~0=~x$w_buff1_used~0_In-1552290743, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In-1552290743, ULTIMATE.start_main_#t~ite44=|ULTIMATE.start_main_#t~ite44_Out-1552290743|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1552290743} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite44] because there is no mapped edge [2019-12-27 18:49:17,319 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [752] [752] L829-->L829-2: Formula: (let ((.cse0 (= (mod ~x$w_buff0_used~0_In-1770528149 256) 0)) (.cse1 (= (mod ~x$r_buff0_thd0~0_In-1770528149 256) 0))) (or (and (not .cse0) (= 0 |ULTIMATE.start_main_#t~ite45_Out-1770528149|) (not .cse1)) (and (= ~x$r_buff0_thd0~0_In-1770528149 |ULTIMATE.start_main_#t~ite45_Out-1770528149|) (or .cse0 .cse1)))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1770528149, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1770528149} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In-1770528149, ULTIMATE.start_main_#t~ite45=|ULTIMATE.start_main_#t~ite45_Out-1770528149|, ~x$w_buff0_used~0=~x$w_buff0_used~0_In-1770528149} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite45] because there is no mapped edge [2019-12-27 18:49:17,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [738] [738] L830-->L830-2: Formula: (let ((.cse3 (= 0 (mod ~x$w_buff0_used~0_In1117971012 256))) (.cse2 (= (mod ~x$r_buff0_thd0~0_In1117971012 256) 0)) (.cse1 (= (mod ~x$w_buff1_used~0_In1117971012 256) 0)) (.cse0 (= 0 (mod ~x$r_buff1_thd0~0_In1117971012 256)))) (or (and (= ~x$r_buff1_thd0~0_In1117971012 |ULTIMATE.start_main_#t~ite46_Out1117971012|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= 0 |ULTIMATE.start_main_#t~ite46_Out1117971012|) (or (and (not .cse3) (not .cse2)) (and (not .cse1) (not .cse0)))))) InVars {~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1117971012, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1117971012, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1117971012, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1117971012} OutVars{~x$r_buff0_thd0~0=~x$r_buff0_thd0~0_In1117971012, ULTIMATE.start_main_#t~ite46=|ULTIMATE.start_main_#t~ite46_Out1117971012|, ~x$w_buff1_used~0=~x$w_buff1_used~0_In1117971012, ~x$r_buff1_thd0~0=~x$r_buff1_thd0~0_In1117971012, ~x$w_buff0_used~0=~x$w_buff0_used~0_In1117971012} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite46] because there is no mapped edge [2019-12-27 18:49:17,320 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [790] [790] L830-2-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_14 0) (= v_~main$tmp_guard1~0_18 0) (= v_~z~0_43 2) (= |v_ULTIMATE.start___VERIFIER_assert_#in~expression_9| (mod v_~main$tmp_guard1~0_18 256)) (= v_~y~0_108 2) (= 0 v_~__unbuffered_p0_EAX~0_24) (= v_~x$r_buff1_thd0~0_148 |v_ULTIMATE.start_main_#t~ite46_39|)) InVars {~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_39|, ~z~0=v_~z~0_43, ~y~0=v_~y~0_108} OutVars{~__unbuffered_p0_EAX~0=v_~__unbuffered_p0_EAX~0_24, ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_14, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_38|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_18, ~z~0=v_~z~0_43, ~y~0=v_~y~0_108, ~x$r_buff1_thd0~0=v_~x$r_buff1_thd0~0_148, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_9|} 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 18:49:17,425 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 27.12 06:49:17 BasicIcfg [2019-12-27 18:49:17,425 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-27 18:49:17,429 INFO L168 Benchmark]: Toolchain (without parser) took 72552.37 ms. Allocated memory was 142.1 MB in the beginning and 2.6 GB in the end (delta: 2.5 GB). Free memory was 101.5 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.1 GB. Max. memory is 7.1 GB. [2019-12-27 18:49:17,429 INFO L168 Benchmark]: CDTParser took 0.27 ms. Allocated memory is still 142.1 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. [2019-12-27 18:49:17,430 INFO L168 Benchmark]: CACSL2BoogieTranslator took 1027.13 ms. Allocated memory was 142.1 MB in the beginning and 205.0 MB in the end (delta: 62.9 MB). Free memory was 101.0 MB in the beginning and 158.6 MB in the end (delta: -57.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. [2019-12-27 18:49:17,431 INFO L168 Benchmark]: Boogie Procedure Inliner took 94.81 ms. Allocated memory is still 205.0 MB. Free memory was 158.6 MB in the beginning and 155.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-27 18:49:17,433 INFO L168 Benchmark]: Boogie Preprocessor took 75.40 ms. Allocated memory is still 205.0 MB. Free memory was 155.9 MB in the beginning and 153.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. [2019-12-27 18:49:17,434 INFO L168 Benchmark]: RCFGBuilder took 832.90 ms. Allocated memory is still 205.0 MB. Free memory was 153.9 MB in the beginning and 107.0 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. [2019-12-27 18:49:17,434 INFO L168 Benchmark]: TraceAbstraction took 70516.68 ms. Allocated memory was 205.0 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 107.0 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. [2019-12-27 18:49:17,439 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.27 ms. Allocated memory is still 142.1 MB. Free memory was 121.5 MB in the beginning and 121.3 MB in the end (delta: 209.8 kB). Peak memory consumption was 209.8 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 1027.13 ms. Allocated memory was 142.1 MB in the beginning and 205.0 MB in the end (delta: 62.9 MB). Free memory was 101.0 MB in the beginning and 158.6 MB in the end (delta: -57.6 MB). Peak memory consumption was 20.9 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 94.81 ms. Allocated memory is still 205.0 MB. Free memory was 158.6 MB in the beginning and 155.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 75.40 ms. Allocated memory is still 205.0 MB. Free memory was 155.9 MB in the beginning and 153.9 MB in the end (delta: 2.0 MB). Peak memory consumption was 2.0 MB. Max. memory is 7.1 GB. * RCFGBuilder took 832.90 ms. Allocated memory is still 205.0 MB. Free memory was 153.9 MB in the beginning and 107.0 MB in the end (delta: 46.9 MB). Peak memory consumption was 46.9 MB. Max. memory is 7.1 GB. * TraceAbstraction took 70516.68 ms. Allocated memory was 205.0 MB in the beginning and 2.6 GB in the end (delta: 2.4 GB). Free memory was 107.0 MB in the beginning and 1.5 GB in the end (delta: -1.4 GB). Peak memory consumption was 1.0 GB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.8s, 162 ProgramPointsBefore, 83 ProgramPointsAfterwards, 193 TransitionsBefore, 92 TransitionsAfterwards, 16696 CoEnabledTransitionPairs, 7 FixpointIterations, 31 TrivialSequentialCompositions, 47 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 34 ConcurrentYvCompositions, 26 ChoiceCompositions, 6611 VarBasedMoverChecksPositive, 290 VarBasedMoverChecksNegative, 125 SemBasedMoverChecksPositive, 244 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.8s, 0 MoverChecksTotal, 64880 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 5]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L816] FCALL, FORK 0 pthread_create(&t2525, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L818] FCALL, FORK 0 pthread_create(&t2526, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L758] 2 x$w_buff1 = x$w_buff0 [L759] 2 x$w_buff0 = 1 [L760] 2 x$w_buff1_used = x$w_buff0_used [L761] 2 x$w_buff0_used = (_Bool)1 [L820] FCALL, FORK 0 pthread_create(&t2527, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_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] [L787] 3 y = 2 [L790] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=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=2, z=1] [L793] 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, 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=2, z=1] [L728] 1 z = 2 [L733] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L734] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L735] 1 x$flush_delayed = weak$$choice2 [L736] 1 x$mem_tmp = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, 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=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L737] 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=0, 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=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L737] 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) [L738] EXPR 1 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)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, 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_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))=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=1, x$w_buff1=0, x$w_buff1_used=0, x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x=0, y=2, z=2] [L794] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L795] 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 [L796] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L773] EXPR 2 x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, 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_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))=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=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L738] 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)) [L739] 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)) [L740] 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)) [L741] EXPR 1 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)) VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, 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_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))=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=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L741] 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)) [L743] 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)) [L744] 1 __unbuffered_p0_EAX = x VAL [\result={0:0}, __unbuffered_cnt=1, __unbuffered_p0_EAX=0, 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=1, x$w_buff1=0, x$w_buff1_used=0, y=2, z=2] [L773] 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) [L774] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L775] 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 [L826] EXPR 0 x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) VAL [\result={0:0}, __unbuffered_cnt=3, __unbuffered_p0_EAX=0, 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=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_buff1=0, x$w_buff1_used=0, y=2, z=2] [L826] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L827] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L828] 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 [L829] 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, 153 locations, 2 error locations. Result: UNSAFE, OverallTime: 70.1s, OverallIterations: 18, TraceHistogramMax: 1, AutomataDifference: 22.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 3424 SDtfs, 4374 SDslu, 8995 SDs, 0 SdLazy, 5181 SolverSat, 327 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 245 GetRequests, 72 SyntacticMatches, 25 SemanticMatches, 148 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 884 ImplicationChecksByTransitivity, 2.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=111499occurred in iteration=2, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 25.2s AutomataMinimizationTime, 17 MinimizatonAttempts, 228352 StatesRemovedByMinimization, 15 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.3s SatisfiabilityAnalysisTime, 1.0s InterpolantComputationTime, 682 NumberOfCodeBlocks, 682 NumberOfCodeBlocksAsserted, 18 NumberOfCheckSat, 609 ConstructedInterpolants, 0 QuantifiedInterpolants, 108834 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 17 InterpolantComputations, 17 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...