/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.epf -i ../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i -------------------------------------------------------------------------------- This is Ultimate 0.1.25-fae578e [2019-12-18 18:33:16,694 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-12-18 18:33:16,698 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-12-18 18:33:16,715 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-12-18 18:33:16,715 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-12-18 18:33:16,716 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-12-18 18:33:16,717 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-12-18 18:33:16,719 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-12-18 18:33:16,721 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-12-18 18:33:16,722 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-12-18 18:33:16,723 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-12-18 18:33:16,724 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-12-18 18:33:16,724 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-12-18 18:33:16,725 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-12-18 18:33:16,726 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-12-18 18:33:16,728 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-12-18 18:33:16,728 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-12-18 18:33:16,729 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-12-18 18:33:16,731 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-12-18 18:33:16,734 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-12-18 18:33:16,737 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-12-18 18:33:16,738 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-12-18 18:33:16,739 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-12-18 18:33:16,740 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-12-18 18:33:16,742 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-12-18 18:33:16,743 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-12-18 18:33:16,743 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-12-18 18:33:16,744 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-12-18 18:33:16,744 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-12-18 18:33:16,745 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-12-18 18:33:16,745 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-12-18 18:33:16,746 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-12-18 18:33:16,747 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-12-18 18:33:16,747 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-12-18 18:33:16,748 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-12-18 18:33:16,749 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-12-18 18:33:16,749 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-12-18 18:33:16,750 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-12-18 18:33:16,750 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-12-18 18:33:16,751 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-12-18 18:33:16,751 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-12-18 18:33:16,752 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.epf [2019-12-18 18:33:16,766 INFO L113 SettingsManager]: Loading preferences was successful [2019-12-18 18:33:16,766 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-12-18 18:33:16,767 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-12-18 18:33:16,768 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-12-18 18:33:16,768 INFO L138 SettingsManager]: * Use SBE=true [2019-12-18 18:33:16,768 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-12-18 18:33:16,768 INFO L138 SettingsManager]: * sizeof long=4 [2019-12-18 18:33:16,768 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-12-18 18:33:16,769 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-12-18 18:33:16,769 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-12-18 18:33:16,769 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-12-18 18:33:16,769 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-12-18 18:33:16,769 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-12-18 18:33:16,770 INFO L138 SettingsManager]: * sizeof long double=12 [2019-12-18 18:33:16,770 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-12-18 18:33:16,770 INFO L138 SettingsManager]: * Use constant arrays=true [2019-12-18 18:33:16,770 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-12-18 18:33:16,770 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-12-18 18:33:16,771 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-12-18 18:33:16,771 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-12-18 18:33:16,771 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-12-18 18:33:16,771 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:33:16,771 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-12-18 18:33:16,772 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-12-18 18:33:16,772 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-12-18 18:33:16,772 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-12-18 18:33:16,772 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-12-18 18:33:16,772 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-12-18 18:33:16,772 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2019-12-18 18:33:17,037 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-12-18 18:33:17,058 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-12-18 18:33:17,064 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-12-18 18:33:17,066 INFO L271 PluginConnector]: Initializing CDTParser... [2019-12-18 18:33:17,066 INFO L275 PluginConnector]: CDTParser initialized [2019-12-18 18:33:17,067 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i [2019-12-18 18:33:17,144 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce80943a4/4c9e3e0eb76747ff8f245be5f12d2f1f/FLAG1fe5e5f3d [2019-12-18 18:33:17,716 INFO L306 CDTParser]: Found 1 translation units. [2019-12-18 18:33:17,716 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/pthread-wmm/safe011_rmo.oepc.i [2019-12-18 18:33:17,741 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce80943a4/4c9e3e0eb76747ff8f245be5f12d2f1f/FLAG1fe5e5f3d [2019-12-18 18:33:17,994 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/ce80943a4/4c9e3e0eb76747ff8f245be5f12d2f1f [2019-12-18 18:33:18,002 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-12-18 18:33:18,004 INFO L131 ToolchainWalker]: Walking toolchain with 5 elements. [2019-12-18 18:33:18,005 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-12-18 18:33:18,005 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-12-18 18:33:18,009 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-12-18 18:33:18,010 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:33:17" (1/1) ... [2019-12-18 18:33:18,013 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@65f2a089 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:33:18, skipping insertion in model container [2019-12-18 18:33:18,013 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 18.12 06:33:17" (1/1) ... [2019-12-18 18:33:18,021 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2019-12-18 18:33:18,091 INFO L178 MainTranslator]: Built tables and reachable declarations [2019-12-18 18:33:18,642 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:33:18,655 INFO L203 MainTranslator]: Completed pre-run [2019-12-18 18:33:18,744 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-12-18 18:33:18,816 INFO L208 MainTranslator]: Completed translation [2019-12-18 18:33:18,816 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:33:18 WrapperNode [2019-12-18 18:33:18,817 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-12-18 18:33:18,817 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-12-18 18:33:18,818 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-12-18 18:33:18,818 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-12-18 18:33:18,827 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:33:18" (1/1) ... [2019-12-18 18:33:18,848 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:33:18" (1/1) ... [2019-12-18 18:33:18,885 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-12-18 18:33:18,886 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-12-18 18:33:18,886 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-12-18 18:33:18,886 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-12-18 18:33:18,897 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:33:18" (1/1) ... [2019-12-18 18:33:18,897 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:33:18" (1/1) ... [2019-12-18 18:33:18,902 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:33:18" (1/1) ... [2019-12-18 18:33:18,903 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:33:18" (1/1) ... [2019-12-18 18:33:18,914 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:33:18" (1/1) ... [2019-12-18 18:33:18,919 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:33:18" (1/1) ... [2019-12-18 18:33:18,923 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:33:18" (1/1) ... [2019-12-18 18:33:18,928 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-12-18 18:33:18,929 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-12-18 18:33:18,929 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-12-18 18:33:18,929 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-12-18 18:33:18,930 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:33:18" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-12-18 18:33:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-12-18 18:33:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2019-12-18 18:33:19,010 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-12-18 18:33:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2019-12-18 18:33:19,011 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2019-12-18 18:33:19,011 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2019-12-18 18:33:19,013 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2019-12-18 18:33:19,013 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2019-12-18 18:33:19,014 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2019-12-18 18:33:19,014 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2019-12-18 18:33:19,016 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2019-12-18 18:33:19,017 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-12-18 18:33:19,017 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-12-18 18:33:19,020 WARN L205 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2019-12-18 18:33:19,896 INFO L282 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-12-18 18:33:19,896 INFO L287 CfgBuilder]: Removed 8 assume(true) statements. [2019-12-18 18:33:19,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:33:19 BoogieIcfgContainer [2019-12-18 18:33:19,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-12-18 18:33:19,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-12-18 18:33:19,899 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-12-18 18:33:19,902 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-12-18 18:33:19,902 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 18.12 06:33:17" (1/3) ... [2019-12-18 18:33:19,903 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30781154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:33:19, skipping insertion in model container [2019-12-18 18:33:19,903 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 18.12 06:33:18" (2/3) ... [2019-12-18 18:33:19,904 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@30781154 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 18.12 06:33:19, skipping insertion in model container [2019-12-18 18:33:19,904 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 18.12 06:33:19" (3/3) ... [2019-12-18 18:33:19,906 INFO L109 eAbstractionObserver]: Analyzing ICFG safe011_rmo.oepc.i [2019-12-18 18:33:19,916 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2019-12-18 18:33:19,916 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-12-18 18:33:19,924 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 2 error locations. [2019-12-18 18:33:19,925 INFO L340 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2019-12-18 18:33:19,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,962 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,962 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,963 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,963 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,963 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,964 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,964 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,965 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,966 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,967 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,968 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,969 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,970 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,971 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,971 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,972 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,972 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,972 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,973 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,974 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,975 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,976 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,977 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,994 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,995 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,997 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#in~arg.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,997 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,997 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:19,999 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,000 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,001 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,002 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,003 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,004 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,005 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite5| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite6| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite3| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,009 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite4| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite7| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,010 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#t~ite8| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,010 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0___VERIFIER_assert_~expression not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,011 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,014 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,015 WARN L315 ript$VariableManager]: TermVariabe |P0Thread1of1ForFork0___VERIFIER_assert_#in~expression| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,015 WARN L315 ript$VariableManager]: TermVariabe P0Thread1of1ForFork0_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,019 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,020 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite9| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,021 WARN L315 ript$VariableManager]: TermVariabe P1Thread1of1ForFork1_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite11| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite10| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite13| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,021 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite12| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,022 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#t~ite14| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,028 WARN L315 ript$VariableManager]: TermVariabe |P1Thread1of1ForFork1_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,033 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite15| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,033 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.base not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,034 WARN L315 ript$VariableManager]: TermVariabe P2Thread1of1ForFork2_~arg.offset not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite20| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.base| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite16| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,034 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#res.offset| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite17| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite18| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,035 WARN L315 ript$VariableManager]: TermVariabe |P2Thread1of1ForFork2_#t~ite19| not constructed by VariableManager. Cannot ensure absence of name clashes. [2019-12-18 18:33:20,049 INFO L249 AbstractCegarLoop]: Starting to check reachability of 6 error locations. [2019-12-18 18:33:20,072 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-12-18 18:33:20,072 INFO L374 AbstractCegarLoop]: Hoare is true [2019-12-18 18:33:20,072 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-12-18 18:33:20,072 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-12-18 18:33:20,072 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-12-18 18:33:20,073 INFO L378 AbstractCegarLoop]: Difference is false [2019-12-18 18:33:20,073 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-12-18 18:33:20,073 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-12-18 18:33:20,095 INFO L152 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 174 places, 211 transitions [2019-12-18 18:33:20,097 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 18:33:20,186 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 18:33:20,186 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:33:20,204 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 18:33:20,232 INFO L68 FinitePrefix]: Start finitePrefix. Operand has 174 places, 211 transitions [2019-12-18 18:33:20,277 INFO L126 PetriNetUnfolder]: 47/208 cut-off events. [2019-12-18 18:33:20,277 INFO L127 PetriNetUnfolder]: For 0/0 co-relation queries the response was YES. [2019-12-18 18:33:20,288 INFO L76 FinitePrefix]: Finished finitePrefix Result has 218 conditions, 208 events. 47/208 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 335 event pairs. 9/168 useless extension candidates. Maximal degree in co-relation 179. Up to 2 conditions per place. [2019-12-18 18:33:20,307 INFO L158 etLargeBlockEncoding]: Number of co-enabled transitions 17114 [2019-12-18 18:33:20,308 INFO L170 etLargeBlockEncoding]: Semantic Check. [2019-12-18 18:33:25,154 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-18 18:33:25,314 WARN L192 SmtUtils]: Spent 158.00 ms on a formula simplification that was a NOOP. DAG size: 67 [2019-12-18 18:33:25,551 WARN L192 SmtUtils]: Spent 212.00 ms on a formula simplification. DAG size of input: 87 DAG size of output: 85 [2019-12-18 18:33:25,656 WARN L192 SmtUtils]: Spent 103.00 ms on a formula simplification that was a NOOP. DAG size: 83 [2019-12-18 18:33:25,682 INFO L206 etLargeBlockEncoding]: Checked pairs total: 86146 [2019-12-18 18:33:25,683 INFO L214 etLargeBlockEncoding]: Total number of compositions: 112 [2019-12-18 18:33:25,686 INFO L100 iNet2FiniteAutomaton]: Start petriNet2FiniteAutomaton. Operand has 93 places, 104 transitions [2019-12-18 18:33:40,205 INFO L122 iNet2FiniteAutomaton]: Finished petriNet2FiniteAutomaton. Result 104862 states. [2019-12-18 18:33:40,207 INFO L276 IsEmpty]: Start isEmpty. Operand 104862 states. [2019-12-18 18:33:40,211 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2019-12-18 18:33:40,211 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:33:40,212 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1] [2019-12-18 18:33:40,213 INFO L410 AbstractCegarLoop]: === Iteration 1 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:33:40,218 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:33:40,218 INFO L82 PathProgramCache]: Analyzing trace with hash 844471, now seen corresponding path program 1 times [2019-12-18 18:33:40,225 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:33:40,225 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1949819771] [2019-12-18 18:33:40,226 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:33:40,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:33:40,423 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:33:40,424 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1949819771] [2019-12-18 18:33:40,424 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:33:40,425 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2019-12-18 18:33:40,426 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1092070183] [2019-12-18 18:33:40,430 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:33:40,431 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:33:40,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:33:40,446 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:33:40,449 INFO L87 Difference]: Start difference. First operand 104862 states. Second operand 3 states. [2019-12-18 18:33:43,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:33:43,066 INFO L93 Difference]: Finished difference Result 104560 states and 448162 transitions. [2019-12-18 18:33:43,067 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:33:43,068 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 3 [2019-12-18 18:33:43,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:33:43,803 INFO L225 Difference]: With dead ends: 104560 [2019-12-18 18:33:43,803 INFO L226 Difference]: Without dead ends: 102376 [2019-12-18 18:33:43,804 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:33:49,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102376 states. [2019-12-18 18:33:51,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102376 to 102376. [2019-12-18 18:33:51,834 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 102376 states. [2019-12-18 18:33:53,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102376 states to 102376 states and 439244 transitions. [2019-12-18 18:33:53,005 INFO L78 Accepts]: Start accepts. Automaton has 102376 states and 439244 transitions. Word has length 3 [2019-12-18 18:33:53,006 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:33:53,006 INFO L462 AbstractCegarLoop]: Abstraction has 102376 states and 439244 transitions. [2019-12-18 18:33:53,006 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:33:53,006 INFO L276 IsEmpty]: Start isEmpty. Operand 102376 states and 439244 transitions. [2019-12-18 18:33:53,010 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2019-12-18 18:33:53,010 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:33:53,010 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:33:53,011 INFO L410 AbstractCegarLoop]: === Iteration 2 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:33:53,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:33:53,011 INFO L82 PathProgramCache]: Analyzing trace with hash 205437058, now seen corresponding path program 1 times [2019-12-18 18:33:53,011 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:33:53,012 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2039302197] [2019-12-18 18:33:53,012 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:33:53,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:33:53,141 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:33:53,142 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2039302197] [2019-12-18 18:33:53,142 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:33:53,142 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:33:53,142 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1917958245] [2019-12-18 18:33:53,144 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:33:53,144 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:33:53,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:33:53,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:33:53,144 INFO L87 Difference]: Start difference. First operand 102376 states and 439244 transitions. Second operand 4 states. [2019-12-18 18:33:58,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:33:58,904 INFO L93 Difference]: Finished difference Result 164490 states and 678436 transitions. [2019-12-18 18:33:58,905 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:33:58,905 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 11 [2019-12-18 18:33:58,905 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:33:59,454 INFO L225 Difference]: With dead ends: 164490 [2019-12-18 18:33:59,455 INFO L226 Difference]: Without dead ends: 164441 [2019-12-18 18:33:59,456 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-18 18:34:03,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164441 states. [2019-12-18 18:34:06,821 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164441 to 148513. [2019-12-18 18:34:06,821 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 148513 states. [2019-12-18 18:34:07,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148513 states to 148513 states and 619831 transitions. [2019-12-18 18:34:07,347 INFO L78 Accepts]: Start accepts. Automaton has 148513 states and 619831 transitions. Word has length 11 [2019-12-18 18:34:07,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:07,348 INFO L462 AbstractCegarLoop]: Abstraction has 148513 states and 619831 transitions. [2019-12-18 18:34:07,348 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:34:07,348 INFO L276 IsEmpty]: Start isEmpty. Operand 148513 states and 619831 transitions. [2019-12-18 18:34:07,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:34:07,354 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:07,354 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:07,354 INFO L410 AbstractCegarLoop]: === Iteration 3 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:07,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:07,355 INFO L82 PathProgramCache]: Analyzing trace with hash 1045519438, now seen corresponding path program 1 times [2019-12-18 18:34:07,355 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:07,355 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1373537107] [2019-12-18 18:34:07,356 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:07,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:07,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:34:07,464 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1373537107] [2019-12-18 18:34:07,464 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:07,464 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:34:07,465 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922967826] [2019-12-18 18:34:07,465 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:34:07,465 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:07,466 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:34:07,467 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:34:07,467 INFO L87 Difference]: Start difference. First operand 148513 states and 619831 transitions. Second operand 4 states. [2019-12-18 18:34:13,022 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:13,022 INFO L93 Difference]: Finished difference Result 211896 states and 864765 transitions. [2019-12-18 18:34:13,023 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:34:13,023 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2019-12-18 18:34:13,023 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:14,568 INFO L225 Difference]: With dead ends: 211896 [2019-12-18 18:34:14,569 INFO L226 Difference]: Without dead ends: 211833 [2019-12-18 18:34:14,569 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:34:19,040 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 211833 states. [2019-12-18 18:34:27,229 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 211833 to 178183. [2019-12-18 18:34:27,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 178183 states. [2019-12-18 18:34:29,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178183 states to 178183 states and 738846 transitions. [2019-12-18 18:34:29,060 INFO L78 Accepts]: Start accepts. Automaton has 178183 states and 738846 transitions. Word has length 13 [2019-12-18 18:34:29,061 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:29,061 INFO L462 AbstractCegarLoop]: Abstraction has 178183 states and 738846 transitions. [2019-12-18 18:34:29,061 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:34:29,061 INFO L276 IsEmpty]: Start isEmpty. Operand 178183 states and 738846 transitions. [2019-12-18 18:34:29,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2019-12-18 18:34:29,065 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:29,065 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:29,066 INFO L410 AbstractCegarLoop]: === Iteration 4 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:29,066 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:29,066 INFO L82 PathProgramCache]: Analyzing trace with hash 31849685, now seen corresponding path program 1 times [2019-12-18 18:34:29,066 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:29,067 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1117210751] [2019-12-18 18:34:29,067 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:29,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:29,117 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:34:29,117 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1117210751] [2019-12-18 18:34:29,117 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:29,117 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:34:29,121 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1937189009] [2019-12-18 18:34:29,121 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:34:29,122 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:29,122 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:34:29,122 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:34:29,122 INFO L87 Difference]: Start difference. First operand 178183 states and 738846 transitions. Second operand 3 states. [2019-12-18 18:34:29,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:29,280 INFO L93 Difference]: Finished difference Result 36088 states and 117391 transitions. [2019-12-18 18:34:29,281 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:34:29,281 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2019-12-18 18:34:29,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:29,337 INFO L225 Difference]: With dead ends: 36088 [2019-12-18 18:34:29,337 INFO L226 Difference]: Without dead ends: 36088 [2019-12-18 18:34:29,338 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:34:29,494 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36088 states. [2019-12-18 18:34:29,845 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36088 to 36088. [2019-12-18 18:34:29,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36088 states. [2019-12-18 18:34:29,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36088 states to 36088 states and 117391 transitions. [2019-12-18 18:34:29,921 INFO L78 Accepts]: Start accepts. Automaton has 36088 states and 117391 transitions. Word has length 13 [2019-12-18 18:34:29,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:29,921 INFO L462 AbstractCegarLoop]: Abstraction has 36088 states and 117391 transitions. [2019-12-18 18:34:29,921 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:34:29,921 INFO L276 IsEmpty]: Start isEmpty. Operand 36088 states and 117391 transitions. [2019-12-18 18:34:29,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2019-12-18 18:34:29,925 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:29,925 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:29,925 INFO L410 AbstractCegarLoop]: === Iteration 5 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:29,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:29,925 INFO L82 PathProgramCache]: Analyzing trace with hash -1539749953, now seen corresponding path program 1 times [2019-12-18 18:34:29,926 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:29,926 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [947761660] [2019-12-18 18:34:29,926 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:29,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:30,057 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:34:30,057 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [947761660] [2019-12-18 18:34:30,058 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:30,058 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:34:30,058 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159529842] [2019-12-18 18:34:30,058 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:34:30,059 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:30,059 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:34:30,059 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:34:30,059 INFO L87 Difference]: Start difference. First operand 36088 states and 117391 transitions. Second operand 5 states. [2019-12-18 18:34:30,853 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:30,853 INFO L93 Difference]: Finished difference Result 49088 states and 156546 transitions. [2019-12-18 18:34:30,853 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2019-12-18 18:34:30,854 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2019-12-18 18:34:30,854 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:30,928 INFO L225 Difference]: With dead ends: 49088 [2019-12-18 18:34:30,929 INFO L226 Difference]: Without dead ends: 49075 [2019-12-18 18:34:30,929 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2019-12-18 18:34:31,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49075 states. [2019-12-18 18:34:32,848 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49075 to 36431. [2019-12-18 18:34:32,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36431 states. [2019-12-18 18:34:32,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36431 states to 36431 states and 118357 transitions. [2019-12-18 18:34:32,925 INFO L78 Accepts]: Start accepts. Automaton has 36431 states and 118357 transitions. Word has length 19 [2019-12-18 18:34:32,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:32,926 INFO L462 AbstractCegarLoop]: Abstraction has 36431 states and 118357 transitions. [2019-12-18 18:34:32,926 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:34:32,926 INFO L276 IsEmpty]: Start isEmpty. Operand 36431 states and 118357 transitions. [2019-12-18 18:34:32,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2019-12-18 18:34:32,939 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:32,939 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:32,939 INFO L410 AbstractCegarLoop]: === Iteration 6 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:32,939 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:32,939 INFO L82 PathProgramCache]: Analyzing trace with hash 1129453691, now seen corresponding path program 1 times [2019-12-18 18:34:32,940 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:32,940 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1816561230] [2019-12-18 18:34:32,940 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:32,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:33,051 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:34:33,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1816561230] [2019-12-18 18:34:33,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:33,053 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:34:33,053 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549617009] [2019-12-18 18:34:33,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-12-18 18:34:33,055 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:33,055 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-12-18 18:34:33,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:34:33,055 INFO L87 Difference]: Start difference. First operand 36431 states and 118357 transitions. Second operand 4 states. [2019-12-18 18:34:33,098 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:33,099 INFO L93 Difference]: Finished difference Result 7050 states and 19283 transitions. [2019-12-18 18:34:33,099 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-12-18 18:34:33,099 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2019-12-18 18:34:33,100 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:33,109 INFO L225 Difference]: With dead ends: 7050 [2019-12-18 18:34:33,110 INFO L226 Difference]: Without dead ends: 7050 [2019-12-18 18:34:33,110 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2019-12-18 18:34:33,132 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7050 states. [2019-12-18 18:34:33,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7050 to 6938. [2019-12-18 18:34:33,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6938 states. [2019-12-18 18:34:33,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6938 states to 6938 states and 18963 transitions. [2019-12-18 18:34:33,220 INFO L78 Accepts]: Start accepts. Automaton has 6938 states and 18963 transitions. Word has length 25 [2019-12-18 18:34:33,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:33,221 INFO L462 AbstractCegarLoop]: Abstraction has 6938 states and 18963 transitions. [2019-12-18 18:34:33,221 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-12-18 18:34:33,221 INFO L276 IsEmpty]: Start isEmpty. Operand 6938 states and 18963 transitions. [2019-12-18 18:34:33,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2019-12-18 18:34:33,235 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:33,235 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:33,236 INFO L410 AbstractCegarLoop]: === Iteration 7 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:33,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:33,236 INFO L82 PathProgramCache]: Analyzing trace with hash -1811341367, now seen corresponding path program 1 times [2019-12-18 18:34:33,237 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:33,237 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [563623477] [2019-12-18 18:34:33,237 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:33,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:33,326 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:34:33,327 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [563623477] [2019-12-18 18:34:33,327 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:33,327 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-12-18 18:34:33,327 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [945118396] [2019-12-18 18:34:33,328 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:34:33,328 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:33,328 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:34:33,328 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:34:33,328 INFO L87 Difference]: Start difference. First operand 6938 states and 18963 transitions. Second operand 5 states. [2019-12-18 18:34:33,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:33,367 INFO L93 Difference]: Finished difference Result 5023 states and 14421 transitions. [2019-12-18 18:34:33,367 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-12-18 18:34:33,367 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 37 [2019-12-18 18:34:33,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:33,375 INFO L225 Difference]: With dead ends: 5023 [2019-12-18 18:34:33,375 INFO L226 Difference]: Without dead ends: 5023 [2019-12-18 18:34:33,376 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:34:33,399 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5023 states. [2019-12-18 18:34:33,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5023 to 4659. [2019-12-18 18:34:33,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4659 states. [2019-12-18 18:34:33,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4659 states to 4659 states and 13437 transitions. [2019-12-18 18:34:33,447 INFO L78 Accepts]: Start accepts. Automaton has 4659 states and 13437 transitions. Word has length 37 [2019-12-18 18:34:33,448 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:33,448 INFO L462 AbstractCegarLoop]: Abstraction has 4659 states and 13437 transitions. [2019-12-18 18:34:33,448 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:34:33,448 INFO L276 IsEmpty]: Start isEmpty. Operand 4659 states and 13437 transitions. [2019-12-18 18:34:33,457 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:34:33,457 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:33,457 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:33,457 INFO L410 AbstractCegarLoop]: === Iteration 8 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:33,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:33,458 INFO L82 PathProgramCache]: Analyzing trace with hash 1876753934, now seen corresponding path program 1 times [2019-12-18 18:34:33,458 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:33,458 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1890021926] [2019-12-18 18:34:33,458 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:33,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:33,544 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:34:33,545 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1890021926] [2019-12-18 18:34:33,545 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:33,545 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:34:33,546 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59582239] [2019-12-18 18:34:33,546 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:34:33,546 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:33,547 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:34:33,547 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:34:33,547 INFO L87 Difference]: Start difference. First operand 4659 states and 13437 transitions. Second operand 3 states. [2019-12-18 18:34:33,599 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:33,600 INFO L93 Difference]: Finished difference Result 4668 states and 13449 transitions. [2019-12-18 18:34:33,600 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:34:33,600 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 18:34:33,601 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:33,608 INFO L225 Difference]: With dead ends: 4668 [2019-12-18 18:34:33,608 INFO L226 Difference]: Without dead ends: 4668 [2019-12-18 18:34:33,608 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:34:33,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2019-12-18 18:34:33,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4664. [2019-12-18 18:34:33,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2019-12-18 18:34:33,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 13445 transitions. [2019-12-18 18:34:33,665 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 13445 transitions. Word has length 65 [2019-12-18 18:34:33,665 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:33,666 INFO L462 AbstractCegarLoop]: Abstraction has 4664 states and 13445 transitions. [2019-12-18 18:34:33,666 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:34:33,666 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 13445 transitions. [2019-12-18 18:34:33,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:34:33,672 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:33,672 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:33,672 INFO L410 AbstractCegarLoop]: === Iteration 9 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:33,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:33,673 INFO L82 PathProgramCache]: Analyzing trace with hash 1173172274, now seen corresponding path program 1 times [2019-12-18 18:34:33,673 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:33,673 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1130532532] [2019-12-18 18:34:33,673 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:33,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:33,741 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:34:33,742 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1130532532] [2019-12-18 18:34:33,742 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:33,742 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-12-18 18:34:33,743 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [997280078] [2019-12-18 18:34:33,743 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:34:33,743 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:33,743 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:34:33,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:34:33,744 INFO L87 Difference]: Start difference. First operand 4664 states and 13445 transitions. Second operand 3 states. [2019-12-18 18:34:33,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:33,792 INFO L93 Difference]: Finished difference Result 4668 states and 13441 transitions. [2019-12-18 18:34:33,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:34:33,792 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 18:34:33,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:33,799 INFO L225 Difference]: With dead ends: 4668 [2019-12-18 18:34:33,799 INFO L226 Difference]: Without dead ends: 4668 [2019-12-18 18:34:33,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:34:33,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4668 states. [2019-12-18 18:34:33,852 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4668 to 4664. [2019-12-18 18:34:33,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4664 states. [2019-12-18 18:34:33,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4664 states to 4664 states and 13437 transitions. [2019-12-18 18:34:33,860 INFO L78 Accepts]: Start accepts. Automaton has 4664 states and 13437 transitions. Word has length 65 [2019-12-18 18:34:33,860 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:33,860 INFO L462 AbstractCegarLoop]: Abstraction has 4664 states and 13437 transitions. [2019-12-18 18:34:33,860 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:34:33,860 INFO L276 IsEmpty]: Start isEmpty. Operand 4664 states and 13437 transitions. [2019-12-18 18:34:33,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:34:33,866 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:33,866 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:33,867 INFO L410 AbstractCegarLoop]: === Iteration 10 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:33,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:33,867 INFO L82 PathProgramCache]: Analyzing trace with hash 1163492121, now seen corresponding path program 1 times [2019-12-18 18:34:33,867 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:33,868 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [822336069] [2019-12-18 18:34:33,868 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:33,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:33,956 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:34:33,956 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [822336069] [2019-12-18 18:34:33,956 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:33,956 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2019-12-18 18:34:33,957 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1712124597] [2019-12-18 18:34:33,957 INFO L442 AbstractCegarLoop]: Interpolant automaton has 5 states [2019-12-18 18:34:33,957 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:33,957 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2019-12-18 18:34:33,958 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2019-12-18 18:34:33,958 INFO L87 Difference]: Start difference. First operand 4664 states and 13437 transitions. Second operand 5 states. [2019-12-18 18:34:34,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:34,261 INFO L93 Difference]: Finished difference Result 7088 states and 20226 transitions. [2019-12-18 18:34:34,261 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2019-12-18 18:34:34,262 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 65 [2019-12-18 18:34:34,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:34,271 INFO L225 Difference]: With dead ends: 7088 [2019-12-18 18:34:34,271 INFO L226 Difference]: Without dead ends: 7088 [2019-12-18 18:34:34,272 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2019-12-18 18:34:34,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7088 states. [2019-12-18 18:34:34,347 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7088 to 5979. [2019-12-18 18:34:34,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5979 states. [2019-12-18 18:34:34,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5979 states to 5979 states and 17231 transitions. [2019-12-18 18:34:34,358 INFO L78 Accepts]: Start accepts. Automaton has 5979 states and 17231 transitions. Word has length 65 [2019-12-18 18:34:34,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:34,358 INFO L462 AbstractCegarLoop]: Abstraction has 5979 states and 17231 transitions. [2019-12-18 18:34:34,358 INFO L463 AbstractCegarLoop]: Interpolant automaton has 5 states. [2019-12-18 18:34:34,358 INFO L276 IsEmpty]: Start isEmpty. Operand 5979 states and 17231 transitions. [2019-12-18 18:34:34,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2019-12-18 18:34:34,366 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:34,366 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:34,366 INFO L410 AbstractCegarLoop]: === Iteration 11 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:34,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:34,367 INFO L82 PathProgramCache]: Analyzing trace with hash -2061317327, now seen corresponding path program 2 times [2019-12-18 18:34:34,367 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:34,367 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462540581] [2019-12-18 18:34:34,367 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:34,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:34,448 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:34:34,449 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462540581] [2019-12-18 18:34:34,449 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:34,450 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:34:34,450 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [509633792] [2019-12-18 18:34:34,451 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:34:34,451 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:34,451 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:34:34,451 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:34:34,451 INFO L87 Difference]: Start difference. First operand 5979 states and 17231 transitions. Second operand 3 states. [2019-12-18 18:34:34,485 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:34,485 INFO L93 Difference]: Finished difference Result 5666 states and 16104 transitions. [2019-12-18 18:34:34,485 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:34:34,485 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 65 [2019-12-18 18:34:34,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:34,495 INFO L225 Difference]: With dead ends: 5666 [2019-12-18 18:34:34,496 INFO L226 Difference]: Without dead ends: 5666 [2019-12-18 18:34:34,496 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:34:36,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5666 states. [2019-12-18 18:34:36,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5666 to 5378. [2019-12-18 18:34:36,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5378 states. [2019-12-18 18:34:36,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5378 states to 5378 states and 15312 transitions. [2019-12-18 18:34:36,112 INFO L78 Accepts]: Start accepts. Automaton has 5378 states and 15312 transitions. Word has length 65 [2019-12-18 18:34:36,113 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:36,113 INFO L462 AbstractCegarLoop]: Abstraction has 5378 states and 15312 transitions. [2019-12-18 18:34:36,113 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:34:36,113 INFO L276 IsEmpty]: Start isEmpty. Operand 5378 states and 15312 transitions. [2019-12-18 18:34:36,124 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2019-12-18 18:34:36,124 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:36,125 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:36,125 INFO L410 AbstractCegarLoop]: === Iteration 12 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:36,125 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:36,126 INFO L82 PathProgramCache]: Analyzing trace with hash 373738635, now seen corresponding path program 1 times [2019-12-18 18:34:36,126 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:36,126 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376868627] [2019-12-18 18:34:36,126 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:36,180 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:34:36,322 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376868627] [2019-12-18 18:34:36,323 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:36,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:34:36,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1094438519] [2019-12-18 18:34:36,323 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:34:36,323 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:36,324 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:34:36,324 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:34:36,324 INFO L87 Difference]: Start difference. First operand 5378 states and 15312 transitions. Second operand 3 states. [2019-12-18 18:34:36,353 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:36,353 INFO L93 Difference]: Finished difference Result 5378 states and 15072 transitions. [2019-12-18 18:34:36,353 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:34:36,353 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 66 [2019-12-18 18:34:36,354 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:36,361 INFO L225 Difference]: With dead ends: 5378 [2019-12-18 18:34:36,361 INFO L226 Difference]: Without dead ends: 5378 [2019-12-18 18:34:36,362 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:34:36,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5378 states. [2019-12-18 18:34:36,447 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5378 to 5174. [2019-12-18 18:34:36,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5174 states. [2019-12-18 18:34:36,460 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5174 states to 5174 states and 14518 transitions. [2019-12-18 18:34:36,460 INFO L78 Accepts]: Start accepts. Automaton has 5174 states and 14518 transitions. Word has length 66 [2019-12-18 18:34:36,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:36,462 INFO L462 AbstractCegarLoop]: Abstraction has 5174 states and 14518 transitions. [2019-12-18 18:34:36,462 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:34:36,462 INFO L276 IsEmpty]: Start isEmpty. Operand 5174 states and 14518 transitions. [2019-12-18 18:34:36,471 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2019-12-18 18:34:36,471 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:36,472 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:36,472 INFO L410 AbstractCegarLoop]: === Iteration 13 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:36,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:36,472 INFO L82 PathProgramCache]: Analyzing trace with hash 184206773, now seen corresponding path program 1 times [2019-12-18 18:34:36,472 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:36,473 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [216789846] [2019-12-18 18:34:36,473 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:36,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:36,630 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:34:36,630 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [216789846] [2019-12-18 18:34:36,631 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:36,631 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-12-18 18:34:36,631 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084355610] [2019-12-18 18:34:36,631 INFO L442 AbstractCegarLoop]: Interpolant automaton has 3 states [2019-12-18 18:34:36,632 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:36,632 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2019-12-18 18:34:36,632 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:34:36,632 INFO L87 Difference]: Start difference. First operand 5174 states and 14518 transitions. Second operand 3 states. [2019-12-18 18:34:36,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:36,690 INFO L93 Difference]: Finished difference Result 5174 states and 14517 transitions. [2019-12-18 18:34:36,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2019-12-18 18:34:36,690 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 67 [2019-12-18 18:34:36,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:36,699 INFO L225 Difference]: With dead ends: 5174 [2019-12-18 18:34:36,700 INFO L226 Difference]: Without dead ends: 5174 [2019-12-18 18:34:36,700 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 1 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2019-12-18 18:34:36,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5174 states. [2019-12-18 18:34:36,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5174 to 2987. [2019-12-18 18:34:36,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2987 states. [2019-12-18 18:34:36,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2987 states to 2987 states and 8451 transitions. [2019-12-18 18:34:36,783 INFO L78 Accepts]: Start accepts. Automaton has 2987 states and 8451 transitions. Word has length 67 [2019-12-18 18:34:36,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:36,783 INFO L462 AbstractCegarLoop]: Abstraction has 2987 states and 8451 transitions. [2019-12-18 18:34:36,783 INFO L463 AbstractCegarLoop]: Interpolant automaton has 3 states. [2019-12-18 18:34:36,783 INFO L276 IsEmpty]: Start isEmpty. Operand 2987 states and 8451 transitions. [2019-12-18 18:34:36,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 18:34:36,789 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:36,789 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:36,789 INFO L410 AbstractCegarLoop]: === Iteration 14 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:36,790 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:36,790 INFO L82 PathProgramCache]: Analyzing trace with hash 823194101, now seen corresponding path program 1 times [2019-12-18 18:34:36,790 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:36,791 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1122872544] [2019-12-18 18:34:36,791 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:36,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:38,113 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:34:38,113 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1122872544] [2019-12-18 18:34:38,114 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:38,114 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [20] imperfect sequences [] total 20 [2019-12-18 18:34:38,114 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [992980622] [2019-12-18 18:34:38,114 INFO L442 AbstractCegarLoop]: Interpolant automaton has 22 states [2019-12-18 18:34:38,114 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:38,115 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2019-12-18 18:34:38,115 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=388, Unknown=0, NotChecked=0, Total=462 [2019-12-18 18:34:38,115 INFO L87 Difference]: Start difference. First operand 2987 states and 8451 transitions. Second operand 22 states. [2019-12-18 18:34:45,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:45,666 INFO L93 Difference]: Finished difference Result 10119 states and 28558 transitions. [2019-12-18 18:34:45,667 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 77 states. [2019-12-18 18:34:45,667 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 68 [2019-12-18 18:34:45,667 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:45,680 INFO L225 Difference]: With dead ends: 10119 [2019-12-18 18:34:45,680 INFO L226 Difference]: Without dead ends: 10089 [2019-12-18 18:34:45,683 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 1 SyntacticMatches, 3 SemanticMatches, 83 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1952 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=1188, Invalid=5952, Unknown=0, NotChecked=0, Total=7140 [2019-12-18 18:34:45,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10089 states. [2019-12-18 18:34:45,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10089 to 4918. [2019-12-18 18:34:45,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4918 states. [2019-12-18 18:34:45,778 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4918 states to 4918 states and 13936 transitions. [2019-12-18 18:34:45,779 INFO L78 Accepts]: Start accepts. Automaton has 4918 states and 13936 transitions. Word has length 68 [2019-12-18 18:34:45,779 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:45,779 INFO L462 AbstractCegarLoop]: Abstraction has 4918 states and 13936 transitions. [2019-12-18 18:34:45,779 INFO L463 AbstractCegarLoop]: Interpolant automaton has 22 states. [2019-12-18 18:34:45,779 INFO L276 IsEmpty]: Start isEmpty. Operand 4918 states and 13936 transitions. [2019-12-18 18:34:45,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 18:34:45,785 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:45,785 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:45,786 INFO L410 AbstractCegarLoop]: === Iteration 15 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:45,786 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:45,786 INFO L82 PathProgramCache]: Analyzing trace with hash 417732525, now seen corresponding path program 2 times [2019-12-18 18:34:45,786 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:45,787 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [909501923] [2019-12-18 18:34:45,787 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:45,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:46,053 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:34:46,053 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [909501923] [2019-12-18 18:34:46,053 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:46,054 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 18:34:46,054 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2042226155] [2019-12-18 18:34:46,054 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 18:34:46,054 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:46,054 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 18:34:46,055 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=40, Invalid=142, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:34:46,055 INFO L87 Difference]: Start difference. First operand 4918 states and 13936 transitions. Second operand 14 states. [2019-12-18 18:34:46,816 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:46,817 INFO L93 Difference]: Finished difference Result 11548 states and 32509 transitions. [2019-12-18 18:34:46,817 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2019-12-18 18:34:46,817 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-18 18:34:46,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:46,825 INFO L225 Difference]: With dead ends: 11548 [2019-12-18 18:34:46,826 INFO L226 Difference]: Without dead ends: 5665 [2019-12-18 18:34:46,826 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 2 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 104 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=148, Invalid=502, Unknown=0, NotChecked=0, Total=650 [2019-12-18 18:34:46,843 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5665 states. [2019-12-18 18:34:46,881 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5665 to 4590. [2019-12-18 18:34:46,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4590 states. [2019-12-18 18:34:46,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4590 states to 4590 states and 12969 transitions. [2019-12-18 18:34:46,889 INFO L78 Accepts]: Start accepts. Automaton has 4590 states and 12969 transitions. Word has length 68 [2019-12-18 18:34:46,889 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:46,889 INFO L462 AbstractCegarLoop]: Abstraction has 4590 states and 12969 transitions. [2019-12-18 18:34:46,889 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 18:34:46,889 INFO L276 IsEmpty]: Start isEmpty. Operand 4590 states and 12969 transitions. [2019-12-18 18:34:46,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 18:34:46,895 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:46,895 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:46,895 INFO L410 AbstractCegarLoop]: === Iteration 16 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:46,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:46,896 INFO L82 PathProgramCache]: Analyzing trace with hash -1234514493, now seen corresponding path program 3 times [2019-12-18 18:34:46,896 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:46,896 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [431976183] [2019-12-18 18:34:46,896 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:46,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-12-18 18:34:47,169 WARN L192 SmtUtils]: Spent 102.00 ms on a formula simplification. DAG size of input: 15 DAG size of output: 12 [2019-12-18 18:34:47,221 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-12-18 18:34:47,221 INFO L348 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [431976183] [2019-12-18 18:34:47,224 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-12-18 18:34:47,224 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2019-12-18 18:34:47,225 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2011075435] [2019-12-18 18:34:47,226 INFO L442 AbstractCegarLoop]: Interpolant automaton has 14 states [2019-12-18 18:34:47,226 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-12-18 18:34:47,226 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2019-12-18 18:34:47,227 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2019-12-18 18:34:47,227 INFO L87 Difference]: Start difference. First operand 4590 states and 12969 transitions. Second operand 14 states. [2019-12-18 18:34:47,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-12-18 18:34:47,901 INFO L93 Difference]: Finished difference Result 6321 states and 17664 transitions. [2019-12-18 18:34:47,902 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2019-12-18 18:34:47,902 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 68 [2019-12-18 18:34:47,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-12-18 18:34:47,911 INFO L225 Difference]: With dead ends: 6321 [2019-12-18 18:34:47,911 INFO L226 Difference]: Without dead ends: 6291 [2019-12-18 18:34:47,911 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 164 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=195, Invalid=735, Unknown=0, NotChecked=0, Total=930 [2019-12-18 18:34:47,929 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6291 states. [2019-12-18 18:34:47,967 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6291 to 4067. [2019-12-18 18:34:47,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4067 states. [2019-12-18 18:34:47,973 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4067 states to 4067 states and 11322 transitions. [2019-12-18 18:34:47,973 INFO L78 Accepts]: Start accepts. Automaton has 4067 states and 11322 transitions. Word has length 68 [2019-12-18 18:34:47,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-12-18 18:34:47,973 INFO L462 AbstractCegarLoop]: Abstraction has 4067 states and 11322 transitions. [2019-12-18 18:34:47,973 INFO L463 AbstractCegarLoop]: Interpolant automaton has 14 states. [2019-12-18 18:34:47,974 INFO L276 IsEmpty]: Start isEmpty. Operand 4067 states and 11322 transitions. [2019-12-18 18:34:47,978 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 69 [2019-12-18 18:34:47,978 INFO L403 BasicCegarLoop]: Found error trace [2019-12-18 18:34:47,979 INFO L411 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-12-18 18:34:47,979 INFO L410 AbstractCegarLoop]: === Iteration 17 === [P0Err0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2INUSE_VIOLATION, ULTIMATE.startErr1INUSE_VIOLATION, ULTIMATE.startErr0INUSE_VIOLATION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, P0Err0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-12-18 18:34:47,979 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-12-18 18:34:47,979 INFO L82 PathProgramCache]: Analyzing trace with hash 1851838847, now seen corresponding path program 4 times [2019-12-18 18:34:47,980 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2019-12-18 18:34:47,980 INFO L348 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551708342] [2019-12-18 18:34:47,980 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-12-18 18:34:48,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:34:48,054 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2019-12-18 18:34:48,105 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2019-12-18 18:34:48,106 INFO L476 BasicCegarLoop]: Counterexample might be feasible [2019-12-18 18:34:48,110 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [825] [825] ULTIMATE.startENTRY-->L805: Formula: (let ((.cse0 (store |v_#valid_55| 0 0))) (and (= v_~__unbuffered_cnt~0_140 0) (= 0 v_~z$flush_delayed~0_34) (= (store |v_#length_26| |v_ULTIMATE.start_main_~#t2037~0.base_21| 4) |v_#length_25|) (= v_~z$r_buff1_thd0~0_308 0) (= 0 (select .cse0 |v_ULTIMATE.start_main_~#t2037~0.base_21|)) (< |v_#StackHeapBarrier_18| |v_ULTIMATE.start_main_~#t2037~0.base_21|) (= v_~z$w_buff1_used~0_516 0) (= v_~z$r_buff1_thd1~0_190 0) (= v_~z$read_delayed~0_8 0) (= |v_#valid_53| (store .cse0 |v_ULTIMATE.start_main_~#t2037~0.base_21| 1)) (= v_~z$w_buff0~0_342 0) (= v_~main$tmp_guard1~0_21 0) (= v_~z$read_delayed_var~0.offset_7 0) (< 0 |v_#StackHeapBarrier_18|) (= v_~z$r_buff1_thd2~0_206 0) (= v_~y~0_34 0) (= (store |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2037~0.base_21| (store (select |v_#memory_int_22| |v_ULTIMATE.start_main_~#t2037~0.base_21|) |v_ULTIMATE.start_main_~#t2037~0.offset_17| 0)) |v_#memory_int_21|) (= 0 |v_#NULL.base_4|) (= 0 v_~z$r_buff0_thd3~0_140) (= v_~z$read_delayed_var~0.base_7 0) (= v_~z$r_buff0_thd1~0_226 0) (= 0 |v_ULTIMATE.start_main_~#t2037~0.offset_17|) (= v_~main$tmp_guard0~0_21 0) (= v_~weak$$choice2~0_109 0) (= v_~z$mem_tmp~0_19 0) (= v_~z$r_buff0_thd0~0_374 0) (= |v_#NULL.offset_4| 0) (= 0 v_~z$r_buff1_thd3~0_196) (= v_~z$r_buff0_thd2~0_140 0) (= 0 v_~__unbuffered_p2_EAX~0_36) (= v_~z$w_buff0_used~0_875 0) (= 0 v_~weak$$choice0~0_13) (= v_~z$w_buff1~0_249 0) (= 0 v_~x~0_138) (= v_~z~0_182 0))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_18|, #valid=|v_#valid_55|, #memory_int=|v_#memory_int_22|, #length=|v_#length_26|} OutVars{ULTIMATE.start_main_#t~nondet30=|v_ULTIMATE.start_main_#t~nondet30_21|, ULTIMATE.start_main_~#t2039~0.offset=|v_ULTIMATE.start_main_~#t2039~0.offset_16|, ULTIMATE.start_main_#t~ite28=|v_ULTIMATE.start_main_#t~ite28_27|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_206, ULTIMATE.start_main_#t~ite24=|v_ULTIMATE.start_main_#t~ite24_39|, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_29|, #NULL.offset=|v_#NULL.offset_4|, ULTIMATE.start_main_#t~ite26=|v_ULTIMATE.start_main_#t~ite26_29|, ULTIMATE.start_main_#t~ite49=|v_ULTIMATE.start_main_#t~ite49_49|, ULTIMATE.start_main_#t~ite43=|v_ULTIMATE.start_main_#t~ite43_47|, ULTIMATE.start_main_#t~ite45=|v_ULTIMATE.start_main_#t~ite45_25|, ULTIMATE.start_main_#t~ite50=|v_ULTIMATE.start_main_#t~ite50_45|, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_32|, ~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_374, ULTIMATE.start_main_~#t2038~0.base=|v_ULTIMATE.start_main_~#t2038~0.base_20|, #length=|v_#length_25|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_36, ~z$mem_tmp~0=v_~z$mem_tmp~0_19, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_10|, ULTIMATE.start_main_#t~ite39=|v_ULTIMATE.start_main_#t~ite39_43|, ULTIMATE.start_main_#t~ite35=|v_ULTIMATE.start_main_#t~ite35_42|, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_516, ULTIMATE.start_main_#t~ite37=|v_ULTIMATE.start_main_#t~ite37_52|, ~z$flush_delayed~0=v_~z$flush_delayed~0_34, ULTIMATE.start_main_#t~ite33=|v_ULTIMATE.start_main_#t~ite33_111|, ~weak$$choice0~0=v_~weak$$choice0~0_13, #StackHeapBarrier=|v_#StackHeapBarrier_18|, ULTIMATE.start_main_#t~ite40=|v_ULTIMATE.start_main_#t~ite40_32|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_190, ~z$read_delayed_var~0.base=v_~z$read_delayed_var~0.base_7, ~z$r_buff0_thd3~0=v_~z$r_buff0_thd3~0_140, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_140, ULTIMATE.start_main_~#t2039~0.base=|v_ULTIMATE.start_main_~#t2039~0.base_20|, ~x~0=v_~x~0_138, ULTIMATE.start_main_#t~nondet31=|v_ULTIMATE.start_main_#t~nondet31_21|, ULTIMATE.start_main_#t~ite29=|v_ULTIMATE.start_main_#t~ite29_33|, ~z$read_delayed~0=v_~z$read_delayed~0_8, ULTIMATE.start_main_#t~ite25=|v_ULTIMATE.start_main_#t~ite25_31|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_29|, ~z$w_buff1~0=v_~z$w_buff1~0_249, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_21, ULTIMATE.start_main_#t~ite27=|v_ULTIMATE.start_main_#t~ite27_121|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_17|, ~z$read_delayed_var~0.offset=v_~z$read_delayed_var~0.offset_7, ULTIMATE.start_main_#t~ite42=|v_ULTIMATE.start_main_#t~ite42_25|, ULTIMATE.start_main_~#t2037~0.base=|v_ULTIMATE.start_main_~#t2037~0.base_21|, ULTIMATE.start_main_#t~ite44=|v_ULTIMATE.start_main_#t~ite44_41|, ULTIMATE.start_main_~#t2038~0.offset=|v_ULTIMATE.start_main_~#t2038~0.offset_17|, ULTIMATE.start_main_#t~ite51=|v_ULTIMATE.start_main_#t~ite51_31|, ~z$r_buff1_thd0~0=v_~z$r_buff1_thd0~0_308, ~y~0=v_~y~0_34, ~z$r_buff0_thd2~0=v_~z$r_buff0_thd2~0_140, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_10|, ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_21|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_875, ~z$w_buff0~0=v_~z$w_buff0~0_342, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_196, ULTIMATE.start_main_#t~ite36=|v_ULTIMATE.start_main_#t~ite36_25|, ULTIMATE.start_main_#t~ite38=|v_ULTIMATE.start_main_#t~ite38_54|, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_21, ULTIMATE.start_main_#t~ite32=|v_ULTIMATE.start_main_#t~ite32_59|, #NULL.base=|v_#NULL.base_4|, ULTIMATE.start_main_#t~ite34=|v_ULTIMATE.start_main_#t~ite34_38|, ULTIMATE.start_main_#t~ite41=|v_ULTIMATE.start_main_#t~ite41_32|, ULTIMATE.start_main_#res=|v_ULTIMATE.start_main_#res_20|, #valid=|v_#valid_53|, #memory_int=|v_#memory_int_21|, ~z~0=v_~z~0_182, ULTIMATE.start_main_~#t2037~0.offset=|v_ULTIMATE.start_main_~#t2037~0.offset_17|, ~weak$$choice2~0=v_~weak$$choice2~0_109, ~z$r_buff0_thd1~0=v_~z$r_buff0_thd1~0_226} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet30, ULTIMATE.start_main_~#t2039~0.offset, ULTIMATE.start_main_#t~ite28, ~z$r_buff1_thd2~0, ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite47, #NULL.offset, ULTIMATE.start_main_#t~ite26, ULTIMATE.start_main_#t~ite49, ULTIMATE.start_main_#t~ite43, ULTIMATE.start_main_#t~ite45, ULTIMATE.start_main_#t~ite50, ULTIMATE.start_main_#t~ite52, ~z$r_buff0_thd0~0, ULTIMATE.start_main_~#t2038~0.base, #length, ~__unbuffered_p2_EAX~0, ~z$mem_tmp~0, ULTIMATE.start_main_#t~nondet22, ULTIMATE.start_main_#t~ite39, ULTIMATE.start_main_#t~ite35, ~z$w_buff1_used~0, ULTIMATE.start_main_#t~ite37, ~z$flush_delayed~0, ULTIMATE.start_main_#t~ite33, ~weak$$choice0~0, ULTIMATE.start_main_#t~ite40, ~z$r_buff1_thd1~0, ~z$read_delayed_var~0.base, ~z$r_buff0_thd3~0, ~__unbuffered_cnt~0, ULTIMATE.start_main_~#t2039~0.base, ~x~0, ULTIMATE.start_main_#t~nondet31, ULTIMATE.start_main_#t~ite29, ~z$read_delayed~0, ULTIMATE.start_main_#t~ite25, ULTIMATE.start_main_#t~ite46, ~z$w_buff1~0, ~main$tmp_guard1~0, ULTIMATE.start_main_#t~ite27, ULTIMATE.start_main_#t~ite48, ~z$read_delayed_var~0.offset, ULTIMATE.start_main_#t~ite42, ULTIMATE.start_main_~#t2037~0.base, ULTIMATE.start_main_#t~ite44, ULTIMATE.start_main_~#t2038~0.offset, ULTIMATE.start_main_#t~ite51, ~z$r_buff1_thd0~0, ~y~0, ~z$r_buff0_thd2~0, ULTIMATE.start_main_#t~nondet21, ULTIMATE.start_main_#t~nondet23, ~z$w_buff0_used~0, ~z$w_buff0~0, ~z$r_buff1_thd3~0, ULTIMATE.start_main_#t~ite36, ULTIMATE.start_main_#t~ite38, ~main$tmp_guard0~0, ULTIMATE.start_main_#t~ite32, #NULL.base, ULTIMATE.start_main_#t~ite34, ULTIMATE.start_main_#t~ite41, ULTIMATE.start_main_#res, #valid, #memory_int, ~z~0, ULTIMATE.start_main_~#t2037~0.offset, ~weak$$choice2~0, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 18:34:48,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [803] [803] L805-1-->L807: Formula: (and (< |v_#StackHeapBarrier_12| |v_ULTIMATE.start_main_~#t2038~0.base_12|) (not (= |v_ULTIMATE.start_main_~#t2038~0.base_12| 0)) (= |v_#length_17| (store |v_#length_18| |v_ULTIMATE.start_main_~#t2038~0.base_12| 4)) (= (store |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2038~0.base_12| (store (select |v_#memory_int_14| |v_ULTIMATE.start_main_~#t2038~0.base_12|) |v_ULTIMATE.start_main_~#t2038~0.offset_11| 1)) |v_#memory_int_13|) (= (store |v_#valid_35| |v_ULTIMATE.start_main_~#t2038~0.base_12| 1) |v_#valid_34|) (= 0 |v_ULTIMATE.start_main_~#t2038~0.offset_11|) (= 0 (select |v_#valid_35| |v_ULTIMATE.start_main_~#t2038~0.base_12|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_12|, #valid=|v_#valid_35|, #memory_int=|v_#memory_int_14|, #length=|v_#length_18|} OutVars{ULTIMATE.start_main_~#t2038~0.offset=|v_ULTIMATE.start_main_~#t2038~0.offset_11|, #StackHeapBarrier=|v_#StackHeapBarrier_12|, ULTIMATE.start_main_#t~nondet21=|v_ULTIMATE.start_main_#t~nondet21_6|, #valid=|v_#valid_34|, #memory_int=|v_#memory_int_13|, ULTIMATE.start_main_~#t2038~0.base=|v_ULTIMATE.start_main_~#t2038~0.base_12|, #length=|v_#length_17|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2038~0.offset, ULTIMATE.start_main_#t~nondet21, #valid, #memory_int, ULTIMATE.start_main_~#t2038~0.base, #length] because there is no mapped edge [2019-12-18 18:34:48,111 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [724] [724] P0ENTRY-->L4-3: Formula: (and (= v_~z$w_buff0_used~0_226 v_~z$w_buff1_used~0_114) (= 2 v_~z$w_buff0~0_55) (= v_~z$w_buff0~0_56 v_~z$w_buff1~0_53) (= v_P0Thread1of1ForFork0_~arg.base_22 |v_P0Thread1of1ForFork0_#in~arg.base_22|) (= 0 (mod v_~z$w_buff1_used~0_114 256)) (= v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_26 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_22|) (= v_P0Thread1of1ForFork0_~arg.offset_22 |v_P0Thread1of1ForFork0_#in~arg.offset_22|) (= 1 |v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_22|) (= v_~z$w_buff0_used~0_225 1)) InVars {P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_226, ~z$w_buff0~0=v_~z$w_buff0~0_56, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_22|} OutVars{P0Thread1of1ForFork0_#in~arg.offset=|v_P0Thread1of1ForFork0_#in~arg.offset_22|, ~z$w_buff0_used~0=v_~z$w_buff0_used~0_225, ~z$w_buff0~0=v_~z$w_buff0~0_55, P0Thread1of1ForFork0___VERIFIER_assert_~expression=v_P0Thread1of1ForFork0___VERIFIER_assert_~expression_26, ~z$w_buff1_used~0=v_~z$w_buff1_used~0_114, P0Thread1of1ForFork0_#in~arg.base=|v_P0Thread1of1ForFork0_#in~arg.base_22|, ~z$w_buff1~0=v_~z$w_buff1~0_53, P0Thread1of1ForFork0_~arg.base=v_P0Thread1of1ForFork0_~arg.base_22, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression=|v_P0Thread1of1ForFork0___VERIFIER_assert_#in~expression_22|, P0Thread1of1ForFork0_~arg.offset=v_P0Thread1of1ForFork0_~arg.offset_22} AuxVars[] AssignedVars[~z$w_buff0_used~0, ~z$w_buff0~0, P0Thread1of1ForFork0___VERIFIER_assert_~expression, ~z$w_buff1_used~0, ~z$w_buff1~0, P0Thread1of1ForFork0_~arg.base, P0Thread1of1ForFork0___VERIFIER_assert_#in~expression, P0Thread1of1ForFork0_~arg.offset] because there is no mapped edge [2019-12-18 18:34:48,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [789] [789] L807-1-->L809: Formula: (and (= |v_#valid_27| (store |v_#valid_28| |v_ULTIMATE.start_main_~#t2039~0.base_9| 1)) (= |v_#length_13| (store |v_#length_14| |v_ULTIMATE.start_main_~#t2039~0.base_9| 4)) (= 0 |v_ULTIMATE.start_main_~#t2039~0.offset_8|) (< |v_#StackHeapBarrier_9| |v_ULTIMATE.start_main_~#t2039~0.base_9|) (= (store |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2039~0.base_9| (store (select |v_#memory_int_10| |v_ULTIMATE.start_main_~#t2039~0.base_9|) |v_ULTIMATE.start_main_~#t2039~0.offset_8| 2)) |v_#memory_int_9|) (not (= |v_ULTIMATE.start_main_~#t2039~0.base_9| 0)) (= 0 (select |v_#valid_28| |v_ULTIMATE.start_main_~#t2039~0.base_9|))) InVars {#StackHeapBarrier=|v_#StackHeapBarrier_9|, #valid=|v_#valid_28|, #memory_int=|v_#memory_int_10|, #length=|v_#length_14|} OutVars{#StackHeapBarrier=|v_#StackHeapBarrier_9|, ULTIMATE.start_main_~#t2039~0.offset=|v_ULTIMATE.start_main_~#t2039~0.offset_8|, ULTIMATE.start_main_#t~nondet22=|v_ULTIMATE.start_main_#t~nondet22_5|, #valid=|v_#valid_27|, #memory_int=|v_#memory_int_9|, #length=|v_#length_13|, ULTIMATE.start_main_~#t2039~0.base=|v_ULTIMATE.start_main_~#t2039~0.base_9|} AuxVars[] AssignedVars[ULTIMATE.start_main_~#t2039~0.offset, ULTIMATE.start_main_#t~nondet22, #valid, #memory_int, #length, ULTIMATE.start_main_~#t2039~0.base] because there is no mapped edge [2019-12-18 18:34:48,113 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [776] [776] L743-->L743-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd1~0_In-1090612400 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-1090612400 256) 0))) (or (and (= ~z$w_buff0_used~0_In-1090612400 |P0Thread1of1ForFork0_#t~ite5_Out-1090612400|) (or .cse0 .cse1)) (and (= 0 |P0Thread1of1ForFork0_#t~ite5_Out-1090612400|) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1090612400, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1090612400} OutVars{P0Thread1of1ForFork0_#t~ite5=|P0Thread1of1ForFork0_#t~ite5_Out-1090612400|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1090612400, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1090612400} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite5] because there is no mapped edge [2019-12-18 18:34:48,114 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [771] [771] L744-->L744-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In-1479536370 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd1~0_In-1479536370 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd1~0_In-1479536370 256))) (.cse2 (= (mod ~z$w_buff1_used~0_In-1479536370 256) 0))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P0Thread1of1ForFork0_#t~ite6_Out-1479536370| 0)) (and (or .cse1 .cse0) (= |P0Thread1of1ForFork0_#t~ite6_Out-1479536370| ~z$w_buff1_used~0_In-1479536370) (or .cse3 .cse2)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1479536370, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1479536370, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1479536370, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1479536370} OutVars{P0Thread1of1ForFork0_#t~ite6=|P0Thread1of1ForFork0_#t~ite6_Out-1479536370|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In-1479536370, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1479536370, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1479536370, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1479536370} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite6] because there is no mapped edge [2019-12-18 18:34:48,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [782] [782] L745-->L746: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd1~0_In-1510233316 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In-1510233316 256) 0))) (or (and (not .cse0) (not .cse1) (= ~z$r_buff0_thd1~0_Out-1510233316 0)) (and (= ~z$r_buff0_thd1~0_Out-1510233316 ~z$r_buff0_thd1~0_In-1510233316) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1510233316, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1510233316} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1510233316, P0Thread1of1ForFork0_#t~ite7=|P0Thread1of1ForFork0_#t~ite7_Out-1510233316|, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_Out-1510233316} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite7, ~z$r_buff0_thd1~0] because there is no mapped edge [2019-12-18 18:34:48,116 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [777] [777] L746-->L746-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd1~0_In-1103289594 256))) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1103289594 256))) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In-1103289594 256))) (.cse1 (= 0 (mod ~z$r_buff1_thd1~0_In-1103289594 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= |P0Thread1of1ForFork0_#t~ite8_Out-1103289594| ~z$r_buff1_thd1~0_In-1103289594)) (and (= |P0Thread1of1ForFork0_#t~ite8_Out-1103289594| 0) (or (and (not .cse2) (not .cse3)) (and (not .cse0) (not .cse1)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1103289594, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1103289594, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1103289594, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1103289594} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1103289594, P0Thread1of1ForFork0_#t~ite8=|P0Thread1of1ForFork0_#t~ite8_Out-1103289594|, ~z$r_buff1_thd1~0=~z$r_buff1_thd1~0_In-1103289594, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1103289594, ~z$r_buff0_thd1~0=~z$r_buff0_thd1~0_In-1103289594} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#t~ite8] because there is no mapped edge [2019-12-18 18:34:48,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [795] [795] L746-2-->P0EXIT: Formula: (and (= (+ v_~__unbuffered_cnt~0_44 1) v_~__unbuffered_cnt~0_43) (= 0 |v_P0Thread1of1ForFork0_#res.base_5|) (= |v_P0Thread1of1ForFork0_#res.offset_5| 0) (= v_~z$r_buff1_thd1~0_63 |v_P0Thread1of1ForFork0_#t~ite8_28|)) InVars {P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_28|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_44} OutVars{P0Thread1of1ForFork0_#res.offset=|v_P0Thread1of1ForFork0_#res.offset_5|, P0Thread1of1ForFork0_#t~ite8=|v_P0Thread1of1ForFork0_#t~ite8_27|, ~z$r_buff1_thd1~0=v_~z$r_buff1_thd1~0_63, P0Thread1of1ForFork0_#res.base=|v_P0Thread1of1ForFork0_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_43} AuxVars[] AssignedVars[P0Thread1of1ForFork0_#res.offset, P0Thread1of1ForFork0_#t~ite8, ~z$r_buff1_thd1~0, P0Thread1of1ForFork0_#res.base, ~__unbuffered_cnt~0] because there is no mapped edge [2019-12-18 18:34:48,117 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [767] [767] L762-2-->L762-5: Formula: (let ((.cse0 (= 0 (mod ~z$w_buff1_used~0_In1373234748 256))) (.cse2 (= 0 (mod ~z$r_buff1_thd2~0_In1373234748 256))) (.cse1 (= |P1Thread1of1ForFork1_#t~ite10_Out1373234748| |P1Thread1of1ForFork1_#t~ite9_Out1373234748|))) (or (and (not .cse0) (= ~z$w_buff1~0_In1373234748 |P1Thread1of1ForFork1_#t~ite9_Out1373234748|) .cse1 (not .cse2)) (and (or .cse0 .cse2) .cse1 (= ~z~0_In1373234748 |P1Thread1of1ForFork1_#t~ite9_Out1373234748|)))) InVars {~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1373234748, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1373234748, ~z$w_buff1~0=~z$w_buff1~0_In1373234748, ~z~0=~z~0_In1373234748} OutVars{P1Thread1of1ForFork1_#t~ite9=|P1Thread1of1ForFork1_#t~ite9_Out1373234748|, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1373234748, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1373234748, P1Thread1of1ForFork1_#t~ite10=|P1Thread1of1ForFork1_#t~ite10_Out1373234748|, ~z$w_buff1~0=~z$w_buff1~0_In1373234748, ~z~0=~z~0_In1373234748} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite9, P1Thread1of1ForFork1_#t~ite10] because there is no mapped edge [2019-12-18 18:34:48,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [762] [762] L782-2-->L782-4: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In-1137760494 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-1137760494 256) 0))) (or (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite15_Out-1137760494| ~z$w_buff1~0_In-1137760494)) (and (= |P2Thread1of1ForFork2_#t~ite15_Out-1137760494| ~z~0_In-1137760494) (or .cse0 .cse1)))) InVars {~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1137760494, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1137760494, ~z$w_buff1~0=~z$w_buff1~0_In-1137760494, ~z~0=~z~0_In-1137760494} OutVars{P2Thread1of1ForFork2_#t~ite15=|P2Thread1of1ForFork2_#t~ite15_Out-1137760494|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1137760494, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1137760494, ~z$w_buff1~0=~z$w_buff1~0_In-1137760494, ~z~0=~z~0_In-1137760494} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15] because there is no mapped edge [2019-12-18 18:34:48,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [689] [689] L782-4-->L783: Formula: (= v_~z~0_20 |v_P2Thread1of1ForFork2_#t~ite15_10|) InVars {P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_10|} OutVars{P2Thread1of1ForFork2_#t~ite15=|v_P2Thread1of1ForFork2_#t~ite15_9|, ~z~0=v_~z~0_20, P2Thread1of1ForFork2_#t~ite16=|v_P2Thread1of1ForFork2_#t~ite16_13|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite15, ~z~0, P2Thread1of1ForFork2_#t~ite16] because there is no mapped edge [2019-12-18 18:34:48,118 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [774] [774] L783-->L783-2: Formula: (let ((.cse1 (= 0 (mod ~z$r_buff0_thd3~0_In84214287 256))) (.cse0 (= (mod ~z$w_buff0_used~0_In84214287 256) 0))) (or (and (not .cse0) (= 0 |P2Thread1of1ForFork2_#t~ite17_Out84214287|) (not .cse1)) (and (= ~z$w_buff0_used~0_In84214287 |P2Thread1of1ForFork2_#t~ite17_Out84214287|) (or .cse1 .cse0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In84214287, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In84214287} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In84214287, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In84214287, P2Thread1of1ForFork2_#t~ite17=|P2Thread1of1ForFork2_#t~ite17_Out84214287|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite17] because there is no mapped edge [2019-12-18 18:34:48,119 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [772] [772] L784-->L784-2: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd3~0_In-1151936937 256) 0)) (.cse1 (= 0 (mod ~z$w_buff1_used~0_In-1151936937 256))) (.cse2 (= (mod ~z$r_buff0_thd3~0_In-1151936937 256) 0)) (.cse3 (= 0 (mod ~z$w_buff0_used~0_In-1151936937 256)))) (or (and (= ~z$w_buff1_used~0_In-1151936937 |P2Thread1of1ForFork2_#t~ite18_Out-1151936937|) (or .cse0 .cse1) (or .cse2 .cse3)) (and (= |P2Thread1of1ForFork2_#t~ite18_Out-1151936937| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1151936937, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1151936937, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1151936937, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1151936937} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1151936937, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In-1151936937, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-1151936937, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1151936937, P2Thread1of1ForFork2_#t~ite18=|P2Thread1of1ForFork2_#t~ite18_Out-1151936937|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite18] because there is no mapped edge [2019-12-18 18:34:48,120 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [757] [757] L785-->L785-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd3~0_In-1865051232 256) 0)) (.cse1 (= 0 (mod ~z$w_buff0_used~0_In-1865051232 256)))) (or (and (or .cse0 .cse1) (= ~z$r_buff0_thd3~0_In-1865051232 |P2Thread1of1ForFork2_#t~ite19_Out-1865051232|)) (and (not .cse0) (not .cse1) (= |P2Thread1of1ForFork2_#t~ite19_Out-1865051232| 0)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-1865051232, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1865051232} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-1865051232, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In-1865051232, P2Thread1of1ForFork2_#t~ite19=|P2Thread1of1ForFork2_#t~ite19_Out-1865051232|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite19] because there is no mapped edge [2019-12-18 18:34:48,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [763] [763] L786-->L786-2: Formula: (let ((.cse3 (= (mod ~z$r_buff1_thd3~0_In562102990 256) 0)) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In562102990 256))) (.cse1 (= (mod ~z$w_buff0_used~0_In562102990 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd3~0_In562102990 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= 0 |P2Thread1of1ForFork2_#t~ite20_Out562102990|)) (and (or .cse3 .cse2) (or .cse1 .cse0) (= ~z$r_buff1_thd3~0_In562102990 |P2Thread1of1ForFork2_#t~ite20_Out562102990|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In562102990, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In562102990, ~z$w_buff1_used~0=~z$w_buff1_used~0_In562102990, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In562102990} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In562102990, P2Thread1of1ForFork2_#t~ite20=|P2Thread1of1ForFork2_#t~ite20_Out562102990|, ~z$r_buff1_thd3~0=~z$r_buff1_thd3~0_In562102990, ~z$w_buff1_used~0=~z$w_buff1_used~0_In562102990, ~z$r_buff0_thd3~0=~z$r_buff0_thd3~0_In562102990} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20] because there is no mapped edge [2019-12-18 18:34:48,121 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [804] [804] L786-2-->P2EXIT: Formula: (and (= 0 |v_P2Thread1of1ForFork2_#res.base_5|) (= |v_P2Thread1of1ForFork2_#t~ite20_32| v_~z$r_buff1_thd3~0_67) (= |v_P2Thread1of1ForFork2_#res.offset_5| 0) (= v_~__unbuffered_cnt~0_54 (+ v_~__unbuffered_cnt~0_55 1))) InVars {P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_32|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_55} OutVars{P2Thread1of1ForFork2_#t~ite20=|v_P2Thread1of1ForFork2_#t~ite20_31|, ~z$r_buff1_thd3~0=v_~z$r_buff1_thd3~0_67, P2Thread1of1ForFork2_#res.base=|v_P2Thread1of1ForFork2_#res.base_5|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_54, P2Thread1of1ForFork2_#res.offset=|v_P2Thread1of1ForFork2_#res.offset_5|} AuxVars[] AssignedVars[P2Thread1of1ForFork2_#t~ite20, ~z$r_buff1_thd3~0, P2Thread1of1ForFork2_#res.base, ~__unbuffered_cnt~0, P2Thread1of1ForFork2_#res.offset] because there is no mapped edge [2019-12-18 18:34:48,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [760] [760] L763-->L763-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-2023309791 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-2023309791 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite11_Out-2023309791| ~z$w_buff0_used~0_In-2023309791) (or .cse0 .cse1)) (and (= |P1Thread1of1ForFork1_#t~ite11_Out-2023309791| 0) (not .cse0) (not .cse1)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-2023309791, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2023309791} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-2023309791, P1Thread1of1ForFork1_#t~ite11=|P1Thread1of1ForFork1_#t~ite11_Out-2023309791|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-2023309791} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite11] because there is no mapped edge [2019-12-18 18:34:48,122 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [778] [778] L764-->L764-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In217078471 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd2~0_In217078471 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In217078471 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd2~0_In217078471 256)))) (or (and (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3))) (= |P1Thread1of1ForFork1_#t~ite12_Out217078471| 0)) (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$w_buff1_used~0_In217078471 |P1Thread1of1ForFork1_#t~ite12_Out217078471|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In217078471, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In217078471, ~z$w_buff1_used~0=~z$w_buff1_used~0_In217078471, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In217078471} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In217078471, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In217078471, ~z$w_buff1_used~0=~z$w_buff1_used~0_In217078471, P1Thread1of1ForFork1_#t~ite12=|P1Thread1of1ForFork1_#t~ite12_Out217078471|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In217078471} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite12] because there is no mapped edge [2019-12-18 18:34:48,123 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [764] [764] L765-->L765-2: Formula: (let ((.cse0 (= (mod ~z$r_buff0_thd2~0_In-830781732 256) 0)) (.cse1 (= (mod ~z$w_buff0_used~0_In-830781732 256) 0))) (or (and (not .cse0) (= |P1Thread1of1ForFork1_#t~ite13_Out-830781732| 0) (not .cse1)) (and (or .cse0 .cse1) (= ~z$r_buff0_thd2~0_In-830781732 |P1Thread1of1ForFork1_#t~ite13_Out-830781732|)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In-830781732, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-830781732} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In-830781732, P1Thread1of1ForFork1_#t~ite13=|P1Thread1of1ForFork1_#t~ite13_Out-830781732|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In-830781732} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite13] because there is no mapped edge [2019-12-18 18:34:48,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [773] [773] L766-->L766-2: Formula: (let ((.cse2 (= 0 (mod ~z$r_buff0_thd2~0_In1919795003 256))) (.cse3 (= (mod ~z$w_buff0_used~0_In1919795003 256) 0)) (.cse0 (= 0 (mod ~z$r_buff1_thd2~0_In1919795003 256))) (.cse1 (= (mod ~z$w_buff1_used~0_In1919795003 256) 0))) (or (and (= |P1Thread1of1ForFork1_#t~ite14_Out1919795003| 0) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse2 .cse3) (or .cse0 .cse1) (= |P1Thread1of1ForFork1_#t~ite14_Out1919795003| ~z$r_buff1_thd2~0_In1919795003)))) InVars {~z$w_buff0_used~0=~z$w_buff0_used~0_In1919795003, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1919795003, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1919795003, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1919795003} OutVars{~z$w_buff0_used~0=~z$w_buff0_used~0_In1919795003, ~z$r_buff1_thd2~0=~z$r_buff1_thd2~0_In1919795003, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1919795003, P1Thread1of1ForFork1_#t~ite14=|P1Thread1of1ForFork1_#t~ite14_Out1919795003|, ~z$r_buff0_thd2~0=~z$r_buff0_thd2~0_In1919795003} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#t~ite14] because there is no mapped edge [2019-12-18 18:34:48,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [805] [805] L766-2-->P1EXIT: Formula: (and (= 0 |v_P1Thread1of1ForFork1_#res.base_5|) (= |v_P1Thread1of1ForFork1_#t~ite14_32| v_~z$r_buff1_thd2~0_84) (= (+ v_~__unbuffered_cnt~0_61 1) v_~__unbuffered_cnt~0_60) (= |v_P1Thread1of1ForFork1_#res.offset_5| 0)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_61, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_32|} OutVars{P1Thread1of1ForFork1_#res.offset=|v_P1Thread1of1ForFork1_#res.offset_5|, ~z$r_buff1_thd2~0=v_~z$r_buff1_thd2~0_84, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_60, P1Thread1of1ForFork1_#t~ite14=|v_P1Thread1of1ForFork1_#t~ite14_31|, P1Thread1of1ForFork1_#res.base=|v_P1Thread1of1ForFork1_#res.base_5|} AuxVars[] AssignedVars[P1Thread1of1ForFork1_#res.offset, ~z$r_buff1_thd2~0, ~__unbuffered_cnt~0, P1Thread1of1ForFork1_#t~ite14, P1Thread1of1ForFork1_#res.base] because there is no mapped edge [2019-12-18 18:34:48,124 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [708] [708] L809-1-->L815: Formula: (and (= 3 v_~__unbuffered_cnt~0_18) (= v_~main$tmp_guard0~0_8 1)) InVars {~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18} OutVars{ULTIMATE.start_main_#t~nondet23=|v_ULTIMATE.start_main_#t~nondet23_7|, ~__unbuffered_cnt~0=v_~__unbuffered_cnt~0_18, ~main$tmp_guard0~0=v_~main$tmp_guard0~0_8} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~nondet23, ~main$tmp_guard0~0] because there is no mapped edge [2019-12-18 18:34:48,125 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [761] [761] L815-2-->L815-5: Formula: (let ((.cse0 (= (mod ~z$r_buff1_thd0~0_In-278432559 256) 0)) (.cse1 (= (mod ~z$w_buff1_used~0_In-278432559 256) 0)) (.cse2 (= |ULTIMATE.start_main_#t~ite24_Out-278432559| |ULTIMATE.start_main_#t~ite25_Out-278432559|))) (or (and (= ~z~0_In-278432559 |ULTIMATE.start_main_#t~ite24_Out-278432559|) (or .cse0 .cse1) .cse2) (and (not .cse0) (= ~z$w_buff1~0_In-278432559 |ULTIMATE.start_main_#t~ite24_Out-278432559|) (not .cse1) .cse2))) InVars {~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-278432559, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-278432559, ~z$w_buff1~0=~z$w_buff1~0_In-278432559, ~z~0=~z~0_In-278432559} OutVars{~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In-278432559, ULTIMATE.start_main_#t~ite24=|ULTIMATE.start_main_#t~ite24_Out-278432559|, ~z$w_buff1_used~0=~z$w_buff1_used~0_In-278432559, ULTIMATE.start_main_#t~ite25=|ULTIMATE.start_main_#t~ite25_Out-278432559|, ~z$w_buff1~0=~z$w_buff1~0_In-278432559, ~z~0=~z~0_In-278432559} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite24, ULTIMATE.start_main_#t~ite25] because there is no mapped edge [2019-12-18 18:34:48,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [768] [768] L816-->L816-2: Formula: (let ((.cse1 (= (mod ~z$w_buff0_used~0_In201028752 256) 0)) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In201028752 256)))) (or (and (or .cse0 .cse1) (= |ULTIMATE.start_main_#t~ite26_Out201028752| ~z$w_buff0_used~0_In201028752)) (and (= 0 |ULTIMATE.start_main_#t~ite26_Out201028752|) (not .cse1) (not .cse0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In201028752, ~z$w_buff0_used~0=~z$w_buff0_used~0_In201028752} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In201028752, ~z$w_buff0_used~0=~z$w_buff0_used~0_In201028752, ULTIMATE.start_main_#t~ite26=|ULTIMATE.start_main_#t~ite26_Out201028752|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite26] because there is no mapped edge [2019-12-18 18:34:48,126 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [775] [775] L817-->L817-2: Formula: (let ((.cse1 (= (mod ~z$r_buff1_thd0~0_In1666281535 256) 0)) (.cse0 (= 0 (mod ~z$w_buff1_used~0_In1666281535 256))) (.cse2 (= 0 (mod ~z$w_buff0_used~0_In1666281535 256))) (.cse3 (= (mod ~z$r_buff0_thd0~0_In1666281535 256) 0))) (or (and (= 0 |ULTIMATE.start_main_#t~ite27_Out1666281535|) (or (and (not .cse0) (not .cse1)) (and (not .cse2) (not .cse3)))) (and (or .cse1 .cse0) (= ~z$w_buff1_used~0_In1666281535 |ULTIMATE.start_main_#t~ite27_Out1666281535|) (or .cse2 .cse3)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1666281535, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1666281535, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1666281535, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1666281535} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1666281535, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1666281535, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In1666281535, ~z$w_buff1_used~0=~z$w_buff1_used~0_In1666281535, ULTIMATE.start_main_#t~ite27=|ULTIMATE.start_main_#t~ite27_Out1666281535|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite27] because there is no mapped edge [2019-12-18 18:34:48,127 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [766] [766] L818-->L818-2: Formula: (let ((.cse0 (= (mod ~z$w_buff0_used~0_In1277560124 256) 0)) (.cse1 (= 0 (mod ~z$r_buff0_thd0~0_In1277560124 256)))) (or (and (= 0 |ULTIMATE.start_main_#t~ite28_Out1277560124|) (not .cse0) (not .cse1)) (and (= |ULTIMATE.start_main_#t~ite28_Out1277560124| ~z$r_buff0_thd0~0_In1277560124) (or .cse0 .cse1)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1277560124, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1277560124} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In1277560124, ULTIMATE.start_main_#t~ite28=|ULTIMATE.start_main_#t~ite28_Out1277560124|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In1277560124} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite28] because there is no mapped edge [2019-12-18 18:34:48,128 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [781] [781] L819-->L819-2: Formula: (let ((.cse1 (= 0 (mod ~z$w_buff0_used~0_In421732508 256))) (.cse0 (= 0 (mod ~z$r_buff0_thd0~0_In421732508 256))) (.cse2 (= 0 (mod ~z$w_buff1_used~0_In421732508 256))) (.cse3 (= 0 (mod ~z$r_buff1_thd0~0_In421732508 256)))) (or (and (or .cse0 .cse1) (or .cse2 .cse3) (= ~z$r_buff1_thd0~0_In421732508 |ULTIMATE.start_main_#t~ite29_Out421732508|)) (and (or (and (not .cse1) (not .cse0)) (and (not .cse2) (not .cse3))) (= |ULTIMATE.start_main_#t~ite29_Out421732508| 0)))) InVars {~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In421732508, ~z$w_buff0_used~0=~z$w_buff0_used~0_In421732508, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In421732508, ~z$w_buff1_used~0=~z$w_buff1_used~0_In421732508} OutVars{~z$r_buff0_thd0~0=~z$r_buff0_thd0~0_In421732508, ULTIMATE.start_main_#t~ite29=|ULTIMATE.start_main_#t~ite29_Out421732508|, ~z$w_buff0_used~0=~z$w_buff0_used~0_In421732508, ~z$r_buff1_thd0~0=~z$r_buff1_thd0~0_In421732508, ~z$w_buff1_used~0=~z$w_buff1_used~0_In421732508} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite29] because there is no mapped edge [2019-12-18 18:34:48,134 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [721] [721] L831-->L832: Formula: (and (= v_~z$r_buff0_thd0~0_103 v_~z$r_buff0_thd0~0_102) (not (= (mod v_~weak$$choice2~0_23 256) 0))) InVars {~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_103, ~weak$$choice2~0=v_~weak$$choice2~0_23} OutVars{~z$r_buff0_thd0~0=v_~z$r_buff0_thd0~0_102, ULTIMATE.start_main_#t~ite47=|v_ULTIMATE.start_main_#t~ite47_6|, ULTIMATE.start_main_#t~ite46=|v_ULTIMATE.start_main_#t~ite46_10|, ULTIMATE.start_main_#t~ite48=|v_ULTIMATE.start_main_#t~ite48_6|, ~weak$$choice2~0=v_~weak$$choice2~0_23} AuxVars[] AssignedVars[~z$r_buff0_thd0~0, ULTIMATE.start_main_#t~ite47, ULTIMATE.start_main_#t~ite46, ULTIMATE.start_main_#t~ite48] because there is no mapped edge [2019-12-18 18:34:48,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [801] [801] L834-->L837-1: Formula: (and (= v_~z$mem_tmp~0_11 v_~z~0_133) (= (mod v_~main$tmp_guard1~0_9 256) |v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|) (not (= 0 (mod v_~z$flush_delayed~0_21 256))) (= 0 v_~z$flush_delayed~0_20)) InVars {~z$mem_tmp~0=v_~z$mem_tmp~0_11, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_21} OutVars{~z$mem_tmp~0=v_~z$mem_tmp~0_11, ULTIMATE.start_main_#t~ite52=|v_ULTIMATE.start_main_#t~ite52_18|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_9, ~z$flush_delayed~0=v_~z$flush_delayed~0_20, ~z~0=v_~z~0_133, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_6|} AuxVars[] AssignedVars[ULTIMATE.start_main_#t~ite52, ~z$flush_delayed~0, ~z~0, ULTIMATE.start___VERIFIER_assert_#in~expression] because there is no mapped edge [2019-12-18 18:34:48,136 WARN L123 codingBacktranslator]: Skipped backtranslation of ATE [788] [788] L837-1-->ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION: Formula: (and (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 |v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|) (= v_ULTIMATE.start___VERIFIER_assert_~expression_11 0)) InVars {ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} OutVars{ULTIMATE.start___VERIFIER_assert_~expression=v_ULTIMATE.start___VERIFIER_assert_~expression_11, ULTIMATE.start___VERIFIER_assert_#in~expression=|v_ULTIMATE.start___VERIFIER_assert_#in~expression_5|} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression] because there is no mapped edge [2019-12-18 18:34:48,254 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 18.12 06:34:48 BasicIcfg [2019-12-18 18:34:48,254 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-12-18 18:34:48,256 INFO L168 Benchmark]: Toolchain (without parser) took 90252.00 ms. Allocated memory was 138.4 MB in the beginning and 2.8 GB in the end (delta: 2.7 GB). Free memory was 102.1 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 514.8 MB. Max. memory is 7.1 GB. [2019-12-18 18:34:48,256 INFO L168 Benchmark]: CDTParser took 0.40 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. [2019-12-18 18:34:48,257 INFO L168 Benchmark]: CACSL2BoogieTranslator took 811.80 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.7 MB in the beginning and 156.3 MB in the end (delta: -54.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. [2019-12-18 18:34:48,258 INFO L168 Benchmark]: Boogie Procedure Inliner took 68.36 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. [2019-12-18 18:34:48,258 INFO L168 Benchmark]: Boogie Preprocessor took 42.53 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 150.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. [2019-12-18 18:34:48,259 INFO L168 Benchmark]: RCFGBuilder took 968.75 ms. Allocated memory is still 202.9 MB. Free memory was 150.9 MB in the beginning and 101.2 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. [2019-12-18 18:34:48,259 INFO L168 Benchmark]: TraceAbstraction took 88355.12 ms. Allocated memory was 202.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 100.6 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 448.8 MB. Max. memory is 7.1 GB. [2019-12-18 18:34:48,263 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.40 ms. Allocated memory is still 138.4 MB. Free memory was 121.6 MB in the beginning and 121.4 MB in the end (delta: 210.0 kB). Peak memory consumption was 210.0 kB. Max. memory is 7.1 GB. * CACSL2BoogieTranslator took 811.80 ms. Allocated memory was 138.4 MB in the beginning and 202.9 MB in the end (delta: 64.5 MB). Free memory was 101.7 MB in the beginning and 156.3 MB in the end (delta: -54.6 MB). Peak memory consumption was 25.8 MB. Max. memory is 7.1 GB. * Boogie Procedure Inliner took 68.36 ms. Allocated memory is still 202.9 MB. Free memory was 156.3 MB in the beginning and 153.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 7.1 GB. * Boogie Preprocessor took 42.53 ms. Allocated memory is still 202.9 MB. Free memory was 153.6 MB in the beginning and 150.9 MB in the end (delta: 2.6 MB). Peak memory consumption was 2.6 MB. Max. memory is 7.1 GB. * RCFGBuilder took 968.75 ms. Allocated memory is still 202.9 MB. Free memory was 150.9 MB in the beginning and 101.2 MB in the end (delta: 49.7 MB). Peak memory consumption was 49.7 MB. Max. memory is 7.1 GB. * TraceAbstraction took 88355.12 ms. Allocated memory was 202.9 MB in the beginning and 2.8 GB in the end (delta: 2.6 GB). Free memory was 100.6 MB in the beginning and 2.3 GB in the end (delta: -2.2 GB). Peak memory consumption was 448.8 MB. Max. memory is 7.1 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: PetriNetLargeBlockEncoding benchmarks LbeTime: 5.5s, 174 ProgramPointsBefore, 93 ProgramPointsAfterwards, 211 TransitionsBefore, 104 TransitionsAfterwards, 17114 CoEnabledTransitionPairs, 8 FixpointIterations, 31 TrivialSequentialCompositions, 44 ConcurrentSequentialCompositions, 0 TrivialYvCompositions, 37 ConcurrentYvCompositions, 30 ChoiceCompositions, 6114 VarBasedMoverChecksPositive, 254 VarBasedMoverChecksNegative, 80 SemBasedMoverChecksPositive, 255 SemBasedMoverChecksNegative, 0 SemBasedMoverChecksUnknown, SemBasedMoverCheckTime: 1.6s, 0 MoverChecksTotal, 86146 CheckedPairsTotal, 112 TotalNumberOfCompositions - CounterExampleResult [Line: 4]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L805] FCALL, FORK 0 pthread_create(&t2037, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L732] 1 z$r_buff1_thd0 = z$r_buff0_thd0 [L733] 1 z$r_buff1_thd1 = z$r_buff0_thd1 [L734] 1 z$r_buff1_thd2 = z$r_buff0_thd2 [L735] 1 z$r_buff1_thd3 = z$r_buff0_thd3 [L736] 1 z$r_buff0_thd1 = (_Bool)1 [L739] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] EXPR 1 z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L807] FCALL, FORK 0 pthread_create(&t2038, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0] [L742] 1 z = z$w_buff0_used && z$r_buff0_thd1 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd1 ? z$w_buff1 : z) [L743] 1 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd1 ? (_Bool)0 : z$w_buff0_used [L744] 1 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd1 || z$w_buff1_used && z$r_buff1_thd1 ? (_Bool)0 : z$w_buff1_used [L809] FCALL, FORK 0 pthread_create(&t2039, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L756] 2 x = 2 [L759] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L762] EXPR 2 z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L776] 3 __unbuffered_p2_EAX = y [L779] 3 z = 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L782] 3 z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd3 ? z$w_buff1 : z) VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z)=2, z$w_buff1=0, z$w_buff1_used=0, z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z=2] [L783] 3 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used [L784] 3 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd3 || z$w_buff1_used && z$r_buff1_thd3 ? (_Bool)0 : z$w_buff1_used [L785] 3 z$r_buff0_thd3 = z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3 [L762] 2 z = z$w_buff0_used && z$r_buff0_thd2 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd2 ? z$w_buff1 : z) [L763] 2 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$w_buff0_used [L764] 2 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd2 || z$w_buff1_used && z$r_buff1_thd2 ? (_Bool)0 : z$w_buff1_used [L765] 2 z$r_buff0_thd2 = z$w_buff0_used && z$r_buff0_thd2 ? (_Bool)0 : z$r_buff0_thd2 [L815] EXPR 0 z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L815] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L816] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L817] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L818] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L819] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 [L822] 0 weak$$choice0 = __VERIFIER_nondet_bool() [L823] 0 weak$$choice2 = __VERIFIER_nondet_bool() [L824] 0 z$flush_delayed = weak$$choice2 [L825] 0 z$mem_tmp = z VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] EXPR 0 !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L826] 0 z = !z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff1) [L827] EXPR 0 weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L827] 0 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : z$w_buff0)) [L828] EXPR 0 weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L828] 0 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff1 : z$w_buff1)) [L829] EXPR 0 weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L829] 0 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used)) [L830] EXPR 0 weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L830] 0 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L832] EXPR 0 weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] [L832] 0 z$r_buff1_thd0 = weak$$choice2 ? z$r_buff1_thd0 : (!z$w_buff0_used || !z$r_buff0_thd0 && !z$w_buff1_used || !z$r_buff0_thd0 && !z$r_buff1_thd0 ? z$r_buff1_thd0 : (z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : (_Bool)0)) [L833] 0 main$tmp_guard1 = !(x == 2 && z == 2 && __unbuffered_p2_EAX == 1) VAL [\result={0:0}, \result={0:0}, __unbuffered_cnt=3, __unbuffered_p2_EAX=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice0=7, weak$$choice2=1, x=2, y=1, z=2, z$flush_delayed=1, z$mem_tmp=2, z$r_buff0_thd0=0, z$r_buff0_thd1=1, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=2, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0] - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 165 locations, 2 error locations. Result: UNSAFE, OverallTime: 88.0s, OverallIterations: 17, TraceHistogramMax: 1, AutomataDifference: 27.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, HoareTripleCheckerStatistics: 2417 SDtfs, 3143 SDslu, 6773 SDs, 0 SdLazy, 4953 SolverSat, 341 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 5.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 197 GetRequests, 19 SyntacticMatches, 13 SemanticMatches, 165 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2224 ImplicationChecksByTransitivity, 6.1s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=178183occurred in iteration=3, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 36.5s AutomataMinimizationTime, 16 MinimizatonAttempts, 74964 StatesRemovedByMinimization, 14 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 2.7s InterpolantComputationTime, 786 NumberOfCodeBlocks, 786 NumberOfCodeBlocksAsserted, 17 NumberOfCheckSat, 702 ConstructedInterpolants, 0 QuantifiedInterpolants, 291483 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 16 InterpolantComputations, 16 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...